About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.428 | 3600000.00 | 9967759.00 | 271770.60 | FFFFF?FTFFFF?TTT | 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-171654371900023.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-S16C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900023
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 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 5.2M 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-S16C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716627549031
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-S16C06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 08:59:10] [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:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:59:10] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2024-05-25 08:59:10] [INFO ] Transformed 5568 places.
[2024-05-25 08:59:10] [INFO ] Transformed 7799 transitions.
[2024-05-25 08:59:11] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 581 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 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1614 places :
Symmetric choice reduction at 1 with 1614 rule applications. Total rules 1646 place count 3922 transition count 6185
Iterating global reduction 1 with 1614 rules applied. Total rules applied 3260 place count 3922 transition count 6185
Discarding 1420 places :
Symmetric choice reduction at 1 with 1420 rule applications. Total rules 4680 place count 2502 transition count 4765
Iterating global reduction 1 with 1420 rules applied. Total rules applied 6100 place count 2502 transition count 4765
Discarding 225 places :
Symmetric choice reduction at 1 with 225 rule applications. Total rules 6325 place count 2277 transition count 3415
Iterating global reduction 1 with 225 rules applied. Total rules applied 6550 place count 2277 transition count 3415
Applied a total of 6550 rules in 1152 ms. Remains 2277 /5568 variables (removed 3291) and now considering 3415/7799 (removed 4384) transitions.
[2024-05-25 08:59:12] [INFO ] Flow matrix only has 3143 transitions (discarded 272 similar events)
// Phase 1: matrix 3143 rows 2277 cols
[2024-05-25 08:59:12] [INFO ] Computed 541 invariants in 164 ms
[2024-05-25 08:59:15] [INFO ] Implicit Places using invariants in 2996 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 29, 36, 45, 56, 69, 84, 100, 116, 118, 120, 122, 126, 128, 143, 154, 163, 170, 175, 178, 205, 212, 215, 216, 217, 218, 219, 220, 221, 224, 229, 236, 245, 256, 269, 283, 297, 298, 299, 300, 301, 302, 303, 314, 323, 330, 335, 338, 340, 367, 374, 377, 378, 380, 381, 382, 383, 385, 388, 393, 400, 409, 423, 435, 447, 448, 449, 450, 452, 453, 462, 469, 474, 477, 482, 484, 511, 518, 521, 522, 523, 524, 525, 526, 527, 529, 531, 534, 539, 546, 555, 565, 575, 576, 577, 578, 579, 580, 581, 588, 593, 596, 598, 600, 602, 629, 636, 639, 640, 641, 642, 643, 644, 645, 647, 649, 651, 654, 659, 666, 674, 682, 683, 684, 685, 686, 687, 688, 693, 696, 698, 700, 702, 704, 731, 738, 741, 742, 743, 744, 745, 746, 747, 749, 751, 753, 755, 758, 763, 769, 775, 776, 777, 778, 779, 780, 781, 784, 786, 788, 790, 792, 794, 821, 828, 831, 832, 833, 834, 835, 836, 837, 839, 841, 843, 845, 848, 851, 855, 859, 860, 861, 862, 863, 864, 865, 867, 869, 871, 873, 875, 877, 904, 911, 914, 915, 916, 918, 919, 920, 922, 926, 928, 930, 932, 934, 936, 939, 940, 941, 942, 943, 944, 945, 947, 949, 951, 953, 955, 957, 984, 986, 990, 993, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1024, 1026, 1028, 1030, 1032, 1034, 1061, 1068, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1079, 1081, 1083, 1085, 1088, 1090, 1092, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1103, 1105, 1107, 1109, 1112, 1114, 1141, 1148, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1160, 1162, 1164, 1166, 1168, 1170, 1173, 1178, 1179, 1180, 1182, 1185, 1190, 1192, 1194, 1196, 1201, 1203, 1237, 1241, 1242, 1243, 1244, 1245, 1246, 1248, 1253, 1255, 1258, 1260, 1263, 1268, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1286, 1289, 1291, 1293, 1295, 1297, 1324, 1331, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1344, 1346, 1348, 1351, 1356, 1363, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1385, 1390, 1393, 1395, 1397, 1399, 1426, 1433, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1444, 1446, 1448, 1451, 1456, 1463, 1472, 1483, 1484, 1485, 1486, 1487, 1489, 1498, 1508, 1513, 1516, 1518, 1520, 1547, 1554, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1565, 1567, 1570, 1575, 1582, 1591, 1602, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1641, 1648, 1653, 1656, 1658, 1685, 1692, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1703, 1706, 1711, 1718, 1727, 1738, 1751, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1785, 1796, 1805, 1812, 1817, 1820, 1847, 1849, 1853, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1865, 1870, 1877, 1886, 1897, 1910, 1925, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1963, 1976, 1987, 1996, 2003, 2008, 2036]
Discarding 486 places :
Implicit Place search using SMT only with invariants took 3033 ms to find 486 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1791/5568 places, 3415/7799 transitions.
Discarding 184 places :
Symmetric choice reduction at 0 with 184 rule applications. Total rules 184 place count 1607 transition count 3231
Iterating global reduction 0 with 184 rules applied. Total rules applied 368 place count 1607 transition count 3231
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 551 place count 1424 transition count 3048
Iterating global reduction 0 with 183 rules applied. Total rules applied 734 place count 1424 transition count 3048
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 917 place count 1241 transition count 2865
Iterating global reduction 0 with 183 rules applied. Total rules applied 1100 place count 1241 transition count 2865
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1124 place count 1217 transition count 2721
Iterating global reduction 0 with 24 rules applied. Total rules applied 1148 place count 1217 transition count 2721
Applied a total of 1148 rules in 188 ms. Remains 1217 /1791 variables (removed 574) and now considering 2721/3415 (removed 694) transitions.
[2024-05-25 08:59:15] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1217 cols
[2024-05-25 08:59:15] [INFO ] Computed 55 invariants in 52 ms
[2024-05-25 08:59:16] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-25 08:59:16] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
[2024-05-25 08:59:16] [INFO ] Invariant cache hit.
[2024-05-25 08:59:17] [INFO ] State equation strengthened by 933 read => feed constraints.
[2024-05-25 08:59:27] [INFO ] Implicit Places using invariants and state equation in 11230 ms returned []
Implicit Place search using SMT with State Equation took 12133 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1217/5568 places, 2721/7799 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16508 ms. Remains : 1217/5568 places, 2721/7799 transitions.
Support contains 48 out of 1217 places after structural reductions.
[2024-05-25 08:59:28] [INFO ] Flatten gal took : 187 ms
[2024-05-25 08:59:28] [INFO ] Flatten gal took : 121 ms
[2024-05-25 08:59:28] [INFO ] Input system was already deterministic with 2721 transitions.
Support contains 44 out of 1217 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :1
Running SMT prover for 16 properties.
[2024-05-25 08:59:29] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
[2024-05-25 08:59:29] [INFO ] Invariant cache hit.
[2024-05-25 08:59:29] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2024-05-25 08:59:29] [INFO ] [Real]Absence check using 31 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-25 08:59:30] [INFO ] After 859ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-25 08:59:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2024-05-25 08:59:30] [INFO ] [Nat]Absence check using 31 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-25 08:59:32] [INFO ] After 1811ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2024-05-25 08:59:32] [INFO ] State equation strengthened by 933 read => feed constraints.
[2024-05-25 08:59:35] [INFO ] After 2412ms SMT Verify possible using 933 Read/Feed constraints in natural domain returned unsat :5 sat :11
[2024-05-25 08:59:35] [INFO ] Deduced a trap composed of 338 places in 504 ms of which 6 ms to minimize.
[2024-05-25 08:59:36] [INFO ] Deduced a trap composed of 388 places in 502 ms of which 1 ms to minimize.
[2024-05-25 08:59:36] [INFO ] Deduced a trap composed of 260 places in 478 ms of which 1 ms to minimize.
[2024-05-25 08:59:37] [INFO ] Deduced a trap composed of 286 places in 481 ms of which 1 ms to minimize.
[2024-05-25 08:59:37] [INFO ] Deduced a trap composed of 368 places in 516 ms of which 2 ms to minimize.
[2024-05-25 08:59:38] [INFO ] Deduced a trap composed of 369 places in 494 ms of which 1 ms to minimize.
[2024-05-25 08:59:39] [INFO ] Deduced a trap composed of 384 places in 490 ms of which 1 ms to minimize.
[2024-05-25 08:59:39] [INFO ] Deduced a trap composed of 383 places in 488 ms of which 2 ms to minimize.
[2024-05-25 08:59:40] [INFO ] Deduced a trap composed of 358 places in 478 ms of which 1 ms to minimize.
[2024-05-25 08:59:40] [INFO ] Deduced a trap composed of 350 places in 488 ms of which 1 ms to minimize.
[2024-05-25 08:59:41] [INFO ] Deduced a trap composed of 357 places in 494 ms of which 1 ms to minimize.
[2024-05-25 08:59:41] [INFO ] Deduced a trap composed of 309 places in 492 ms of which 2 ms to minimize.
[2024-05-25 08:59:42] [INFO ] Deduced a trap composed of 361 places in 477 ms of which 1 ms to minimize.
[2024-05-25 08:59:43] [INFO ] Deduced a trap composed of 290 places in 514 ms of which 1 ms to minimize.
[2024-05-25 08:59:43] [INFO ] Deduced a trap composed of 458 places in 465 ms of which 1 ms to minimize.
[2024-05-25 08:59:44] [INFO ] Deduced a trap composed of 290 places in 435 ms of which 1 ms to minimize.
[2024-05-25 08:59:44] [INFO ] Deduced a trap composed of 282 places in 491 ms of which 1 ms to minimize.
[2024-05-25 08:59:45] [INFO ] Deduced a trap composed of 383 places in 463 ms of which 1 ms to minimize.
[2024-05-25 08:59:46] [INFO ] Deduced a trap composed of 348 places in 457 ms of which 2 ms to minimize.
[2024-05-25 08:59:46] [INFO ] Deduced a trap composed of 290 places in 444 ms of which 1 ms to minimize.
[2024-05-25 08:59:47] [INFO ] Deduced a trap composed of 281 places in 474 ms of which 1 ms to minimize.
[2024-05-25 08:59:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 12423 ms
[2024-05-25 08:59:48] [INFO ] Deduced a trap composed of 318 places in 483 ms of which 2 ms to minimize.
[2024-05-25 08:59:49] [INFO ] Deduced a trap composed of 175 places in 497 ms of which 2 ms to minimize.
[2024-05-25 08:59:50] [INFO ] Deduced a trap composed of 123 places in 497 ms of which 2 ms to minimize.
[2024-05-25 08:59:50] [INFO ] Deduced a trap composed of 168 places in 492 ms of which 1 ms to minimize.
[2024-05-25 08:59:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2335 ms
[2024-05-25 08:59:51] [INFO ] Deduced a trap composed of 244 places in 489 ms of which 1 ms to minimize.
[2024-05-25 08:59:52] [INFO ] Deduced a trap composed of 111 places in 497 ms of which 1 ms to minimize.
[2024-05-25 08:59:52] [INFO ] Deduced a trap composed of 342 places in 474 ms of which 1 ms to minimize.
[2024-05-25 08:59:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1858 ms
[2024-05-25 08:59:53] [INFO ] Deduced a trap composed of 112 places in 496 ms of which 1 ms to minimize.
[2024-05-25 08:59:54] [INFO ] Deduced a trap composed of 263 places in 489 ms of which 1 ms to minimize.
[2024-05-25 08:59:54] [INFO ] Deduced a trap composed of 364 places in 483 ms of which 1 ms to minimize.
[2024-05-25 08:59:55] [INFO ] Deduced a trap composed of 94 places in 516 ms of which 1 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:59:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:59:55] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:15
Fused 16 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 16 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 2721/2721 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 1217 transition count 2702
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1198 transition count 2702
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 38 place count 1198 transition count 2686
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 70 place count 1182 transition count 2686
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 1175 transition count 2659
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 1175 transition count 2659
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 84 place count 1175 transition count 2658
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 1174 transition count 2658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 1172 transition count 2651
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 1172 transition count 2651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1171 transition count 2645
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1171 transition count 2645
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 144 place count 1145 transition count 2619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 1143 transition count 2617
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 1143 transition count 2617
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 1141 transition count 2605
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 1141 transition count 2605
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 284 place count 1141 transition count 3208
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 416 place count 1009 transition count 3208
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 423 place count 1009 transition count 3208
Applied a total of 423 rules in 814 ms. Remains 1009 /1217 variables (removed 208) and now considering 3208/2721 (removed -487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 1009/1217 places, 3208/2721 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 08:59:56] [INFO ] Flow matrix only has 2819 transitions (discarded 389 similar events)
// Phase 1: matrix 2819 rows 1009 cols
[2024-05-25 08:59:56] [INFO ] Computed 55 invariants in 53 ms
[2024-05-25 08:59:57] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2024-05-25 08:59:57] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-25 08:59:58] [INFO ] After 1697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 08:59:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2024-05-25 08:59:58] [INFO ] [Nat]Absence check using 33 positive and 22 generalized place invariants in 10 ms returned sat
[2024-05-25 09:00:00] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 09:00:00] [INFO ] State equation strengthened by 1628 read => feed constraints.
[2024-05-25 09:00:03] [INFO ] After 3021ms SMT Verify possible using 1628 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-25 09:00:03] [INFO ] Deduced a trap composed of 180 places in 407 ms of which 1 ms to minimize.
[2024-05-25 09:00:04] [INFO ] Deduced a trap composed of 219 places in 408 ms of which 1 ms to minimize.
[2024-05-25 09:00:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1025 ms
[2024-05-25 09:00:05] [INFO ] Deduced a trap composed of 150 places in 409 ms of which 1 ms to minimize.
[2024-05-25 09:00:05] [INFO ] Deduced a trap composed of 141 places in 371 ms of which 1 ms to minimize.
[2024-05-25 09:00:06] [INFO ] Deduced a trap composed of 140 places in 388 ms of which 1 ms to minimize.
[2024-05-25 09:00:06] [INFO ] Deduced a trap composed of 150 places in 384 ms of which 1 ms to minimize.
[2024-05-25 09:00:07] [INFO ] Deduced a trap composed of 146 places in 383 ms of which 1 ms to minimize.
[2024-05-25 09:00:07] [INFO ] Deduced a trap composed of 158 places in 379 ms of which 2 ms to minimize.
[2024-05-25 09:00:08] [INFO ] Deduced a trap composed of 149 places in 387 ms of which 1 ms to minimize.
[2024-05-25 09:00:08] [INFO ] Deduced a trap composed of 144 places in 408 ms of which 1 ms to minimize.
[2024-05-25 09:00:09] [INFO ] Deduced a trap composed of 157 places in 373 ms of which 1 ms to minimize.
[2024-05-25 09:00:09] [INFO ] Deduced a trap composed of 138 places in 409 ms of which 1 ms to minimize.
[2024-05-25 09:00:10] [INFO ] Deduced a trap composed of 153 places in 404 ms of which 2 ms to minimize.
[2024-05-25 09:00:11] [INFO ] Deduced a trap composed of 193 places in 397 ms of which 1 ms to minimize.
[2024-05-25 09:00:11] [INFO ] Deduced a trap composed of 158 places in 375 ms of which 1 ms to minimize.
[2024-05-25 09:00:12] [INFO ] Deduced a trap composed of 149 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:00:12] [INFO ] Deduced a trap composed of 140 places in 410 ms of which 0 ms to minimize.
[2024-05-25 09:00:13] [INFO ] Deduced a trap composed of 154 places in 378 ms of which 1 ms to minimize.
[2024-05-25 09:00:13] [INFO ] Deduced a trap composed of 153 places in 417 ms of which 2 ms to minimize.
[2024-05-25 09:00:14] [INFO ] Deduced a trap composed of 127 places in 416 ms of which 1 ms to minimize.
[2024-05-25 09:00:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 9660 ms
[2024-05-25 09:00:15] [INFO ] Deduced a trap composed of 87 places in 468 ms of which 1 ms to minimize.
[2024-05-25 09:00:15] [INFO ] Deduced a trap composed of 95 places in 442 ms of which 1 ms to minimize.
[2024-05-25 09:00:16] [INFO ] Deduced a trap composed of 71 places in 435 ms of which 1 ms to minimize.
[2024-05-25 09:00:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2221 ms
[2024-05-25 09:00:18] [INFO ] Deduced a trap composed of 94 places in 455 ms of which 1 ms to minimize.
[2024-05-25 09:00:18] [INFO ] Deduced a trap composed of 211 places in 405 ms of which 0 ms to minimize.
[2024-05-25 09:00:19] [INFO ] Deduced a trap composed of 106 places in 448 ms of which 1 ms to minimize.
[2024-05-25 09:00:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1601 ms
[2024-05-25 09:00:20] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 1 ms to minimize.
[2024-05-25 09:00:20] [INFO ] Deduced a trap composed of 147 places in 394 ms of which 1 ms to minimize.
[2024-05-25 09:00:21] [INFO ] Deduced a trap composed of 149 places in 385 ms of which 1 ms to minimize.
[2024-05-25 09:00:21] [INFO ] Deduced a trap composed of 151 places in 383 ms of which 1 ms to minimize.
[2024-05-25 09:00:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2100 ms
[2024-05-25 09:00:23] [INFO ] Deduced a trap composed of 127 places in 429 ms of which 1 ms to minimize.
[2024-05-25 09:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2024-05-25 09:00:23] [INFO ] After 23379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 09:00:23] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 33 ms.
Support contains 14 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 3208/3208 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1009 transition count 3206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1007 transition count 3206
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1007 transition count 3206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1005 transition count 3204
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1005 transition count 3204
Applied a total of 10 rules in 214 ms. Remains 1005 /1009 variables (removed 4) and now considering 3204/3208 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1005/1009 places, 3204/3208 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 66091 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66091 steps, saw 27864 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-25 09:00:27] [INFO ] Flow matrix only has 2815 transitions (discarded 389 similar events)
// Phase 1: matrix 2815 rows 1005 cols
[2024-05-25 09:00:27] [INFO ] Computed 55 invariants in 40 ms
[2024-05-25 09:00:27] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2024-05-25 09:00:27] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-25 09:00:29] [INFO ] After 1702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 09:00:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2024-05-25 09:00:29] [INFO ] [Nat]Absence check using 33 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-25 09:00:31] [INFO ] After 1338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 09:00:31] [INFO ] State equation strengthened by 1628 read => feed constraints.
[2024-05-25 09:00:33] [INFO ] After 2389ms SMT Verify possible using 1628 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-25 09:00:34] [INFO ] Deduced a trap composed of 215 places in 399 ms of which 1 ms to minimize.
[2024-05-25 09:00:34] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 3 ms to minimize.
[2024-05-25 09:00:35] [INFO ] Deduced a trap composed of 237 places in 403 ms of which 1 ms to minimize.
[2024-05-25 09:00:35] [INFO ] Deduced a trap composed of 247 places in 406 ms of which 3 ms to minimize.
[2024-05-25 09:00:36] [INFO ] Deduced a trap composed of 235 places in 395 ms of which 1 ms to minimize.
[2024-05-25 09:00:36] [INFO ] Deduced a trap composed of 237 places in 390 ms of which 1 ms to minimize.
[2024-05-25 09:00:37] [INFO ] Deduced a trap composed of 254 places in 382 ms of which 1 ms to minimize.
[2024-05-25 09:00:37] [INFO ] Deduced a trap composed of 238 places in 413 ms of which 1 ms to minimize.
[2024-05-25 09:00:38] [INFO ] Deduced a trap composed of 245 places in 388 ms of which 1 ms to minimize.
[2024-05-25 09:00:38] [INFO ] Deduced a trap composed of 245 places in 403 ms of which 1 ms to minimize.
[2024-05-25 09:00:39] [INFO ] Deduced a trap composed of 219 places in 410 ms of which 0 ms to minimize.
[2024-05-25 09:00:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5730 ms
[2024-05-25 09:00:40] [INFO ] Deduced a trap composed of 126 places in 422 ms of which 1 ms to minimize.
[2024-05-25 09:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 576 ms
[2024-05-25 09:00:41] [INFO ] Deduced a trap composed of 192 places in 409 ms of which 1 ms to minimize.
[2024-05-25 09:00:41] [INFO ] Deduced a trap composed of 83 places in 458 ms of which 0 ms to minimize.
[2024-05-25 09:00:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1090 ms
[2024-05-25 09:00:42] [INFO ] Deduced a trap composed of 100 places in 468 ms of which 1 ms to minimize.
[2024-05-25 09:00:43] [INFO ] Deduced a trap composed of 80 places in 480 ms of which 1 ms to minimize.
[2024-05-25 09:00:43] [INFO ] Deduced a trap composed of 75 places in 472 ms of which 1 ms to minimize.
[2024-05-25 09:00:44] [INFO ] Deduced a trap composed of 89 places in 466 ms of which 1 ms to minimize.
[2024-05-25 09:00:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2816 ms
[2024-05-25 09:00:45] [INFO ] Deduced a trap composed of 98 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:00:46] [INFO ] Deduced a trap composed of 185 places in 410 ms of which 1 ms to minimize.
[2024-05-25 09:00:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1361 ms
[2024-05-25 09:00:46] [INFO ] Deduced a trap composed of 163 places in 377 ms of which 1 ms to minimize.
[2024-05-25 09:00:47] [INFO ] Deduced a trap composed of 135 places in 433 ms of which 1 ms to minimize.
[2024-05-25 09:00:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1144 ms
[2024-05-25 09:00:49] [INFO ] Deduced a trap composed of 76 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:00:50] [INFO ] Deduced a trap composed of 79 places in 480 ms of which 1 ms to minimize.
[2024-05-25 09:00:50] [INFO ] Deduced a trap composed of 85 places in 467 ms of which 1 ms to minimize.
[2024-05-25 09:00:51] [INFO ] Deduced a trap composed of 85 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:00:51] [INFO ] Deduced a trap composed of 194 places in 418 ms of which 1 ms to minimize.
[2024-05-25 09:00:52] [INFO ] Deduced a trap composed of 80 places in 476 ms of which 1 ms to minimize.
[2024-05-25 09:00:52] [INFO ] Deduced a trap composed of 70 places in 472 ms of which 1 ms to minimize.
[2024-05-25 09:00:53] [INFO ] Deduced a trap composed of 72 places in 464 ms of which 1 ms to minimize.
[2024-05-25 09:00:54] [INFO ] Deduced a trap composed of 93 places in 491 ms of which 1 ms to minimize.
[2024-05-25 09:00:54] [INFO ] Deduced a trap composed of 81 places in 466 ms of which 1 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 09:00:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:00:54] [INFO ] After 25158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 10 ms.
Support contains 14 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 3204/3204 transitions.
Applied a total of 0 rules in 85 ms. Remains 1005 /1005 variables (removed 0) and now considering 3204/3204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1005/1005 places, 3204/3204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 3204/3204 transitions.
Applied a total of 0 rules in 81 ms. Remains 1005 /1005 variables (removed 0) and now considering 3204/3204 (removed 0) transitions.
[2024-05-25 09:00:54] [INFO ] Flow matrix only has 2815 transitions (discarded 389 similar events)
[2024-05-25 09:00:54] [INFO ] Invariant cache hit.
[2024-05-25 09:00:55] [INFO ] Implicit Places using invariants in 933 ms returned [84, 235, 282, 457, 533, 547, 554, 729]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 938 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 997/1005 places, 3204/3204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 995 transition count 3202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 995 transition count 3202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 993 transition count 3200
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 993 transition count 3200
Applied a total of 8 rules in 138 ms. Remains 993 /997 variables (removed 4) and now considering 3200/3204 (removed 4) transitions.
[2024-05-25 09:00:55] [INFO ] Flow matrix only has 2811 transitions (discarded 389 similar events)
// Phase 1: matrix 2811 rows 993 cols
[2024-05-25 09:00:55] [INFO ] Computed 47 invariants in 39 ms
[2024-05-25 09:00:56] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-25 09:00:56] [INFO ] Flow matrix only has 2811 transitions (discarded 389 similar events)
[2024-05-25 09:00:56] [INFO ] Invariant cache hit.
[2024-05-25 09:00:57] [INFO ] State equation strengthened by 1628 read => feed constraints.
[2024-05-25 09:01:12] [INFO ] Implicit Places using invariants and state equation in 15296 ms returned []
Implicit Place search using SMT with State Equation took 16194 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 993/1005 places, 3200/3204 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17351 ms. Remains : 993/1005 places, 3200/3204 transitions.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 385 stabilizing places and 1088 stable transitions
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 U X(p1)))))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1205 transition count 2689
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1205 transition count 2689
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1197 transition count 2676
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1197 transition count 2676
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1190 transition count 2634
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1190 transition count 2634
Applied a total of 54 rules in 164 ms. Remains 1190 /1217 variables (removed 27) and now considering 2634/2721 (removed 87) transitions.
[2024-05-25 09:01:12] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1190 cols
[2024-05-25 09:01:12] [INFO ] Computed 55 invariants in 38 ms
[2024-05-25 09:01:13] [INFO ] Implicit Places using invariants in 951 ms returned [104, 293, 347, 641, 642, 656, 665, 783, 870]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 953 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1181/1217 places, 2634/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1174 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1174 transition count 2627
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1167 transition count 2620
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1167 transition count 2620
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1160 transition count 2613
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1160 transition count 2613
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1154 transition count 2577
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1154 transition count 2577
Applied a total of 54 rules in 201 ms. Remains 1154 /1181 variables (removed 27) and now considering 2577/2634 (removed 57) transitions.
[2024-05-25 09:01:13] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1154 cols
[2024-05-25 09:01:13] [INFO ] Computed 46 invariants in 28 ms
[2024-05-25 09:01:14] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-05-25 09:01:14] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
[2024-05-25 09:01:14] [INFO ] Invariant cache hit.
[2024-05-25 09:01:15] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-25 09:01:21] [INFO ] Implicit Places using invariants and state equation in 7433 ms returned []
Implicit Place search using SMT with State Equation took 8325 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1154/1217 places, 2577/2721 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9646 ms. Remains : 1154/1217 places, 2577/2721 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 299 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s548 1) (GEQ s563 1)), p1:(AND (GEQ s616 1) (GEQ s1110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 finished in 10004 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 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1195 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 163 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-25 09:01:22] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-25 09:01:22] [INFO ] Computed 55 invariants in 33 ms
[2024-05-25 09:01:23] [INFO ] Implicit Places using invariants in 945 ms returned [104, 293, 347, 556, 639, 640, 654, 663, 781, 868]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 948 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1170 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1170 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1162 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1162 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1154 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1154 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1147 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1147 transition count 2561
Applied a total of 62 rules in 201 ms. Remains 1147 /1178 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-25 09:01:23] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-25 09:01:23] [INFO ] Computed 45 invariants in 24 ms
[2024-05-25 09:01:24] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-25 09:01:24] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:01:24] [INFO ] Invariant cache hit.
[2024-05-25 09:01:25] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:01:32] [INFO ] Implicit Places using invariants and state equation in 8522 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9393 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1217 places, 2561/2721 transitions.
Applied a total of 0 rules in 44 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 10751 ms. Remains : 1146/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 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 s591 1) (LT s1113 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 8950 steps with 143 reset in 128 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 finished in 10996 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((F(p1)&&p0))||G(p2))))'
Support contains 6 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 78 place count 1178 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 1170 transition count 2649
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 1170 transition count 2649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 1170 transition count 2648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1169 transition count 2648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 1166 transition count 2635
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1166 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1165 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1165 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 158 place count 1138 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 164 place count 1132 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 1132 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 1126 transition count 2560
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 1126 transition count 2560
Applied a total of 182 rules in 455 ms. Remains 1126 /1217 variables (removed 91) and now considering 2560/2721 (removed 161) transitions.
[2024-05-25 09:01:33] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1126 cols
[2024-05-25 09:01:33] [INFO ] Computed 55 invariants in 46 ms
[2024-05-25 09:01:34] [INFO ] Implicit Places using invariants in 901 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 735, 820]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 904 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1116/1217 places, 2560/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1113 transition count 2557
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1113 transition count 2557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1110 transition count 2554
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1110 transition count 2554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1108 transition count 2542
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1108 transition count 2542
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1103 transition count 2537
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1098 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1098 transition count 2532
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1093 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1093 transition count 2502
Applied a total of 46 rules in 325 ms. Remains 1093 /1116 variables (removed 23) and now considering 2502/2560 (removed 58) transitions.
[2024-05-25 09:01:34] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1093 cols
[2024-05-25 09:01:34] [INFO ] Computed 45 invariants in 28 ms
[2024-05-25 09:01:35] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-25 09:01:35] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-25 09:01:35] [INFO ] Invariant cache hit.
[2024-05-25 09:01:36] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:01:43] [INFO ] Implicit Places using invariants and state equation in 7673 ms returned [1070]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8516 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1217 places, 2502/2721 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 2501
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 2501
Applied a total of 2 rules in 76 ms. Remains 1091 /1092 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2024-05-25 09:01:43] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1091 cols
[2024-05-25 09:01:43] [INFO ] Computed 44 invariants in 25 ms
[2024-05-25 09:01:44] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-05-25 09:01:44] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:01:44] [INFO ] Invariant cache hit.
[2024-05-25 09:01:45] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:01:50] [INFO ] Implicit Places using invariants and state equation in 6652 ms returned []
Implicit Place search using SMT with State Equation took 7488 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1217 places, 2501/2721 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 17765 ms. Remains : 1091/1217 places, 2501/2721 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s504 1) (LT s595 1)) (OR (LT s75 1) (LT s739 1))), p2:(OR (LT s447 1) (LT s805 1)), p1:(AND (GEQ s504 1) (GEQ s595 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2681 reset in 567 ms.
Product exploration explored 100000 steps with 2640 reset in 652 ms.
Computed a total of 276 stabilizing places and 885 stable transitions
Computed a total of 276 stabilizing places and 885 stable transitions
Detected a total of 276/1091 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2)))]
Knowledge based reduction with 12 factoid took 513 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 09:01:53] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:01:53] [INFO ] Invariant cache hit.
[2024-05-25 09:01:53] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:01:53] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:01:53] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-25 09:01:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:01:53] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:01:54] [INFO ] After 821ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 09:01:54] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:01:54] [INFO ] After 273ms SMT Verify possible using 828 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 09:01:55] [INFO ] Deduced a trap composed of 287 places in 390 ms of which 1 ms to minimize.
[2024-05-25 09:01:55] [INFO ] Deduced a trap composed of 92 places in 396 ms of which 1 ms to minimize.
[2024-05-25 09:01:56] [INFO ] Deduced a trap composed of 98 places in 401 ms of which 1 ms to minimize.
[2024-05-25 09:01:56] [INFO ] Deduced a trap composed of 84 places in 392 ms of which 1 ms to minimize.
[2024-05-25 09:01:57] [INFO ] Deduced a trap composed of 85 places in 395 ms of which 0 ms to minimize.
[2024-05-25 09:01:57] [INFO ] Deduced a trap composed of 84 places in 391 ms of which 1 ms to minimize.
[2024-05-25 09:01:58] [INFO ] Deduced a trap composed of 101 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:01:58] [INFO ] Deduced a trap composed of 240 places in 390 ms of which 1 ms to minimize.
[2024-05-25 09:01:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3870 ms
[2024-05-25 09:01:59] [INFO ] Deduced a trap composed of 290 places in 385 ms of which 1 ms to minimize.
[2024-05-25 09:01:59] [INFO ] Deduced a trap composed of 66 places in 395 ms of which 1 ms to minimize.
[2024-05-25 09:02:00] [INFO ] Deduced a trap composed of 84 places in 394 ms of which 1 ms to minimize.
[2024-05-25 09:02:00] [INFO ] Deduced a trap composed of 70 places in 392 ms of which 1 ms to minimize.
[2024-05-25 09:02:01] [INFO ] Deduced a trap composed of 71 places in 392 ms of which 1 ms to minimize.
[2024-05-25 09:02:01] [INFO ] Deduced a trap composed of 86 places in 391 ms of which 1 ms to minimize.
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 68 places in 402 ms of which 1 ms to minimize.
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 66 places in 388 ms of which 1 ms to minimize.
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 88 places in 387 ms of which 1 ms to minimize.
[2024-05-25 09:02:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4220 ms
[2024-05-25 09:02:03] [INFO ] After 8534ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 371 ms.
[2024-05-25 09:02:03] [INFO ] After 9912ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2501/2501 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1091 transition count 3721
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 961 transition count 3721
Applied a total of 260 rules in 188 ms. Remains 961 /1091 variables (removed 130) and now considering 3721/2501 (removed -1220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 961/1091 places, 3721/2501 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72560 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72560 steps, saw 30298 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:02:06] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
// Phase 1: matrix 3324 rows 961 cols
[2024-05-25 09:02:06] [INFO ] Computed 44 invariants in 26 ms
[2024-05-25 09:02:07] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:02:07] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:02:07] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:02:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:02:07] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:02:08] [INFO ] After 1268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:02:08] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:02:09] [INFO ] After 788ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 09:02:09] [INFO ] Deduced a trap composed of 203 places in 410 ms of which 1 ms to minimize.
[2024-05-25 09:02:10] [INFO ] Deduced a trap composed of 182 places in 422 ms of which 1 ms to minimize.
[2024-05-25 09:02:11] [INFO ] Deduced a trap composed of 73 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:02:12] [INFO ] Deduced a trap composed of 67 places in 463 ms of which 1 ms to minimize.
[2024-05-25 09:02:12] [INFO ] Deduced a trap composed of 64 places in 466 ms of which 1 ms to minimize.
[2024-05-25 09:02:13] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 0 ms to minimize.
[2024-05-25 09:02:13] [INFO ] Deduced a trap composed of 64 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:02:14] [INFO ] Deduced a trap composed of 96 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:02:14] [INFO ] Deduced a trap composed of 86 places in 466 ms of which 1 ms to minimize.
[2024-05-25 09:02:15] [INFO ] Deduced a trap composed of 63 places in 470 ms of which 1 ms to minimize.
[2024-05-25 09:02:16] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 0 ms to minimize.
[2024-05-25 09:02:16] [INFO ] Deduced a trap composed of 83 places in 474 ms of which 1 ms to minimize.
[2024-05-25 09:02:17] [INFO ] Deduced a trap composed of 62 places in 480 ms of which 1 ms to minimize.
[2024-05-25 09:02:18] [INFO ] Deduced a trap composed of 98 places in 477 ms of which 1 ms to minimize.
[2024-05-25 09:02:19] [INFO ] Deduced a trap composed of 156 places in 402 ms of which 0 ms to minimize.
[2024-05-25 09:02:19] [INFO ] Deduced a trap composed of 62 places in 470 ms of which 1 ms to minimize.
[2024-05-25 09:02:20] [INFO ] Deduced a trap composed of 104 places in 470 ms of which 1 ms to minimize.
[2024-05-25 09:02:21] [INFO ] Deduced a trap composed of 94 places in 463 ms of which 1 ms to minimize.
[2024-05-25 09:02:22] [INFO ] Deduced a trap composed of 90 places in 479 ms of which 1 ms to minimize.
[2024-05-25 09:02:22] [INFO ] Deduced a trap composed of 63 places in 477 ms of which 1 ms to minimize.
[2024-05-25 09:02:23] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:02:24] [INFO ] Deduced a trap composed of 61 places in 470 ms of which 0 ms to minimize.
[2024-05-25 09:02:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 15503 ms
[2024-05-25 09:02:25] [INFO ] After 16691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 403 ms.
[2024-05-25 09:02:25] [INFO ] After 18541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 106 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 90 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:02:25] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:02:25] [INFO ] Invariant cache hit.
[2024-05-25 09:02:26] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-25 09:02:26] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:02:26] [INFO ] Invariant cache hit.
[2024-05-25 09:02:27] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:02:43] [INFO ] Implicit Places using invariants and state equation in 16816 ms returned []
Implicit Place search using SMT with State Equation took 17790 ms to find 0 implicit places.
[2024-05-25 09:02:43] [INFO ] Redundant transitions in 274 ms returned []
[2024-05-25 09:02:43] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:02:43] [INFO ] Invariant cache hit.
[2024-05-25 09:02:45] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19379 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1045 edges and 961 vertex of which 17 / 961 are part of one of the 1 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4262 edges and 945 vertex of which 933 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 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 t1199.t1393 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 916 transition count 2953
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 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 289 rules applied. Total rules applied 390 place count 819 transition count 2761
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 651 place count 724 transition count 2595
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 861 place count 653 transition count 2456
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1046 place count 585 transition count 2339
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1191 place count 536 transition count 2243
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1316 place count 489 transition count 2165
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1407 place count 458 transition count 2105
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1482 place count 429 transition count 2059
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 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 9 with 49 rules applied. Total rules applied 1531 place count 412 transition count 2027
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 37 rules applied. Total rules applied 1568 place count 397 transition count 2005
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 19 rules applied. Total rules applied 1587 place count 390 transition count 1993
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 11 rules applied. Total rules applied 1598 place count 385 transition count 1987
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 4 rules applied. Total rules applied 1602 place count 384 transition count 1984
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1606 place count 382 transition count 1982
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1606 place count 382 transition count 1971
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1628 place count 371 transition count 1971
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1912 place count 87 transition count 347
Iterating global reduction 15 with 284 rules applied. Total rules applied 2196 place count 87 transition count 347
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 15 with 262 rules applied. Total rules applied 2458 place count 87 transition count 85
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 2468 place count 77 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2468 place count 77 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2470 place count 76 transition count 84
Discarding 10 places :
Symmetric choice reduction at 17 with 10 rule applications. Total rules 2480 place count 66 transition count 74
Iterating global reduction 17 with 10 rules applied. Total rules applied 2490 place count 66 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 17 with 24 rules applied. Total rules applied 2514 place count 54 transition count 62
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2523 place count 54 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2524 place count 54 transition count 52
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 18 with 13 rules applied. Total rules applied 2537 place count 54 transition count 39
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 2550 place count 41 transition count 39
Applied a total of 2550 rules in 350 ms. Remains 41 /961 variables (removed 920) and now considering 39/3721 (removed 3682) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 41 cols
[2024-05-25 09:02:45] [INFO ] Computed 16 invariants in 0 ms
[2024-05-25 09:02:45] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 09:02:45] [INFO ] [Real]Absence check using 5 positive and 11 generalized place invariants in 3 ms returned sat
[2024-05-25 09:02:45] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:02:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 09:02:45] [INFO ] [Nat]Absence check using 5 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:02:45] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:02:45] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 09:02:45] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND p2 p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 925 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2501/2501 transitions.
Applied a total of 0 rules in 69 ms. Remains 1091 /1091 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2024-05-25 09:02:46] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1091 cols
[2024-05-25 09:02:46] [INFO ] Computed 44 invariants in 24 ms
[2024-05-25 09:02:47] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-25 09:02:47] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:02:47] [INFO ] Invariant cache hit.
[2024-05-25 09:02:48] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:02:54] [INFO ] Implicit Places using invariants and state equation in 6955 ms returned []
Implicit Place search using SMT with State Equation took 7778 ms to find 0 implicit places.
[2024-05-25 09:02:54] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 09:02:54] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:02:54] [INFO ] Invariant cache hit.
[2024-05-25 09:02:55] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8849 ms. Remains : 1091/1091 places, 2501/2501 transitions.
Computed a total of 276 stabilizing places and 885 stable transitions
Computed a total of 276 stabilizing places and 885 stable transitions
Detected a total of 276/1091 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 506 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 09:02:56] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:02:56] [INFO ] Invariant cache hit.
[2024-05-25 09:02:56] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:02:56] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:02:56] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-25 09:02:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:02:56] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 5 ms returned sat
[2024-05-25 09:02:57] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 09:02:57] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:02:57] [INFO ] After 279ms SMT Verify possible using 828 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 09:02:58] [INFO ] Deduced a trap composed of 287 places in 385 ms of which 1 ms to minimize.
[2024-05-25 09:02:58] [INFO ] Deduced a trap composed of 92 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:02:59] [INFO ] Deduced a trap composed of 98 places in 399 ms of which 1 ms to minimize.
[2024-05-25 09:02:59] [INFO ] Deduced a trap composed of 84 places in 396 ms of which 1 ms to minimize.
[2024-05-25 09:03:00] [INFO ] Deduced a trap composed of 85 places in 398 ms of which 1 ms to minimize.
[2024-05-25 09:03:00] [INFO ] Deduced a trap composed of 84 places in 391 ms of which 1 ms to minimize.
[2024-05-25 09:03:01] [INFO ] Deduced a trap composed of 101 places in 397 ms of which 1 ms to minimize.
[2024-05-25 09:03:01] [INFO ] Deduced a trap composed of 240 places in 394 ms of which 1 ms to minimize.
[2024-05-25 09:03:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3854 ms
[2024-05-25 09:03:02] [INFO ] Deduced a trap composed of 290 places in 383 ms of which 0 ms to minimize.
[2024-05-25 09:03:02] [INFO ] Deduced a trap composed of 66 places in 396 ms of which 1 ms to minimize.
[2024-05-25 09:03:03] [INFO ] Deduced a trap composed of 84 places in 400 ms of which 1 ms to minimize.
[2024-05-25 09:03:03] [INFO ] Deduced a trap composed of 70 places in 405 ms of which 1 ms to minimize.
[2024-05-25 09:03:04] [INFO ] Deduced a trap composed of 71 places in 400 ms of which 0 ms to minimize.
[2024-05-25 09:03:04] [INFO ] Deduced a trap composed of 86 places in 395 ms of which 1 ms to minimize.
[2024-05-25 09:03:05] [INFO ] Deduced a trap composed of 68 places in 400 ms of which 1 ms to minimize.
[2024-05-25 09:03:05] [INFO ] Deduced a trap composed of 66 places in 399 ms of which 1 ms to minimize.
[2024-05-25 09:03:06] [INFO ] Deduced a trap composed of 88 places in 400 ms of which 0 ms to minimize.
[2024-05-25 09:03:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4269 ms
[2024-05-25 09:03:06] [INFO ] After 8575ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-25 09:03:06] [INFO ] After 9986ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2501/2501 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1091 transition count 3721
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 961 transition count 3721
Applied a total of 260 rules in 183 ms. Remains 961 /1091 variables (removed 130) and now considering 3721/2501 (removed -1220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 961/1091 places, 3721/2501 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72570 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72570 steps, saw 30300 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:03:10] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
// Phase 1: matrix 3324 rows 961 cols
[2024-05-25 09:03:10] [INFO ] Computed 44 invariants in 33 ms
[2024-05-25 09:03:10] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:03:10] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:03:10] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:03:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:03:10] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:03:11] [INFO ] After 1281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:03:11] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:03:12] [INFO ] After 798ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 09:03:12] [INFO ] Deduced a trap composed of 203 places in 403 ms of which 1 ms to minimize.
[2024-05-25 09:03:14] [INFO ] Deduced a trap composed of 182 places in 417 ms of which 1 ms to minimize.
[2024-05-25 09:03:14] [INFO ] Deduced a trap composed of 73 places in 475 ms of which 0 ms to minimize.
[2024-05-25 09:03:15] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 0 ms to minimize.
[2024-05-25 09:03:15] [INFO ] Deduced a trap composed of 64 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:03:16] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:03:16] [INFO ] Deduced a trap composed of 64 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:03:17] [INFO ] Deduced a trap composed of 96 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:03:18] [INFO ] Deduced a trap composed of 86 places in 481 ms of which 0 ms to minimize.
[2024-05-25 09:03:18] [INFO ] Deduced a trap composed of 63 places in 485 ms of which 1 ms to minimize.
[2024-05-25 09:03:19] [INFO ] Deduced a trap composed of 73 places in 476 ms of which 1 ms to minimize.
[2024-05-25 09:03:20] [INFO ] Deduced a trap composed of 83 places in 473 ms of which 0 ms to minimize.
[2024-05-25 09:03:20] [INFO ] Deduced a trap composed of 62 places in 475 ms of which 1 ms to minimize.
[2024-05-25 09:03:21] [INFO ] Deduced a trap composed of 98 places in 485 ms of which 1 ms to minimize.
[2024-05-25 09:03:22] [INFO ] Deduced a trap composed of 156 places in 405 ms of which 1 ms to minimize.
[2024-05-25 09:03:23] [INFO ] Deduced a trap composed of 62 places in 463 ms of which 0 ms to minimize.
[2024-05-25 09:03:23] [INFO ] Deduced a trap composed of 104 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:03:24] [INFO ] Deduced a trap composed of 94 places in 473 ms of which 0 ms to minimize.
[2024-05-25 09:03:25] [INFO ] Deduced a trap composed of 90 places in 480 ms of which 0 ms to minimize.
[2024-05-25 09:03:26] [INFO ] Deduced a trap composed of 63 places in 486 ms of which 1 ms to minimize.
[2024-05-25 09:03:27] [INFO ] Deduced a trap composed of 73 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:03:27] [INFO ] Deduced a trap composed of 61 places in 483 ms of which 1 ms to minimize.
[2024-05-25 09:03:28] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 15600 ms
[2024-05-25 09:03:28] [INFO ] After 16796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 392 ms.
[2024-05-25 09:03:28] [INFO ] After 18648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 90 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 99 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:03:29] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:03:29] [INFO ] Invariant cache hit.
[2024-05-25 09:03:30] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-25 09:03:30] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:03:30] [INFO ] Invariant cache hit.
[2024-05-25 09:03:30] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:03:48] [INFO ] Implicit Places using invariants and state equation in 18230 ms returned []
Implicit Place search using SMT with State Equation took 19213 ms to find 0 implicit places.
[2024-05-25 09:03:48] [INFO ] Redundant transitions in 169 ms returned []
[2024-05-25 09:03:48] [INFO ] Flow matrix only has 3324 transitions (discarded 397 similar events)
[2024-05-25 09:03:48] [INFO ] Invariant cache hit.
[2024-05-25 09:03:49] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20685 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1045 edges and 961 vertex of which 17 / 961 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4262 edges and 945 vertex of which 933 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 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 t1199.t1393 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 916 transition count 2953
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 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 289 rules applied. Total rules applied 390 place count 819 transition count 2761
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 651 place count 724 transition count 2595
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 861 place count 653 transition count 2456
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1046 place count 585 transition count 2339
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1191 place count 536 transition count 2243
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1316 place count 489 transition count 2165
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1407 place count 458 transition count 2105
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1482 place count 429 transition count 2059
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 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 9 with 49 rules applied. Total rules applied 1531 place count 412 transition count 2027
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 37 rules applied. Total rules applied 1568 place count 397 transition count 2005
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 19 rules applied. Total rules applied 1587 place count 390 transition count 1993
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 11 rules applied. Total rules applied 1598 place count 385 transition count 1987
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 4 rules applied. Total rules applied 1602 place count 384 transition count 1984
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1606 place count 382 transition count 1982
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1606 place count 382 transition count 1971
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1628 place count 371 transition count 1971
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1912 place count 87 transition count 347
Iterating global reduction 15 with 284 rules applied. Total rules applied 2196 place count 87 transition count 347
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 15 with 262 rules applied. Total rules applied 2458 place count 87 transition count 85
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 2468 place count 77 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2468 place count 77 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2470 place count 76 transition count 84
Discarding 10 places :
Symmetric choice reduction at 17 with 10 rule applications. Total rules 2480 place count 66 transition count 74
Iterating global reduction 17 with 10 rules applied. Total rules applied 2490 place count 66 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 17 with 24 rules applied. Total rules applied 2514 place count 54 transition count 62
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2523 place count 54 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2524 place count 54 transition count 52
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 18 with 13 rules applied. Total rules applied 2537 place count 54 transition count 39
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 2550 place count 41 transition count 39
Applied a total of 2550 rules in 302 ms. Remains 41 /961 variables (removed 920) and now considering 39/3721 (removed 3682) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 41 cols
[2024-05-25 09:03:49] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 09:03:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:03:49] [INFO ] [Real]Absence check using 5 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:03:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:03:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:03:50] [INFO ] [Nat]Absence check using 5 positive and 11 generalized place invariants in 3 ms returned sat
[2024-05-25 09:03:50] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:03:50] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 09:03:50] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 13 factoid took 949 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2658 reset in 520 ms.
Product exploration explored 100000 steps with 2666 reset in 550 ms.
Built C files in :
/tmp/ltsmin5341315239053739772
[2024-05-25 09:03:52] [INFO ] Too many transitions (2501) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:03:52] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5341315239053739772
Running compilation step : cd /tmp/ltsmin5341315239053739772;'/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/ltsmin5341315239053739772;'/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/ltsmin5341315239053739772;'/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 6 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2501/2501 transitions.
Applied a total of 0 rules in 68 ms. Remains 1091 /1091 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2024-05-25 09:03:55] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1091 cols
[2024-05-25 09:03:55] [INFO ] Computed 44 invariants in 27 ms
[2024-05-25 09:03:56] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-25 09:03:56] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:03:56] [INFO ] Invariant cache hit.
[2024-05-25 09:03:57] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:04:03] [INFO ] Implicit Places using invariants and state equation in 7261 ms returned []
Implicit Place search using SMT with State Equation took 8127 ms to find 0 implicit places.
[2024-05-25 09:04:03] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-25 09:04:03] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:04:03] [INFO ] Invariant cache hit.
[2024-05-25 09:04:04] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9213 ms. Remains : 1091/1091 places, 2501/2501 transitions.
Built C files in :
/tmp/ltsmin7732322746422243924
[2024-05-25 09:04:04] [INFO ] Too many transitions (2501) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:04:04] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7732322746422243924
Running compilation step : cd /tmp/ltsmin7732322746422243924;'/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/ltsmin7732322746422243924;'/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/ltsmin7732322746422243924;'/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 09:04:07] [INFO ] Flatten gal took : 91 ms
[2024-05-25 09:04:08] [INFO ] Flatten gal took : 79 ms
[2024-05-25 09:04:08] [INFO ] Time to serialize gal into /tmp/LTL775532804665713151.gal : 16 ms
[2024-05-25 09:04:08] [INFO ] Time to serialize properties into /tmp/LTL8003767722196380284.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/LTL775532804665713151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8725657478602320504.hoa' '-atoms' '/tmp/LTL8003767722196380284.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...316
Loading property file /tmp/LTL8003767722196380284.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8725657478602320504.hoa
Detected timeout of ITS tools.
[2024-05-25 09:04:23] [INFO ] Flatten gal took : 68 ms
[2024-05-25 09:04:23] [INFO ] Flatten gal took : 70 ms
[2024-05-25 09:04:23] [INFO ] Time to serialize gal into /tmp/LTL9577672847112268377.gal : 12 ms
[2024-05-25 09:04:23] [INFO ] Time to serialize properties into /tmp/LTL9284033827923842983.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9577672847112268377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9284033827923842983.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 : !((F((G(("(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetect...352
Formula 0 simplified : G(F(!"(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectTh...342
Detected timeout of ITS tools.
[2024-05-25 09:04:38] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:04:38] [INFO ] Applying decomposition
[2024-05-25 09:04:38] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3915489742847179280.txt' '-o' '/tmp/graph3915489742847179280.bin' '-w' '/tmp/graph3915489742847179280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3915489742847179280.bin' '-l' '-1' '-v' '-w' '/tmp/graph3915489742847179280.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:04:38] [INFO ] Decomposing Gal with order
[2024-05-25 09:04:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:04:39] [INFO ] Removed a total of 2232 redundant transitions.
[2024-05-25 09:04:39] [INFO ] Flatten gal took : 572 ms
[2024-05-25 09:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1466 labels/synchronizations in 122 ms.
[2024-05-25 09:04:39] [INFO ] Time to serialize gal into /tmp/LTL2732984724860869551.gal : 21 ms
[2024-05-25 09:04:39] [INFO ] Time to serialize properties into /tmp/LTL18173989854224159293.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/LTL2732984724860869551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18173989854224159293.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((u0.Node6DontAnswerToAnyNode<1)||(u0.Node11IsActive<1))&&((i8.u9.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(i1...405
Formula 0 simplified : G(F(!"(((u0.Node6DontAnswerToAnyNode<1)||(u0.Node11IsActive<1))&&((i8.u9.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(i10....395
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9445705460700948263
[2024-05-25 09:04:54] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9445705460700948263
Running compilation step : cd /tmp/ltsmin9445705460700948263;'/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/ltsmin9445705460700948263;'/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/ltsmin9445705460700948263;'/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-S16C06-LTLFireability-05 finished in 204623 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(p0)&&F(p1)))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1196 transition count 2665
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1196 transition count 2665
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1190 transition count 2629
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1190 transition count 2629
Applied a total of 54 rules in 177 ms. Remains 1190 /1217 variables (removed 27) and now considering 2629/2721 (removed 92) transitions.
[2024-05-25 09:04:58] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1190 cols
[2024-05-25 09:04:58] [INFO ] Computed 55 invariants in 28 ms
[2024-05-25 09:04:59] [INFO ] Implicit Places using invariants in 976 ms returned [104, 293, 559, 641, 642, 656, 665, 783, 870]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 978 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1181/1217 places, 2629/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1174 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1174 transition count 2622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1167 transition count 2615
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1167 transition count 2615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1160 transition count 2608
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1160 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1154 transition count 2572
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1154 transition count 2572
Applied a total of 54 rules in 197 ms. Remains 1154 /1181 variables (removed 27) and now considering 2572/2629 (removed 57) transitions.
[2024-05-25 09:04:59] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2024-05-25 09:04:59] [INFO ] Computed 46 invariants in 24 ms
[2024-05-25 09:05:00] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-25 09:05:00] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:05:00] [INFO ] Invariant cache hit.
[2024-05-25 09:05:00] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:05:10] [INFO ] Implicit Places using invariants and state equation in 10478 ms returned [1120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1153/1217 places, 2572/2721 transitions.
Applied a total of 0 rules in 39 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12756 ms. Remains : 1153/1217 places, 2572/2721 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s434 1) (LT s437 1) (LT s485 1)), p0:(OR (AND (GEQ s434 1) (GEQ s437 1) (GEQ s485 1)) (GEQ s365 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 finished in 12920 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(X((p0&&X(F(p1)))))))'
Support contains 3 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1196 transition count 2665
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1196 transition count 2665
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1190 transition count 2629
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1190 transition count 2629
Applied a total of 54 rules in 160 ms. Remains 1190 /1217 variables (removed 27) and now considering 2629/2721 (removed 92) transitions.
[2024-05-25 09:05:10] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1190 cols
[2024-05-25 09:05:10] [INFO ] Computed 55 invariants in 33 ms
[2024-05-25 09:05:11] [INFO ] Implicit Places using invariants in 956 ms returned [104, 350, 559, 641, 642, 656, 665, 783, 870]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 958 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1181/1217 places, 2629/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1174 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1174 transition count 2622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1167 transition count 2615
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1167 transition count 2615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1160 transition count 2608
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1160 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1154 transition count 2572
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1154 transition count 2572
Applied a total of 54 rules in 202 ms. Remains 1154 /1181 variables (removed 27) and now considering 2572/2629 (removed 57) transitions.
[2024-05-25 09:05:12] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2024-05-25 09:05:12] [INFO ] Computed 46 invariants in 23 ms
[2024-05-25 09:05:12] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-25 09:05:12] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:05:12] [INFO ] Invariant cache hit.
[2024-05-25 09:05:13] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:05:23] [INFO ] Implicit Places using invariants and state equation in 10732 ms returned [1139]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11618 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1153/1217 places, 2572/2721 transitions.
Applied a total of 0 rules in 37 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12975 ms. Remains : 1153/1217 places, 2572/2721 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LT s323 1), p0:(OR (LT s203 1) (LT s483 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 810 ms.
Product exploration explored 100000 steps with 20000 reset in 864 ms.
Computed a total of 321 stabilizing places and 939 stable transitions
Computed a total of 321 stabilizing places and 939 stable transitions
Detected a total of 321/1153 stabilizing places and 939/2572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:05:26] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1153 cols
[2024-05-25 09:05:26] [INFO ] Computed 45 invariants in 28 ms
[2024-05-25 09:05:26] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-25 09:05:26] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 10 ms returned sat
[2024-05-25 09:05:27] [INFO ] After 890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:05:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-25 09:05:27] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-25 09:05:27] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:27] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:05:28] [INFO ] After 300ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:28] [INFO ] Deduced a trap composed of 295 places in 442 ms of which 1 ms to minimize.
[2024-05-25 09:05:29] [INFO ] Deduced a trap composed of 83 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1100 ms
[2024-05-25 09:05:29] [INFO ] After 1457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-25 09:05:29] [INFO ] After 2372ms 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 1153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1153 transition count 2547
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1128 transition count 2547
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1128 transition count 2535
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1116 transition count 2535
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
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 112 place count 1097 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1096 transition count 2515
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1096 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1095 transition count 2509
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 248 place count 1095 transition count 3722
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 380 place count 963 transition count 3722
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 381 place count 963 transition count 3722
Applied a total of 381 rules in 441 ms. Remains 963 /1153 variables (removed 190) and now considering 3722/2572 (removed -1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 963/1153 places, 3722/2572 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77129 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77129 steps, saw 32233 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:05:33] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2024-05-25 09:05:33] [INFO ] Computed 45 invariants in 57 ms
[2024-05-25 09:05:33] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:05:33] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:05:34] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:05:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:05:34] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:05:35] [INFO ] After 878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:35] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:05:35] [INFO ] After 510ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:36] [INFO ] Deduced a trap composed of 252 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:05:36] [INFO ] Deduced a trap composed of 63 places in 506 ms of which 1 ms to minimize.
[2024-05-25 09:05:37] [INFO ] Deduced a trap composed of 89 places in 487 ms of which 1 ms to minimize.
[2024-05-25 09:05:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1749 ms
[2024-05-25 09:05:37] [INFO ] After 2332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-25 09:05:37] [INFO ] After 3455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 97 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-25 09:05:37] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:05:37] [INFO ] Invariant cache hit.
[2024-05-25 09:05:38] [INFO ] Implicit Places using invariants in 1032 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 962/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 100 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1227 ms. Remains : 962/963 places, 3722/3722 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77824 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77824 steps, saw 32519 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:05:42] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 962 cols
[2024-05-25 09:05:42] [INFO ] Computed 44 invariants in 27 ms
[2024-05-25 09:05:42] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:05:42] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:05:42] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:05:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2024-05-25 09:05:42] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:05:43] [INFO ] After 793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:43] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:05:44] [INFO ] After 515ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:05:44] [INFO ] Deduced a trap composed of 256 places in 409 ms of which 1 ms to minimize.
[2024-05-25 09:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2024-05-25 09:05:44] [INFO ] After 1142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-25 09:05:45] [INFO ] After 2189ms 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 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 962/962 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-25 09:05:45] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:05:45] [INFO ] Invariant cache hit.
[2024-05-25 09:05:46] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2024-05-25 09:05:46] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:05:46] [INFO ] Invariant cache hit.
[2024-05-25 09:05:47] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:06:04] [INFO ] Implicit Places using invariants and state equation in 18383 ms returned []
Implicit Place search using SMT with State Equation took 19412 ms to find 0 implicit places.
[2024-05-25 09:06:04] [INFO ] Redundant transitions in 163 ms returned []
[2024-05-25 09:06:04] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:06:04] [INFO ] Invariant cache hit.
[2024-05-25 09:06:06] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20949 ms. Remains : 962/962 places, 3722/3722 transitions.
Graph (trivial) has 1048 edges and 962 vertex of which 17 / 962 are part of one of the 1 SCC in 0 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 4263 edges and 946 vertex of which 933 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 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 t1199.t1393 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 916 transition count 2953
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 819 transition count 2760
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 723 transition count 2592
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 651 transition count 2450
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 581 transition count 2330
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 531 transition count 2232
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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 127 rules applied. Total rules applied 1334 place count 483 transition count 2153
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1425 place count 452 transition count 2093
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 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 76 rules applied. Total rules applied 1501 place count 423 transition count 2046
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 1553 place count 405 transition count 2012
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 1593 place count 389 transition count 1988
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 1615 place count 381 transition count 1974
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 1629 place count 375 transition count 1966
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 373 transition count 1963
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 372 transition count 1962
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1636 place count 372 transition count 1950
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1660 place count 360 transition count 1950
Discarding 285 places :
Symmetric choice reduction at 15 with 285 rule applications. Total rules 1945 place count 75 transition count 325
Iterating global reduction 15 with 285 rules applied. Total rules applied 2230 place count 75 transition count 325
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 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 15 with 253 rules applied. Total rules applied 2483 place count 75 transition count 72
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 2491 place count 67 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2491 place count 67 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2493 place count 66 transition count 71
Discarding 12 places :
Symmetric choice reduction at 17 with 12 rule applications. Total rules 2505 place count 54 transition count 50
Iterating global reduction 17 with 12 rules applied. Total rules applied 2517 place count 54 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 2521 place count 54 transition count 46
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 2525 place count 50 transition count 42
Iterating global reduction 18 with 4 rules applied. Total rules applied 2529 place count 50 transition count 42
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 18 with 4 rules applied. Total rules applied 2533 place count 48 transition count 40
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2534 place count 47 transition count 39
Iterating global reduction 18 with 1 rules applied. Total rules applied 2535 place count 47 transition count 39
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 18 with 12 rules applied. Total rules applied 2547 place count 47 transition count 27
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 2559 place count 35 transition count 27
Applied a total of 2559 rules in 300 ms. Remains 35 /962 variables (removed 927) and now considering 27/3722 (removed 3695) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 35 cols
[2024-05-25 09:06:06] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 09:06:06] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-25 09:06:06] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:06:06] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:06:06] [INFO ] After 25ms 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 09:06:06] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 1153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Applied a total of 0 rules in 41 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
[2024-05-25 09:06:07] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1153 cols
[2024-05-25 09:06:07] [INFO ] Computed 45 invariants in 23 ms
[2024-05-25 09:06:07] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-05-25 09:06:07] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:06:07] [INFO ] Invariant cache hit.
[2024-05-25 09:06:08] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:06:15] [INFO ] Implicit Places using invariants and state equation in 8075 ms returned []
Implicit Place search using SMT with State Equation took 8955 ms to find 0 implicit places.
[2024-05-25 09:06:15] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:06:15] [INFO ] Invariant cache hit.
[2024-05-25 09:06:16] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9964 ms. Remains : 1153/1153 places, 2572/2572 transitions.
Computed a total of 321 stabilizing places and 939 stable transitions
Computed a total of 321 stabilizing places and 939 stable transitions
Detected a total of 321/1153 stabilizing places and 939/2572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:06:17] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:06:17] [INFO ] Invariant cache hit.
[2024-05-25 09:06:17] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-25 09:06:17] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 10 ms returned sat
[2024-05-25 09:06:18] [INFO ] After 921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:06:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-25 09:06:18] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 10 ms returned sat
[2024-05-25 09:06:19] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:19] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:06:19] [INFO ] After 224ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:19] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-25 09:06:19] [INFO ] After 1303ms 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 1153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1153 transition count 2547
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1128 transition count 2547
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1128 transition count 2535
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1116 transition count 2535
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
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 112 place count 1097 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1096 transition count 2515
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1096 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1095 transition count 2509
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 248 place count 1095 transition count 3722
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 380 place count 963 transition count 3722
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 381 place count 963 transition count 3722
Applied a total of 381 rules in 429 ms. Remains 963 /1153 variables (removed 190) and now considering 3722/2572 (removed -1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 963/1153 places, 3722/2572 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78038 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78038 steps, saw 32611 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:06:23] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2024-05-25 09:06:23] [INFO ] Computed 45 invariants in 41 ms
[2024-05-25 09:06:23] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:06:23] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-25 09:06:24] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:06:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:06:24] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:06:25] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:25] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:06:25] [INFO ] After 497ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:26] [INFO ] Deduced a trap composed of 252 places in 424 ms of which 1 ms to minimize.
[2024-05-25 09:06:26] [INFO ] Deduced a trap composed of 63 places in 497 ms of which 3 ms to minimize.
[2024-05-25 09:06:27] [INFO ] Deduced a trap composed of 89 places in 470 ms of which 1 ms to minimize.
[2024-05-25 09:06:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1704 ms
[2024-05-25 09:06:27] [INFO ] After 2275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-25 09:06:27] [INFO ] After 3374ms 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 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 94 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 90 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-25 09:06:27] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:06:27] [INFO ] Invariant cache hit.
[2024-05-25 09:06:28] [INFO ] Implicit Places using invariants in 1002 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 962/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 97 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1192 ms. Remains : 962/963 places, 3722/3722 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79032 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79032 steps, saw 33022 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:06:32] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 962 cols
[2024-05-25 09:06:32] [INFO ] Computed 44 invariants in 20 ms
[2024-05-25 09:06:32] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:06:32] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:06:32] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:06:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:06:33] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:06:33] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:33] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:06:34] [INFO ] After 524ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:06:34] [INFO ] Deduced a trap composed of 256 places in 423 ms of which 1 ms to minimize.
[2024-05-25 09:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 576 ms
[2024-05-25 09:06:35] [INFO ] After 1173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-25 09:06:35] [INFO ] After 2239ms 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 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 962/962 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 91 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-25 09:06:35] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:06:35] [INFO ] Invariant cache hit.
[2024-05-25 09:06:36] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-25 09:06:36] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:06:36] [INFO ] Invariant cache hit.
[2024-05-25 09:06:37] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:06:57] [INFO ] Implicit Places using invariants and state equation in 20905 ms returned []
Implicit Place search using SMT with State Equation took 21920 ms to find 0 implicit places.
[2024-05-25 09:06:57] [INFO ] Redundant transitions in 163 ms returned []
[2024-05-25 09:06:57] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-25 09:06:57] [INFO ] Invariant cache hit.
[2024-05-25 09:06:58] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23415 ms. Remains : 962/962 places, 3722/3722 transitions.
Graph (trivial) has 1048 edges and 962 vertex of which 17 / 962 are part of one of the 1 SCC in 0 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 4263 edges and 946 vertex of which 933 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 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 t1199.t1393 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 916 transition count 2953
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 819 transition count 2760
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 723 transition count 2592
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 651 transition count 2450
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 581 transition count 2330
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 531 transition count 2232
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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 127 rules applied. Total rules applied 1334 place count 483 transition count 2153
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1425 place count 452 transition count 2093
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 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 76 rules applied. Total rules applied 1501 place count 423 transition count 2046
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 1553 place count 405 transition count 2012
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 1593 place count 389 transition count 1988
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 1615 place count 381 transition count 1974
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 1629 place count 375 transition count 1966
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 373 transition count 1963
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 372 transition count 1962
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1636 place count 372 transition count 1950
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1660 place count 360 transition count 1950
Discarding 285 places :
Symmetric choice reduction at 15 with 285 rule applications. Total rules 1945 place count 75 transition count 325
Iterating global reduction 15 with 285 rules applied. Total rules applied 2230 place count 75 transition count 325
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 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 15 with 253 rules applied. Total rules applied 2483 place count 75 transition count 72
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 2491 place count 67 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2491 place count 67 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2493 place count 66 transition count 71
Discarding 12 places :
Symmetric choice reduction at 17 with 12 rule applications. Total rules 2505 place count 54 transition count 50
Iterating global reduction 17 with 12 rules applied. Total rules applied 2517 place count 54 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 2521 place count 54 transition count 46
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 2525 place count 50 transition count 42
Iterating global reduction 18 with 4 rules applied. Total rules applied 2529 place count 50 transition count 42
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 18 with 4 rules applied. Total rules applied 2533 place count 48 transition count 40
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2534 place count 47 transition count 39
Iterating global reduction 18 with 1 rules applied. Total rules applied 2535 place count 47 transition count 39
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 18 with 12 rules applied. Total rules applied 2547 place count 47 transition count 27
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 2559 place count 35 transition count 27
Applied a total of 2559 rules in 292 ms. Remains 35 /962 variables (removed 927) and now considering 27/3722 (removed 3695) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 35 cols
[2024-05-25 09:06:58] [INFO ] Computed 15 invariants in 0 ms
[2024-05-25 09:06:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 09:06:58] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:06:58] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:06:58] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 09:06:58] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 20000 reset in 801 ms.
Product exploration explored 100000 steps with 20000 reset in 808 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 1153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1153 transition count 2572
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 1153 transition count 2573
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 1153 transition count 2573
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 1141 transition count 2561
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 1141 transition count 2561
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 1141 transition count 2561
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1139 transition count 2559
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1139 transition count 2559
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 83 rules in 492 ms. Remains 1139 /1153 variables (removed 14) and now considering 2559/2572 (removed 13) transitions.
[2024-05-25 09:07:02] [INFO ] Redundant transitions in 83 ms returned []
[2024-05-25 09:07:02] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1139 cols
[2024-05-25 09:07:02] [INFO ] Computed 45 invariants in 20 ms
[2024-05-25 09:07:03] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1139/1153 places, 2559/2572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 1139/1153 places, 2559/2572 transitions.
Built C files in :
/tmp/ltsmin10473275084103621236
[2024-05-25 09:07:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10473275084103621236
Running compilation step : cd /tmp/ltsmin10473275084103621236;'/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/ltsmin10473275084103621236;'/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/ltsmin10473275084103621236;'/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 3 out of 1153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Applied a total of 0 rules in 49 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
[2024-05-25 09:07:06] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1153 cols
[2024-05-25 09:07:06] [INFO ] Computed 45 invariants in 25 ms
[2024-05-25 09:07:07] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-25 09:07:07] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:07:07] [INFO ] Invariant cache hit.
[2024-05-25 09:07:07] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 09:07:14] [INFO ] Implicit Places using invariants and state equation in 7522 ms returned []
Implicit Place search using SMT with State Equation took 8407 ms to find 0 implicit places.
[2024-05-25 09:07:14] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 09:07:14] [INFO ] Invariant cache hit.
[2024-05-25 09:07:15] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9423 ms. Remains : 1153/1153 places, 2572/2572 transitions.
Built C files in :
/tmp/ltsmin15753252543437652045
[2024-05-25 09:07:15] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15753252543437652045
Running compilation step : cd /tmp/ltsmin15753252543437652045;'/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/ltsmin15753252543437652045;'/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/ltsmin15753252543437652045;'/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 09:07:18] [INFO ] Flatten gal took : 74 ms
[2024-05-25 09:07:19] [INFO ] Flatten gal took : 75 ms
[2024-05-25 09:07:19] [INFO ] Time to serialize gal into /tmp/LTL14386098073843630562.gal : 13 ms
[2024-05-25 09:07:19] [INFO ] Time to serialize properties into /tmp/LTL4829988558749004014.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/LTL14386098073843630562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut108632943463487482.hoa' '-atoms' '/tmp/LTL4829988558749004014.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/LTL4829988558749004014.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut108632943463487482.hoa
Detected timeout of ITS tools.
[2024-05-25 09:07:34] [INFO ] Flatten gal took : 79 ms
[2024-05-25 09:07:34] [INFO ] Flatten gal took : 68 ms
[2024-05-25 09:07:34] [INFO ] Time to serialize gal into /tmp/LTL1114070465139682751.gal : 11 ms
[2024-05-25 09:07:34] [INFO ] Time to serialize properties into /tmp/LTL2769306507708552154.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/LTL1114070465139682751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2769306507708552154.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(X(X((X(F("(Node2HasTheLeafSetOfLx2ToReplaceNode7<1)")))&&("((Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(NodesCanDetect...185
Formula 0 simplified : XXX(!"((Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(NodesCanDetectThatNode5HasCrashed<1))" | XG!"(Node2HasTheLeafSetOfLx2T...173
Detected timeout of ITS tools.
[2024-05-25 09:07:49] [INFO ] Flatten gal took : 64 ms
[2024-05-25 09:07:49] [INFO ] Applying decomposition
[2024-05-25 09:07:49] [INFO ] Flatten gal took : 64 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/graph10757888425787291433.txt' '-o' '/tmp/graph10757888425787291433.bin' '-w' '/tmp/graph10757888425787291433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10757888425787291433.bin' '-l' '-1' '-v' '-w' '/tmp/graph10757888425787291433.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:07:49] [INFO ] Decomposing Gal with order
[2024-05-25 09:07:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:07:49] [INFO ] Removed a total of 3055 redundant transitions.
[2024-05-25 09:07:49] [INFO ] Flatten gal took : 160 ms
[2024-05-25 09:07:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1148 labels/synchronizations in 74 ms.
[2024-05-25 09:07:49] [INFO ] Time to serialize gal into /tmp/LTL13911678626397868630.gal : 20 ms
[2024-05-25 09:07:49] [INFO ] Time to serialize properties into /tmp/LTL8185586808232039468.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/LTL13911678626397868630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8185586808232039468.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(F("(i4.u56.Node2HasTheLeafSetOfLx2ToReplaceNode7<1)")))&&("((i6.u40.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(...207
Formula 0 simplified : XXX(!"((i6.u40.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(i6.u111.NodesCanDetectThatNode5HasCrashed<1))" | XG!"(i4.u56.No...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5147554085897337802
[2024-05-25 09:08:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5147554085897337802
Running compilation step : cd /tmp/ltsmin5147554085897337802;'/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/ltsmin5147554085897337802;'/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/ltsmin5147554085897337802;'/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-S16C06-LTLFireability-07 finished in 177325 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 U p1))))'
Support contains 2 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1217 transition count 2700
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1196 transition count 2700
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 1196 transition count 2684
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 1180 transition count 2684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 1172 transition count 2651
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 1172 transition count 2651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 90 place count 1172 transition count 2650
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1171 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 1168 transition count 2637
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 1168 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 1167 transition count 2631
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 1167 transition count 2631
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 154 place count 1140 transition count 2604
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 158 place count 1136 transition count 2600
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 1136 transition count 2600
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 166 place count 1132 transition count 2576
Iterating global reduction 2 with 4 rules applied. Total rules applied 170 place count 1132 transition count 2576
Applied a total of 170 rules in 401 ms. Remains 1132 /1217 variables (removed 85) and now considering 2576/2721 (removed 145) transitions.
[2024-05-25 09:08:08] [INFO ] Flow matrix only has 2304 transitions (discarded 272 similar events)
// Phase 1: matrix 2304 rows 1132 cols
[2024-05-25 09:08:08] [INFO ] Computed 55 invariants in 40 ms
[2024-05-25 09:08:09] [INFO ] Implicit Places using invariants in 899 ms returned [93, 265, 319, 521, 599, 600, 612, 826]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 901 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1124/1217 places, 2576/2721 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1122 transition count 2574
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1122 transition count 2574
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1120 transition count 2572
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1120 transition count 2572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1118 transition count 2560
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1118 transition count 2560
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 1114 transition count 2556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1110 transition count 2552
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1110 transition count 2552
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1107 transition count 2534
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1107 transition count 2534
Applied a total of 34 rules in 355 ms. Remains 1107 /1124 variables (removed 17) and now considering 2534/2576 (removed 42) transitions.
[2024-05-25 09:08:09] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1107 cols
[2024-05-25 09:08:09] [INFO ] Computed 47 invariants in 29 ms
[2024-05-25 09:08:10] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-25 09:08:10] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 09:08:10] [INFO ] Invariant cache hit.
[2024-05-25 09:08:11] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 09:08:19] [INFO ] Implicit Places using invariants and state equation in 8878 ms returned []
Implicit Place search using SMT with State Equation took 9746 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1217 places, 2534/2721 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11403 ms. Remains : 1107/1217 places, 2534/2721 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s737 1), p0:(GEQ s607 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 42 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 finished in 11524 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(p0))'
Support contains 2 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 78 place count 1178 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 1170 transition count 2649
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 1170 transition count 2649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 1170 transition count 2648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1169 transition count 2648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 1166 transition count 2635
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1166 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1165 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1165 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 158 place count 1138 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 164 place count 1132 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 1132 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 1126 transition count 2560
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 1126 transition count 2560
Applied a total of 182 rules in 393 ms. Remains 1126 /1217 variables (removed 91) and now considering 2560/2721 (removed 161) transitions.
[2024-05-25 09:08:20] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1126 cols
[2024-05-25 09:08:20] [INFO ] Computed 55 invariants in 28 ms
[2024-05-25 09:08:20] [INFO ] Implicit Places using invariants in 896 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 735, 820]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 898 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1116/1217 places, 2560/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1113 transition count 2557
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1113 transition count 2557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1110 transition count 2554
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1110 transition count 2554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1108 transition count 2542
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1108 transition count 2542
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1103 transition count 2537
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1098 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1098 transition count 2532
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1093 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1093 transition count 2502
Applied a total of 46 rules in 355 ms. Remains 1093 /1116 variables (removed 23) and now considering 2502/2560 (removed 58) transitions.
[2024-05-25 09:08:21] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1093 cols
[2024-05-25 09:08:21] [INFO ] Computed 45 invariants in 28 ms
[2024-05-25 09:08:22] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-25 09:08:22] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-25 09:08:22] [INFO ] Invariant cache hit.
[2024-05-25 09:08:22] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:08:30] [INFO ] Implicit Places using invariants and state equation in 8343 ms returned [1070]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1217 places, 2502/2721 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 2501
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 2501
Applied a total of 2 rules in 79 ms. Remains 1091 /1092 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2024-05-25 09:08:30] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1091 cols
[2024-05-25 09:08:30] [INFO ] Computed 44 invariants in 24 ms
[2024-05-25 09:08:31] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-25 09:08:31] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 09:08:31] [INFO ] Invariant cache hit.
[2024-05-25 09:08:32] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 09:08:38] [INFO ] Implicit Places using invariants and state equation in 7331 ms returned []
Implicit Place search using SMT with State Equation took 8213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1217 places, 2501/2721 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 19116 ms. Remains : 1091/1217 places, 2501/2721 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s504 1) (GEQ s675 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 46 steps with 1 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 finished in 19172 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((p0&&F(!p0)))||G(p1)))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1203 transition count 2682
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1203 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1195 transition count 2669
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 182 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-25 09:08:38] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-25 09:08:39] [INFO ] Computed 55 invariants in 39 ms
[2024-05-25 09:08:39] [INFO ] Implicit Places using invariants in 965 ms returned [104, 293, 347, 556, 639, 640, 654, 663, 781, 868]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 966 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1170 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1170 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1162 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1162 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1154 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1154 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1147 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1147 transition count 2561
Applied a total of 62 rules in 230 ms. Remains 1147 /1178 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-25 09:08:40] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-25 09:08:40] [INFO ] Computed 45 invariants in 21 ms
[2024-05-25 09:08:41] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-25 09:08:41] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:08:41] [INFO ] Invariant cache hit.
[2024-05-25 09:08:41] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:08:48] [INFO ] Implicit Places using invariants and state equation in 7352 ms returned []
Implicit Place search using SMT with State Equation took 8237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1217 places, 2561/2721 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9615 ms. Remains : 1147/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 250 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (LT s544 1) (LT s1113 1)), p1:(OR (LT s430 1) (LT s614 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1605 reset in 435 ms.
Product exploration explored 100000 steps with 1606 reset in 445 ms.
Computed a total of 315 stabilizing places and 928 stable transitions
Computed a total of 315 stabilizing places and 928 stable transitions
Detected a total of 315/1147 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 138 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75049 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75049 steps, saw 32156 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:08:53] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:08:53] [INFO ] Invariant cache hit.
[2024-05-25 09:08:53] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-25 09:08:53] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:08:54] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 09:08:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:08:54] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:08:55] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 09:08:55] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:08:56] [INFO ] After 679ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-25 09:08:56] [INFO ] Deduced a trap composed of 340 places in 421 ms of which 1 ms to minimize.
[2024-05-25 09:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2024-05-25 09:08:57] [INFO ] Deduced a trap composed of 417 places in 447 ms of which 1 ms to minimize.
[2024-05-25 09:08:57] [INFO ] Deduced a trap composed of 129 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:08:58] [INFO ] Deduced a trap composed of 89 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:08:59] [INFO ] Deduced a trap composed of 86 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:08:59] [INFO ] Deduced a trap composed of 128 places in 454 ms of which 1 ms to minimize.
[2024-05-25 09:09:00] [INFO ] Deduced a trap composed of 125 places in 448 ms of which 1 ms to minimize.
[2024-05-25 09:09:00] [INFO ] Deduced a trap composed of 112 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:09:01] [INFO ] Deduced a trap composed of 75 places in 476 ms of which 1 ms to minimize.
[2024-05-25 09:09:01] [INFO ] Deduced a trap composed of 122 places in 447 ms of which 1 ms to minimize.
[2024-05-25 09:09:02] [INFO ] Deduced a trap composed of 107 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:09:02] [INFO ] Deduced a trap composed of 75 places in 463 ms of which 2 ms to minimize.
[2024-05-25 09:09:03] [INFO ] Deduced a trap composed of 108 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:09:03] [INFO ] Deduced a trap composed of 129 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:09:04] [INFO ] Deduced a trap composed of 95 places in 466 ms of which 1 ms to minimize.
[2024-05-25 09:09:05] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 2 ms to minimize.
[2024-05-25 09:09:05] [INFO ] Deduced a trap composed of 126 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:09:06] [INFO ] Deduced a trap composed of 135 places in 438 ms of which 1 ms to minimize.
[2024-05-25 09:09:06] [INFO ] Deduced a trap composed of 136 places in 445 ms of which 1 ms to minimize.
[2024-05-25 09:09:07] [INFO ] Deduced a trap composed of 268 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:09:07] [INFO ] Deduced a trap composed of 252 places in 417 ms of which 1 ms to minimize.
[2024-05-25 09:09:08] [INFO ] Deduced a trap composed of 363 places in 446 ms of which 1 ms to minimize.
[2024-05-25 09:09:09] [INFO ] Deduced a trap composed of 85 places in 445 ms of which 1 ms to minimize.
[2024-05-25 09:09:09] [INFO ] Deduced a trap composed of 96 places in 458 ms of which 1 ms to minimize.
[2024-05-25 09:09:10] [INFO ] Deduced a trap composed of 87 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:09:10] [INFO ] Deduced a trap composed of 100 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:09:11] [INFO ] Deduced a trap composed of 83 places in 455 ms of which 1 ms to minimize.
[2024-05-25 09:09:11] [INFO ] Deduced a trap composed of 87 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:09:12] [INFO ] Deduced a trap composed of 79 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:09:12] [INFO ] Deduced a trap composed of 80 places in 445 ms of which 1 ms to minimize.
[2024-05-25 09:09:13] [INFO ] Deduced a trap composed of 142 places in 435 ms of which 1 ms to minimize.
[2024-05-25 09:09:13] [INFO ] Deduced a trap composed of 93 places in 446 ms of which 1 ms to minimize.
[2024-05-25 09:09:14] [INFO ] Deduced a trap composed of 96 places in 452 ms of which 2 ms to minimize.
[2024-05-25 09:09:14] [INFO ] Deduced a trap composed of 86 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:09:15] [INFO ] Deduced a trap composed of 85 places in 447 ms of which 1 ms to minimize.
[2024-05-25 09:09:15] [INFO ] Deduced a trap composed of 81 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:09:16] [INFO ] Deduced a trap composed of 72 places in 444 ms of which 1 ms to minimize.
[2024-05-25 09:09:17] [INFO ] Deduced a trap composed of 179 places in 463 ms of which 1 ms to minimize.
[2024-05-25 09:09:17] [INFO ] Deduced a trap composed of 130 places in 471 ms of which 1 ms to minimize.
[2024-05-25 09:09:18] [INFO ] Deduced a trap composed of 113 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:09:18] [INFO ] Deduced a trap composed of 103 places in 447 ms of which 0 ms to minimize.
[2024-05-25 09:09:19] [INFO ] Deduced a trap composed of 119 places in 436 ms of which 1 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 09:09:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:09:19] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 226 place count 1095 transition count 3062
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 348 place count 973 transition count 3062
Applied a total of 348 rules in 229 ms. Remains 973 /1147 variables (removed 174) and now considering 3062/2561 (removed -501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 973/1147 places, 3062/2561 transitions.
Incomplete random walk after 10000 steps, including 261 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69856 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69856 steps, saw 29268 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 09:09:23] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
// Phase 1: matrix 2672 rows 973 cols
[2024-05-25 09:09:23] [INFO ] Computed 45 invariants in 42 ms
[2024-05-25 09:09:23] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:09:23] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:09:23] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 09:09:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:09:23] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-25 09:09:24] [INFO ] After 956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 09:09:24] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-25 09:09:25] [INFO ] After 585ms SMT Verify possible using 1508 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 09:09:25] [INFO ] Deduced a trap composed of 213 places in 381 ms of which 1 ms to minimize.
[2024-05-25 09:09:26] [INFO ] Deduced a trap composed of 216 places in 370 ms of which 1 ms to minimize.
[2024-05-25 09:09:26] [INFO ] Deduced a trap composed of 188 places in 375 ms of which 1 ms to minimize.
[2024-05-25 09:09:27] [INFO ] Deduced a trap composed of 196 places in 386 ms of which 0 ms to minimize.
[2024-05-25 09:09:27] [INFO ] Deduced a trap composed of 211 places in 370 ms of which 0 ms to minimize.
[2024-05-25 09:09:28] [INFO ] Deduced a trap composed of 179 places in 377 ms of which 1 ms to minimize.
[2024-05-25 09:09:28] [INFO ] Deduced a trap composed of 199 places in 361 ms of which 1 ms to minimize.
[2024-05-25 09:09:29] [INFO ] Deduced a trap composed of 174 places in 367 ms of which 2 ms to minimize.
[2024-05-25 09:09:29] [INFO ] Deduced a trap composed of 167 places in 358 ms of which 0 ms to minimize.
[2024-05-25 09:09:30] [INFO ] Deduced a trap composed of 172 places in 368 ms of which 1 ms to minimize.
[2024-05-25 09:09:30] [INFO ] Deduced a trap composed of 189 places in 365 ms of which 1 ms to minimize.
[2024-05-25 09:09:31] [INFO ] Deduced a trap composed of 207 places in 379 ms of which 1 ms to minimize.
[2024-05-25 09:09:31] [INFO ] Deduced a trap composed of 208 places in 376 ms of which 1 ms to minimize.
[2024-05-25 09:09:32] [INFO ] Deduced a trap composed of 189 places in 359 ms of which 1 ms to minimize.
[2024-05-25 09:09:32] [INFO ] Deduced a trap composed of 186 places in 371 ms of which 1 ms to minimize.
[2024-05-25 09:09:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 7884 ms
[2024-05-25 09:09:34] [INFO ] Deduced a trap composed of 174 places in 387 ms of which 2 ms to minimize.
[2024-05-25 09:09:34] [INFO ] Deduced a trap composed of 78 places in 416 ms of which 1 ms to minimize.
[2024-05-25 09:09:35] [INFO ] Deduced a trap composed of 69 places in 422 ms of which 1 ms to minimize.
[2024-05-25 09:09:35] [INFO ] Deduced a trap composed of 69 places in 418 ms of which 1 ms to minimize.
[2024-05-25 09:09:36] [INFO ] Deduced a trap composed of 182 places in 429 ms of which 0 ms to minimize.
[2024-05-25 09:09:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2765 ms
[2024-05-25 09:09:36] [INFO ] After 12257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 712 ms.
[2024-05-25 09:09:37] [INFO ] After 14138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 74 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 973/973 places, 3062/3062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 83 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
[2024-05-25 09:09:37] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:09:37] [INFO ] Invariant cache hit.
[2024-05-25 09:09:38] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-25 09:09:38] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:09:38] [INFO ] Invariant cache hit.
[2024-05-25 09:09:39] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-25 09:09:54] [INFO ] Implicit Places using invariants and state equation in 15830 ms returned []
Implicit Place search using SMT with State Equation took 16740 ms to find 0 implicit places.
[2024-05-25 09:09:54] [INFO ] Redundant transitions in 113 ms returned []
[2024-05-25 09:09:54] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:09:54] [INFO ] Invariant cache hit.
[2024-05-25 09:09:55] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17976 ms. Remains : 973/973 places, 3062/3062 transitions.
Graph (trivial) has 1043 edges and 973 vertex of which 16 / 973 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 263 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 648 transitions.
Graph (complete) has 3630 edges and 958 vertex of which 944 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 t1199.t1393 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 927 transition count 2327
Reduce places removed 85 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 1 with 240 rules applied. Total rules applied 329 place count 842 transition count 2172
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 2 with 199 rules applied. Total rules applied 528 place count 765 transition count 2050
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 3 with 140 rules applied. Total rules applied 668 place count 713 transition count 1962
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 105 rules applied. Total rules applied 773 place count 670 transition count 1900
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 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 5 with 63 rules applied. Total rules applied 836 place count 644 transition count 1863
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 36 rules applied. Total rules applied 872 place count 626 transition count 1845
Reduce places removed 7 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 7 with 15 rules applied. Total rules applied 887 place count 619 transition count 1837
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 895 place count 611 transition count 1837
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 895 place count 611 transition count 1825
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 919 place count 599 transition count 1825
Discarding 220 places :
Symmetric choice reduction at 9 with 220 rule applications. Total rules 1139 place count 379 transition count 1075
Iterating global reduction 9 with 220 rules applied. Total rules applied 1359 place count 379 transition count 1075
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 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 9 with 194 rules applied. Total rules applied 1553 place count 379 transition count 881
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1559 place count 373 transition count 881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1559 place count 373 transition count 880
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1561 place count 372 transition count 880
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1567 place count 366 transition count 874
Iterating global reduction 11 with 6 rules applied. Total rules applied 1573 place count 366 transition count 874
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 11 with 488 rules applied. Total rules applied 2061 place count 122 transition count 630
Drop transitions removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Iterating post reduction 11 with 237 rules applied. Total rules applied 2298 place count 122 transition count 393
Discarding 55 places :
Symmetric choice reduction at 12 with 55 rule applications. Total rules 2353 place count 67 transition count 148
Iterating global reduction 12 with 55 rules applied. Total rules applied 2408 place count 67 transition count 148
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 12 with 39 rules applied. Total rules applied 2447 place count 67 transition count 109
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2451 place count 63 transition count 93
Iterating global reduction 13 with 4 rules applied. Total rules applied 2455 place count 63 transition count 93
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 2464 place count 63 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2464 place count 63 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2466 place count 62 transition count 83
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 2475 place count 53 transition count 59
Iterating global reduction 13 with 9 rules applied. Total rules applied 2484 place count 53 transition count 59
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 2497 place count 53 transition count 46
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2499 place count 51 transition count 44
Iterating global reduction 14 with 2 rules applied. Total rules applied 2501 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2503 place count 50 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 2510 place count 50 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 2517 place count 43 transition count 41
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 2523 place count 43 transition count 41
Applied a total of 2523 rules in 495 ms. Remains 43 /973 variables (removed 930) and now considering 41/3062 (removed 3021) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 41 rows 43 cols
[2024-05-25 09:09:56] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 09:09:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:09:56] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 09:09:56] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 09:09:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:09:56] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-25 09:09:56] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 09:09:56] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 09:09:56] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 253 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 1095 transition count 2509
Applied a total of 104 rules in 163 ms. Remains 1095 /1147 variables (removed 52) and now considering 2509/2561 (removed 52) transitions.
[2024-05-25 09:09:57] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1095 cols
[2024-05-25 09:09:57] [INFO ] Computed 45 invariants in 26 ms
[2024-05-25 09:09:57] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-25 09:09:57] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:09:57] [INFO ] Invariant cache hit.
[2024-05-25 09:09:58] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:10:06] [INFO ] Implicit Places using invariants and state equation in 8242 ms returned []
Implicit Place search using SMT with State Equation took 9106 ms to find 0 implicit places.
[2024-05-25 09:10:06] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-25 09:10:06] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:10:06] [INFO ] Invariant cache hit.
[2024-05-25 09:10:07] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1095/1147 places, 2509/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10303 ms. Remains : 1095/1147 places, 2509/2561 transitions.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1095 stabilizing places and 892/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 179 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, false, false, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 77856 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77856 steps, saw 32803 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:10:11] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:10:11] [INFO ] Invariant cache hit.
[2024-05-25 09:10:11] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:10:11] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:10:11] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 09:10:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:10:11] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-25 09:10:12] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 09:10:12] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:10:12] [INFO ] After 626ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-25 09:10:13] [INFO ] Deduced a trap composed of 310 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 595 ms
[2024-05-25 09:10:14] [INFO ] After 1679ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 410 ms.
[2024-05-25 09:10:14] [INFO ] After 3215ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 1095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1095/1095 places, 2509/2509 transitions.
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1095 transition count 3062
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 0 with 122 rules applied. Total rules applied 244 place count 973 transition count 3062
Applied a total of 244 rules in 172 ms. Remains 973 /1095 variables (removed 122) and now considering 3062/2509 (removed -553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 973/1095 places, 3062/2509 transitions.
Incomplete random walk after 10000 steps, including 259 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 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 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73522 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73522 steps, saw 30784 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 09:10:17] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
// Phase 1: matrix 2672 rows 973 cols
[2024-05-25 09:10:17] [INFO ] Computed 45 invariants in 39 ms
[2024-05-25 09:10:18] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:10:18] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:10:18] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 09:10:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:10:19] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 09:10:20] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 09:10:20] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-25 09:10:20] [INFO ] After 812ms SMT Verify possible using 1508 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 09:10:21] [INFO ] Deduced a trap composed of 178 places in 392 ms of which 1 ms to minimize.
[2024-05-25 09:10:21] [INFO ] Deduced a trap composed of 179 places in 396 ms of which 1 ms to minimize.
[2024-05-25 09:10:22] [INFO ] Deduced a trap composed of 181 places in 384 ms of which 1 ms to minimize.
[2024-05-25 09:10:22] [INFO ] Deduced a trap composed of 211 places in 374 ms of which 0 ms to minimize.
[2024-05-25 09:10:23] [INFO ] Deduced a trap composed of 201 places in 375 ms of which 1 ms to minimize.
[2024-05-25 09:10:23] [INFO ] Deduced a trap composed of 180 places in 379 ms of which 1 ms to minimize.
[2024-05-25 09:10:24] [INFO ] Deduced a trap composed of 209 places in 376 ms of which 1 ms to minimize.
[2024-05-25 09:10:24] [INFO ] Deduced a trap composed of 174 places in 371 ms of which 1 ms to minimize.
[2024-05-25 09:10:25] [INFO ] Deduced a trap composed of 209 places in 377 ms of which 0 ms to minimize.
[2024-05-25 09:10:25] [INFO ] Deduced a trap composed of 219 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:10:26] [INFO ] Deduced a trap composed of 216 places in 389 ms of which 1 ms to minimize.
[2024-05-25 09:10:26] [INFO ] Deduced a trap composed of 177 places in 369 ms of which 1 ms to minimize.
[2024-05-25 09:10:27] [INFO ] Deduced a trap composed of 210 places in 371 ms of which 1 ms to minimize.
[2024-05-25 09:10:27] [INFO ] Deduced a trap composed of 142 places in 402 ms of which 0 ms to minimize.
[2024-05-25 09:10:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6725 ms
[2024-05-25 09:10:28] [INFO ] Deduced a trap composed of 69 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:10:28] [INFO ] Deduced a trap composed of 67 places in 420 ms of which 1 ms to minimize.
[2024-05-25 09:10:29] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 1 ms to minimize.
[2024-05-25 09:10:29] [INFO ] Deduced a trap composed of 75 places in 428 ms of which 1 ms to minimize.
[2024-05-25 09:10:30] [INFO ] Deduced a trap composed of 87 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:10:30] [INFO ] Deduced a trap composed of 202 places in 406 ms of which 1 ms to minimize.
[2024-05-25 09:10:31] [INFO ] Deduced a trap composed of 73 places in 434 ms of which 1 ms to minimize.
[2024-05-25 09:10:32] [INFO ] Deduced a trap composed of 67 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:10:33] [INFO ] Deduced a trap composed of 69 places in 435 ms of which 0 ms to minimize.
[2024-05-25 09:10:33] [INFO ] Deduced a trap composed of 81 places in 433 ms of which 1 ms to minimize.
[2024-05-25 09:10:34] [INFO ] Deduced a trap composed of 80 places in 436 ms of which 1 ms to minimize.
[2024-05-25 09:10:34] [INFO ] Deduced a trap composed of 96 places in 434 ms of which 1 ms to minimize.
[2024-05-25 09:10:35] [INFO ] Deduced a trap composed of 179 places in 388 ms of which 0 ms to minimize.
[2024-05-25 09:10:36] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:10:36] [INFO ] Deduced a trap composed of 82 places in 429 ms of which 1 ms to minimize.
[2024-05-25 09:10:37] [INFO ] Deduced a trap composed of 62 places in 427 ms of which 1 ms to minimize.
[2024-05-25 09:10:38] [INFO ] Deduced a trap composed of 94 places in 424 ms of which 1 ms to minimize.
[2024-05-25 09:10:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 10513 ms
[2024-05-25 09:10:39] [INFO ] Deduced a trap composed of 187 places in 402 ms of which 1 ms to minimize.
[2024-05-25 09:10:39] [INFO ] Deduced a trap composed of 165 places in 359 ms of which 1 ms to minimize.
[2024-05-25 09:10:40] [INFO ] Deduced a trap composed of 171 places in 380 ms of which 1 ms to minimize.
[2024-05-25 09:10:40] [INFO ] Deduced a trap composed of 180 places in 390 ms of which 1 ms to minimize.
[2024-05-25 09:10:41] [INFO ] Deduced a trap composed of 183 places in 387 ms of which 1 ms to minimize.
[2024-05-25 09:10:41] [INFO ] Deduced a trap composed of 189 places in 388 ms of which 1 ms to minimize.
[2024-05-25 09:10:42] [INFO ] Deduced a trap composed of 191 places in 372 ms of which 1 ms to minimize.
[2024-05-25 09:10:42] [INFO ] Deduced a trap composed of 160 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:10:43] [INFO ] Deduced a trap composed of 164 places in 375 ms of which 1 ms to minimize.
[2024-05-25 09:10:43] [INFO ] Deduced a trap composed of 124 places in 392 ms of which 1 ms to minimize.
[2024-05-25 09:10:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5232 ms
[2024-05-25 09:10:43] [INFO ] After 23830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 09:10:43] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 76 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 973/973 places, 3062/3062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 77 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
[2024-05-25 09:10:44] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:10:44] [INFO ] Invariant cache hit.
[2024-05-25 09:10:44] [INFO ] Implicit Places using invariants in 931 ms returned []
[2024-05-25 09:10:45] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:10:45] [INFO ] Invariant cache hit.
[2024-05-25 09:10:45] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-25 09:11:01] [INFO ] Implicit Places using invariants and state equation in 16110 ms returned []
Implicit Place search using SMT with State Equation took 17042 ms to find 0 implicit places.
[2024-05-25 09:11:01] [INFO ] Redundant transitions in 114 ms returned []
[2024-05-25 09:11:01] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-25 09:11:01] [INFO ] Invariant cache hit.
[2024-05-25 09:11:02] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18313 ms. Remains : 973/973 places, 3062/3062 transitions.
Graph (trivial) has 1043 edges and 973 vertex of which 16 / 973 are part of one of the 1 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 263 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 648 transitions.
Graph (complete) has 3630 edges and 958 vertex of which 944 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 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 t1199.t1393 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 927 transition count 2327
Reduce places removed 85 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 1 with 240 rules applied. Total rules applied 329 place count 842 transition count 2172
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 2 with 199 rules applied. Total rules applied 528 place count 765 transition count 2050
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 3 with 140 rules applied. Total rules applied 668 place count 713 transition count 1962
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 105 rules applied. Total rules applied 773 place count 670 transition count 1900
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 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 5 with 63 rules applied. Total rules applied 836 place count 644 transition count 1863
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 36 rules applied. Total rules applied 872 place count 626 transition count 1845
Reduce places removed 7 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 7 with 15 rules applied. Total rules applied 887 place count 619 transition count 1837
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 895 place count 611 transition count 1837
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 895 place count 611 transition count 1825
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 919 place count 599 transition count 1825
Discarding 220 places :
Symmetric choice reduction at 9 with 220 rule applications. Total rules 1139 place count 379 transition count 1075
Iterating global reduction 9 with 220 rules applied. Total rules applied 1359 place count 379 transition count 1075
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 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 9 with 194 rules applied. Total rules applied 1553 place count 379 transition count 881
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1559 place count 373 transition count 881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1559 place count 373 transition count 880
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1561 place count 372 transition count 880
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1567 place count 366 transition count 874
Iterating global reduction 11 with 6 rules applied. Total rules applied 1573 place count 366 transition count 874
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 11 with 488 rules applied. Total rules applied 2061 place count 122 transition count 630
Drop transitions removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Iterating post reduction 11 with 237 rules applied. Total rules applied 2298 place count 122 transition count 393
Discarding 55 places :
Symmetric choice reduction at 12 with 55 rule applications. Total rules 2353 place count 67 transition count 148
Iterating global reduction 12 with 55 rules applied. Total rules applied 2408 place count 67 transition count 148
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 12 with 39 rules applied. Total rules applied 2447 place count 67 transition count 109
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2451 place count 63 transition count 93
Iterating global reduction 13 with 4 rules applied. Total rules applied 2455 place count 63 transition count 93
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 2464 place count 63 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2464 place count 63 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2466 place count 62 transition count 83
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 2475 place count 53 transition count 59
Iterating global reduction 13 with 9 rules applied. Total rules applied 2484 place count 53 transition count 59
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 2497 place count 53 transition count 46
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2499 place count 51 transition count 44
Iterating global reduction 14 with 2 rules applied. Total rules applied 2501 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2503 place count 50 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 2510 place count 50 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 2517 place count 43 transition count 41
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 2523 place count 43 transition count 41
Applied a total of 2523 rules in 494 ms. Remains 43 /973 variables (removed 930) and now considering 41/3062 (removed 3021) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 41 rows 43 cols
[2024-05-25 09:11:02] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 09:11:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:11:02] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 09:11:02] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 09:11:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:11:02] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 09:11:02] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 09:11:02] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 09:11:02] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 208 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 291 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 273 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 2280 reset in 507 ms.
Product exploration explored 100000 steps with 2279 reset in 522 ms.
Built C files in :
/tmp/ltsmin2671947267044323848
[2024-05-25 09:11:05] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:11:05] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2671947267044323848
Running compilation step : cd /tmp/ltsmin2671947267044323848;'/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/ltsmin2671947267044323848;'/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/ltsmin2671947267044323848;'/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 1095 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1095/1095 places, 2509/2509 transitions.
Applied a total of 0 rules in 79 ms. Remains 1095 /1095 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 09:11:08] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1095 cols
[2024-05-25 09:11:08] [INFO ] Computed 45 invariants in 25 ms
[2024-05-25 09:11:09] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-25 09:11:09] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:11:09] [INFO ] Invariant cache hit.
[2024-05-25 09:11:09] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:11:18] [INFO ] Implicit Places using invariants and state equation in 9195 ms returned []
Implicit Place search using SMT with State Equation took 10073 ms to find 0 implicit places.
[2024-05-25 09:11:18] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-25 09:11:18] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:11:18] [INFO ] Invariant cache hit.
[2024-05-25 09:11:19] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11191 ms. Remains : 1095/1095 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin3003675517458887625
[2024-05-25 09:11:19] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:11:19] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3003675517458887625
Running compilation step : cd /tmp/ltsmin3003675517458887625;'/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/ltsmin3003675517458887625;'/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/ltsmin3003675517458887625;'/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 09:11:22] [INFO ] Flatten gal took : 56 ms
[2024-05-25 09:11:22] [INFO ] Flatten gal took : 56 ms
[2024-05-25 09:11:22] [INFO ] Time to serialize gal into /tmp/LTL5252111622815166428.gal : 26 ms
[2024-05-25 09:11:22] [INFO ] Time to serialize properties into /tmp/LTL12609298829959063332.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/LTL5252111622815166428.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4425791514125893715.hoa' '-atoms' '/tmp/LTL12609298829959063332.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/LTL12609298829959063332.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4425791514125893715.hoa
Detected timeout of ITS tools.
[2024-05-25 09:11:37] [INFO ] Flatten gal took : 57 ms
[2024-05-25 09:11:37] [INFO ] Flatten gal took : 50 ms
[2024-05-25 09:11:37] [INFO ] Time to serialize gal into /tmp/LTL9100111717318658633.gal : 13 ms
[2024-05-25 09:11:37] [INFO ] Time to serialize properties into /tmp/LTL17831575851965875067.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/LTL9100111717318658633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17831575851965875067.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(("((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtThe...262
Formula 0 simplified : X(!"((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtTheLef...252
Detected timeout of ITS tools.
[2024-05-25 09:11:52] [INFO ] Flatten gal took : 54 ms
[2024-05-25 09:11:52] [INFO ] Applying decomposition
[2024-05-25 09:11:52] [INFO ] Flatten gal took : 54 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/graph14883629180842680755.txt' '-o' '/tmp/graph14883629180842680755.bin' '-w' '/tmp/graph14883629180842680755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14883629180842680755.bin' '-l' '-1' '-v' '-w' '/tmp/graph14883629180842680755.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:11:52] [INFO ] Decomposing Gal with order
[2024-05-25 09:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:11:53] [INFO ] Removed a total of 2219 redundant transitions.
[2024-05-25 09:11:53] [INFO ] Flatten gal took : 176 ms
[2024-05-25 09:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 968 labels/synchronizations in 71 ms.
[2024-05-25 09:11:53] [INFO ] Time to serialize gal into /tmp/LTL4880022660500924846.gal : 14 ms
[2024-05-25 09:11:53] [INFO ] Time to serialize properties into /tmp/LTL13444911739560824629.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/LTL4880022660500924846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13444911739560824629.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...255
Read 1 LTL properties
Checking formula 0 : !(((X(("((i14.i0.i3.u81.Node7ManageTheCrashOfNode2<1)||(i14.i0.i3.u22.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((i14.i0.i3.u81.N...324
Formula 0 simplified : X(!"((i14.i0.i3.u81.Node7ManageTheCrashOfNode2<1)||(i14.i0.i3.u22.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((i14.i0.i3.u81.Node...314
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8201760926204202076
[2024-05-25 09:12:08] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8201760926204202076
Running compilation step : cd /tmp/ltsmin8201760926204202076;'/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/ltsmin8201760926204202076;'/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/ltsmin8201760926204202076;'/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-S16C06-LTLFireability-12 finished in 212682 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||G(p1))))))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1195 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 192 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-25 09:12:11] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-25 09:12:11] [INFO ] Computed 55 invariants in 32 ms
[2024-05-25 09:12:12] [INFO ] Implicit Places using invariants in 920 ms returned [104, 293, 347, 556, 638, 639, 653, 662, 781, 868]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 922 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1170 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1170 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1162 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1162 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1154 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1154 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1147 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1147 transition count 2561
Applied a total of 62 rules in 234 ms. Remains 1147 /1178 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-25 09:12:12] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-25 09:12:12] [INFO ] Computed 45 invariants in 27 ms
[2024-05-25 09:12:13] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-25 09:12:13] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:12:13] [INFO ] Invariant cache hit.
[2024-05-25 09:12:14] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:12:22] [INFO ] Implicit Places using invariants and state equation in 9064 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9922 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1217 places, 2561/2721 transitions.
Applied a total of 0 rules in 51 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11321 ms. Remains : 1146/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(OR (LT s325 1) (LT s631 1)), p0:(AND (GEQ s640 1) (GEQ s1101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1612 reset in 406 ms.
Product exploration explored 100000 steps with 1612 reset in 431 ms.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:12:24] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-25 09:12:24] [INFO ] Computed 44 invariants in 24 ms
[2024-05-25 09:12:24] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:12:24] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:12:24] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:12:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:12:24] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:12:25] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:12:25] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:12:25] [INFO ] After 327ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:12:26] [INFO ] Deduced a trap composed of 407 places in 440 ms of which 1 ms to minimize.
[2024-05-25 09:12:26] [INFO ] Deduced a trap composed of 167 places in 416 ms of which 1 ms to minimize.
[2024-05-25 09:12:27] [INFO ] Deduced a trap composed of 189 places in 420 ms of which 1 ms to minimize.
[2024-05-25 09:12:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1520 ms
[2024-05-25 09:12:27] [INFO ] After 1896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-25 09:12:27] [INFO ] After 2669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 108 place count 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 239 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 370 place count 961 transition count 3721
Applied a total of 370 rules in 266 ms. Remains 961 /1146 variables (removed 185) and now considering 3721/2561 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 961/1146 places, 3721/2561 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79795 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79795 steps, saw 33293 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:12:30] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-25 09:12:30] [INFO ] Computed 44 invariants in 24 ms
[2024-05-25 09:12:31] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:12:31] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:12:31] [INFO ] After 869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:12:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:12:31] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:12:32] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:12:32] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:12:33] [INFO ] After 659ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:12:33] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-25 09:12:33] [INFO ] After 1854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 94 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 102 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:12:33] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:12:33] [INFO ] Invariant cache hit.
[2024-05-25 09:12:34] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-25 09:12:34] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:12:34] [INFO ] Invariant cache hit.
[2024-05-25 09:12:35] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:12:53] [INFO ] Implicit Places using invariants and state equation in 18197 ms returned []
Implicit Place search using SMT with State Equation took 19154 ms to find 0 implicit places.
[2024-05-25 09:12:53] [INFO ] Redundant transitions in 164 ms returned []
[2024-05-25 09:12:53] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:12:53] [INFO ] Invariant cache hit.
[2024-05-25 09:12:54] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20637 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1046 edges and 961 vertex of which 17 / 961 are part of one of the 1 SCC in 0 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 4261 edges and 945 vertex of which 931 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 t1199.t1393 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 914 transition count 2952
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 817 transition count 2759
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 721 transition count 2591
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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 213 rules applied. Total rules applied 868 place count 649 transition count 2450
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1055 place count 580 transition count 2332
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1200 place count 531 transition count 2236
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1325 place count 484 transition count 2158
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1416 place count 453 transition count 2098
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1491 place count 424 transition count 2052
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1541 place count 407 transition count 2019
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 1581 place count 391 transition count 1995
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 1603 place count 383 transition count 1981
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 1617 place count 377 transition count 1973
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1622 place count 375 transition count 1970
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1624 place count 374 transition count 1969
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1624 place count 374 transition count 1958
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1646 place count 363 transition count 1958
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1930 place count 79 transition count 334
Iterating global reduction 15 with 284 rules applied. Total rules applied 2214 place count 79 transition count 334
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 264 rules applied. Total rules applied 2478 place count 79 transition count 70
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2491 place count 67 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2492 place count 66 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2492 place count 66 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2494 place count 65 transition count 68
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2506 place count 53 transition count 56
Iterating global reduction 18 with 12 rules applied. Total rules applied 2518 place count 53 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2526 place count 49 transition count 52
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2529 place count 49 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2530 place count 49 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 2537 place count 49 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2544 place count 42 transition count 41
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 20 with 12 rules applied. Total rules applied 2556 place count 42 transition count 41
Applied a total of 2556 rules in 307 ms. Remains 42 /961 variables (removed 919) and now considering 41/3721 (removed 3680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 42 cols
[2024-05-25 09:12:54] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 09:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:12:54] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:12:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:12:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:12:54] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:12:54] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:12:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 09:12:54] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 47 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-25 09:12:55] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-25 09:12:55] [INFO ] Computed 44 invariants in 25 ms
[2024-05-25 09:12:56] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-25 09:12:56] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:12:56] [INFO ] Invariant cache hit.
[2024-05-25 09:12:56] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:13:06] [INFO ] Implicit Places using invariants and state equation in 10167 ms returned []
Implicit Place search using SMT with State Equation took 11024 ms to find 0 implicit places.
[2024-05-25 09:13:06] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:13:06] [INFO ] Invariant cache hit.
[2024-05-25 09:13:07] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12000 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:13:07] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:13:07] [INFO ] Invariant cache hit.
[2024-05-25 09:13:07] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:13:07] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:13:08] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:13:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:13:08] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:13:09] [INFO ] After 716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:13:09] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:13:09] [INFO ] After 183ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:13:10] [INFO ] Deduced a trap composed of 182 places in 437 ms of which 1 ms to minimize.
[2024-05-25 09:13:10] [INFO ] Deduced a trap composed of 407 places in 449 ms of which 1 ms to minimize.
[2024-05-25 09:13:11] [INFO ] Deduced a trap composed of 167 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1569 ms
[2024-05-25 09:13:11] [INFO ] After 1807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-25 09:13:11] [INFO ] After 2757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 108 place count 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 239 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 370 place count 961 transition count 3721
Applied a total of 370 rules in 293 ms. Remains 961 /1146 variables (removed 185) and now considering 3721/2561 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 961/1146 places, 3721/2561 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78612 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78612 steps, saw 32817 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:13:14] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-25 09:13:14] [INFO ] Computed 44 invariants in 34 ms
[2024-05-25 09:13:14] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:13:14] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:13:15] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:13:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:13:15] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:13:16] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:13:16] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:13:17] [INFO ] After 660ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:13:17] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-25 09:13:17] [INFO ] After 1882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 94 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 93 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:13:17] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:13:17] [INFO ] Invariant cache hit.
[2024-05-25 09:13:18] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2024-05-25 09:13:18] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:13:18] [INFO ] Invariant cache hit.
[2024-05-25 09:13:19] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:13:36] [INFO ] Implicit Places using invariants and state equation in 17641 ms returned []
Implicit Place search using SMT with State Equation took 18663 ms to find 0 implicit places.
[2024-05-25 09:13:36] [INFO ] Redundant transitions in 158 ms returned []
[2024-05-25 09:13:36] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:13:36] [INFO ] Invariant cache hit.
[2024-05-25 09:13:37] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20121 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1046 edges and 961 vertex of which 17 / 961 are part of one of the 1 SCC in 0 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 4261 edges and 945 vertex of which 931 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 t1199.t1393 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 914 transition count 2952
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 817 transition count 2759
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 721 transition count 2591
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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 213 rules applied. Total rules applied 868 place count 649 transition count 2450
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1055 place count 580 transition count 2332
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1200 place count 531 transition count 2236
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1325 place count 484 transition count 2158
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1416 place count 453 transition count 2098
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1491 place count 424 transition count 2052
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1541 place count 407 transition count 2019
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 1581 place count 391 transition count 1995
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 1603 place count 383 transition count 1981
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 1617 place count 377 transition count 1973
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1622 place count 375 transition count 1970
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1624 place count 374 transition count 1969
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1624 place count 374 transition count 1958
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1646 place count 363 transition count 1958
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1930 place count 79 transition count 334
Iterating global reduction 15 with 284 rules applied. Total rules applied 2214 place count 79 transition count 334
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 264 rules applied. Total rules applied 2478 place count 79 transition count 70
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2491 place count 67 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2492 place count 66 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2492 place count 66 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2494 place count 65 transition count 68
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2506 place count 53 transition count 56
Iterating global reduction 18 with 12 rules applied. Total rules applied 2518 place count 53 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2526 place count 49 transition count 52
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2529 place count 49 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2530 place count 49 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 2537 place count 49 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2544 place count 42 transition count 41
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 20 with 12 rules applied. Total rules applied 2556 place count 42 transition count 41
Applied a total of 2556 rules in 290 ms. Remains 42 /961 variables (removed 919) and now considering 41/3721 (removed 3680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 42 cols
[2024-05-25 09:13:38] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 09:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:13:38] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:13:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:13:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:13:38] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:13:38] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:13:38] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 09:13:38] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1612 reset in 415 ms.
Product exploration explored 100000 steps with 1614 reset in 429 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2561
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 25 place count 1146 transition count 2561
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 1146 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1133 transition count 2548
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1133 transition count 2548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1133 transition count 2548
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 80 rules in 211 ms. Remains 1133 /1146 variables (removed 13) and now considering 2548/2561 (removed 13) transitions.
[2024-05-25 09:13:40] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-25 09:13:40] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2024-05-25 09:13:40] [INFO ] Computed 44 invariants in 35 ms
[2024-05-25 09:13:41] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1146 places, 2548/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1268 ms. Remains : 1133/1146 places, 2548/2561 transitions.
Built C files in :
/tmp/ltsmin9272893411443086446
[2024-05-25 09:13:41] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9272893411443086446
Running compilation step : cd /tmp/ltsmin9272893411443086446;'/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/ltsmin9272893411443086446;'/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/ltsmin9272893411443086446;'/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 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 42 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-25 09:13:44] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-25 09:13:44] [INFO ] Computed 44 invariants in 23 ms
[2024-05-25 09:13:44] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-25 09:13:44] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:13:44] [INFO ] Invariant cache hit.
[2024-05-25 09:13:45] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:13:54] [INFO ] Implicit Places using invariants and state equation in 9219 ms returned []
Implicit Place search using SMT with State Equation took 10078 ms to find 0 implicit places.
[2024-05-25 09:13:54] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:13:54] [INFO ] Invariant cache hit.
[2024-05-25 09:13:55] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11032 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Built C files in :
/tmp/ltsmin8940461621635248880
[2024-05-25 09:13:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8940461621635248880
Running compilation step : cd /tmp/ltsmin8940461621635248880;'/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/ltsmin8940461621635248880;'/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/ltsmin8940461621635248880;'/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 09:13:58] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:13:58] [INFO ] Flatten gal took : 59 ms
[2024-05-25 09:13:58] [INFO ] Time to serialize gal into /tmp/LTL18181953977736332355.gal : 10 ms
[2024-05-25 09:13:58] [INFO ] Time to serialize properties into /tmp/LTL13836637537203736901.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/LTL18181953977736332355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8088250101490910086.hoa' '-atoms' '/tmp/LTL13836637537203736901.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/LTL13836637537203736901.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8088250101490910086.hoa
Detected timeout of ITS tools.
[2024-05-25 09:14:13] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:14:13] [INFO ] Flatten gal took : 60 ms
[2024-05-25 09:14:13] [INFO ] Time to serialize gal into /tmp/LTL5962022804089828133.gal : 16 ms
[2024-05-25 09:14:13] [INFO ] Time to serialize properties into /tmp/LTL18401858976556088312.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5962022804089828133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18401858976556088312.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(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2024-05-25 09:14:28] [INFO ] Flatten gal took : 57 ms
[2024-05-25 09:14:28] [INFO ] Applying decomposition
[2024-05-25 09:14:28] [INFO ] Flatten gal took : 58 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/graph12278690221183082446.txt' '-o' '/tmp/graph12278690221183082446.bin' '-w' '/tmp/graph12278690221183082446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12278690221183082446.bin' '-l' '-1' '-v' '-w' '/tmp/graph12278690221183082446.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:14:28] [INFO ] Decomposing Gal with order
[2024-05-25 09:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:14:29] [INFO ] Removed a total of 1878 redundant transitions.
[2024-05-25 09:14:29] [INFO ] Flatten gal took : 125 ms
[2024-05-25 09:14:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1680 labels/synchronizations in 47 ms.
[2024-05-25 09:14:30] [INFO ] Time to serialize gal into /tmp/LTL8525288004101205444.gal : 993 ms
[2024-05-25 09:14:30] [INFO ] Time to serialize properties into /tmp/LTL3733285599834077842.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/LTL8525288004101205444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3733285599834077842.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(X(F((G("((i6.i1.u58.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i5.i1.u98.Node11NotifyThatHeIsActive<1))"))||("((i13.i...254
Formula 0 simplified : XXG(!"((i13.i6.u99.Node11ManageTheCrashOfNode4>=1)&&(i13.i6.u166.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((i6.i1.u58.Node2Thi...244
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2929709571241469720
[2024-05-25 09:14:45] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2929709571241469720
Running compilation step : cd /tmp/ltsmin2929709571241469720;'/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/ltsmin2929709571241469720;'/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/ltsmin2929709571241469720;'/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-S16C06-LTLFireability-13 finished in 156759 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((F(p1)&&p0))||X(p2)||(G(p4)&&p3))))'
Support contains 7 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1197 transition count 2671
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1197 transition count 2671
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1191 transition count 2635
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1191 transition count 2635
Applied a total of 52 rules in 190 ms. Remains 1191 /1217 variables (removed 26) and now considering 2635/2721 (removed 86) transitions.
[2024-05-25 09:14:48] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1191 cols
[2024-05-25 09:14:48] [INFO ] Computed 55 invariants in 29 ms
[2024-05-25 09:14:49] [INFO ] Implicit Places using invariants in 905 ms returned [104, 294, 348, 557, 640, 666, 784]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 907 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1184/1217 places, 2635/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1177 transition count 2628
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1177 transition count 2628
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1170 transition count 2621
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1170 transition count 2621
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1163 transition count 2614
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1163 transition count 2614
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1157 transition count 2578
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1157 transition count 2578
Applied a total of 54 rules in 221 ms. Remains 1157 /1184 variables (removed 27) and now considering 2578/2635 (removed 57) transitions.
[2024-05-25 09:14:49] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1157 cols
[2024-05-25 09:14:49] [INFO ] Computed 48 invariants in 36 ms
[2024-05-25 09:14:50] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-05-25 09:14:50] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
[2024-05-25 09:14:50] [INFO ] Invariant cache hit.
[2024-05-25 09:14:51] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-25 09:15:00] [INFO ] Implicit Places using invariants and state equation in 9939 ms returned [1123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10833 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1156/1217 places, 2578/2721 transitions.
Applied a total of 0 rules in 46 ms. Remains 1156 /1156 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12199 ms. Remains : 1156/1217 places, 2578/2721 transitions.
Stuttering acceptance computed with spot in 587 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p4) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND p3 p4), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3 p4 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3 p4 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 p4 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p3 p4 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 p4 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 (NOT p4) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p4 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p4 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p4 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p4) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p4 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s106 1) (GEQ s1127 1)), p4:(AND (GEQ s2 1) (GEQ s638 1) (GEQ s844 1) (GEQ s845 1)), p0:(AND (GEQ s106 1) (GEQ s1127 1)), p1:(GEQ s632 1), p2:...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 994 ms.
Product exploration explored 100000 steps with 50000 reset in 1037 ms.
Computed a total of 324 stabilizing places and 945 stable transitions
Computed a total of 324 stabilizing places and 945 stable transitions
Detected a total of 324/1156 stabilizing places and 945/2578 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p4 (NOT p1) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p4) (NOT p2)))), (X (NOT (AND p0 p4 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2))))), (X (NOT (AND p3 p4 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p2)))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p4 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p4 (NOT p2)))), (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p4 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2)))))), (X (X (NOT (AND p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p4 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p4 (NOT p2))))), (X (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p4 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2)))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 37 factoid took 10898 ms. Reduced automaton from 5 states, 20 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 finished in 25753 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((F(p1)&&p0))||G(p2))))'
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(X((p0&&X(F(p1)))))))'
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((p0&&F(!p0)))||G(p1)))'
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||G(p1))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 78 place count 1178 transition count 2682
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 1171 transition count 2655
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 1171 transition count 2655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 92 place count 1171 transition count 2654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 1170 transition count 2654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 1167 transition count 2641
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 1167 transition count 2641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1166 transition count 2635
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1166 transition count 2635
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 156 place count 1139 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 162 place count 1133 transition count 2602
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 1133 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 1127 transition count 2566
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 1127 transition count 2566
Applied a total of 180 rules in 456 ms. Remains 1127 /1217 variables (removed 90) and now considering 2566/2721 (removed 155) transitions.
[2024-05-25 09:15:16] [INFO ] Flow matrix only has 2294 transitions (discarded 272 similar events)
// Phase 1: matrix 2294 rows 1127 cols
[2024-05-25 09:15:16] [INFO ] Computed 55 invariants in 37 ms
[2024-05-25 09:15:17] [INFO ] Implicit Places using invariants in 913 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 736, 821]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 915 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1117/1217 places, 2566/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1114 transition count 2563
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1114 transition count 2563
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1111 transition count 2560
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1111 transition count 2560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1109 transition count 2548
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1109 transition count 2548
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1104 transition count 2543
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1099 transition count 2538
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1099 transition count 2538
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1094 transition count 2508
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1094 transition count 2508
Applied a total of 46 rules in 337 ms. Remains 1094 /1117 variables (removed 23) and now considering 2508/2566 (removed 58) transitions.
[2024-05-25 09:15:17] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2024-05-25 09:15:17] [INFO ] Computed 45 invariants in 26 ms
[2024-05-25 09:15:18] [INFO ] Implicit Places using invariants in 848 ms returned []
[2024-05-25 09:15:18] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 09:15:18] [INFO ] Invariant cache hit.
[2024-05-25 09:15:19] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:15:28] [INFO ] Implicit Places using invariants and state equation in 9643 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10492 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1093/1217 places, 2508/2721 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2507
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2507
Applied a total of 2 rules in 59 ms. Remains 1092 /1093 variables (removed 1) and now considering 2507/2508 (removed 1) transitions.
[2024-05-25 09:15:28] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
// Phase 1: matrix 2235 rows 1092 cols
[2024-05-25 09:15:28] [INFO ] Computed 44 invariants in 22 ms
[2024-05-25 09:15:29] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-25 09:15:29] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:15:29] [INFO ] Invariant cache hit.
[2024-05-25 09:15:29] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:15:37] [INFO ] Implicit Places using invariants and state equation in 8116 ms returned []
Implicit Place search using SMT with State Equation took 8973 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1092/1217 places, 2507/2721 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 21232 ms. Remains : 1092/1217 places, 2507/2721 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(OR (LT s298 1) (LT s596 1)), p0:(AND (GEQ s604 1) (GEQ s1059 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2290 reset in 492 ms.
Product exploration explored 100000 steps with 2288 reset in 506 ms.
Computed a total of 277 stabilizing places and 891 stable transitions
Computed a total of 277 stabilizing places and 891 stable transitions
Detected a total of 277/1092 stabilizing places and 891/2507 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:15:38] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:15:38] [INFO ] Invariant cache hit.
[2024-05-25 09:15:38] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:15:38] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:15:39] [INFO ] After 857ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:15:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:15:39] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:15:40] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:15:40] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:15:40] [INFO ] After 147ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:15:40] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-25 09:15:40] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2507/2507 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 961 transition count 3721
Applied a total of 262 rules in 184 ms. Remains 961 /1092 variables (removed 131) and now considering 3721/2507 (removed -1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 961/1092 places, 3721/2507 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78716 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78716 steps, saw 32862 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:15:43] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-25 09:15:43] [INFO ] Computed 44 invariants in 35 ms
[2024-05-25 09:15:44] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:15:44] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:15:44] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:15:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:15:44] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:15:45] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:15:45] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:15:45] [INFO ] After 564ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:15:46] [INFO ] Deduced a trap composed of 210 places in 420 ms of which 2 ms to minimize.
[2024-05-25 09:15:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2024-05-25 09:15:46] [INFO ] After 1213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-25 09:15:46] [INFO ] After 2284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 95 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 103 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:15:46] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:15:46] [INFO ] Invariant cache hit.
[2024-05-25 09:15:47] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-25 09:15:47] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:15:47] [INFO ] Invariant cache hit.
[2024-05-25 09:15:48] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:16:04] [INFO ] Implicit Places using invariants and state equation in 17426 ms returned []
Implicit Place search using SMT with State Equation took 18390 ms to find 0 implicit places.
[2024-05-25 09:16:05] [INFO ] Redundant transitions in 159 ms returned []
[2024-05-25 09:16:05] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:16:05] [INFO ] Invariant cache hit.
[2024-05-25 09:16:06] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19857 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1046 edges and 961 vertex of which 17 / 961 are part of one of the 1 SCC in 0 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 4261 edges and 945 vertex of which 931 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 t1199.t1393 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 914 transition count 2952
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 817 transition count 2759
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 721 transition count 2591
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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 213 rules applied. Total rules applied 868 place count 649 transition count 2450
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1055 place count 580 transition count 2332
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1200 place count 531 transition count 2236
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1325 place count 484 transition count 2158
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1416 place count 453 transition count 2098
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1491 place count 424 transition count 2052
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1541 place count 407 transition count 2019
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 1581 place count 391 transition count 1995
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 1603 place count 383 transition count 1981
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 1617 place count 377 transition count 1973
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1622 place count 375 transition count 1970
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1624 place count 374 transition count 1969
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1624 place count 374 transition count 1958
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1646 place count 363 transition count 1958
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1930 place count 79 transition count 334
Iterating global reduction 15 with 284 rules applied. Total rules applied 2214 place count 79 transition count 334
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 264 rules applied. Total rules applied 2478 place count 79 transition count 70
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2491 place count 67 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2492 place count 66 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2492 place count 66 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2494 place count 65 transition count 68
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2506 place count 53 transition count 56
Iterating global reduction 18 with 12 rules applied. Total rules applied 2518 place count 53 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2526 place count 49 transition count 52
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2529 place count 49 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2530 place count 49 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 2537 place count 49 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2544 place count 42 transition count 41
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 20 with 12 rules applied. Total rules applied 2556 place count 42 transition count 41
Applied a total of 2556 rules in 289 ms. Remains 42 /961 variables (removed 919) and now considering 41/3721 (removed 3680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 42 cols
[2024-05-25 09:16:06] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 09:16:06] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:16:06] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:16:06] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:16:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:16:06] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:16:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:06] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 09:16:06] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1092 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 2507/2507 transitions.
Applied a total of 0 rules in 47 ms. Remains 1092 /1092 variables (removed 0) and now considering 2507/2507 (removed 0) transitions.
[2024-05-25 09:16:07] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
// Phase 1: matrix 2235 rows 1092 cols
[2024-05-25 09:16:07] [INFO ] Computed 44 invariants in 27 ms
[2024-05-25 09:16:07] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-25 09:16:07] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:07] [INFO ] Invariant cache hit.
[2024-05-25 09:16:08] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:16:15] [INFO ] Implicit Places using invariants and state equation in 7690 ms returned []
Implicit Place search using SMT with State Equation took 8533 ms to find 0 implicit places.
[2024-05-25 09:16:15] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:15] [INFO ] Invariant cache hit.
[2024-05-25 09:16:16] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9486 ms. Remains : 1092/1092 places, 2507/2507 transitions.
Computed a total of 277 stabilizing places and 891 stable transitions
Computed a total of 277 stabilizing places and 891 stable transitions
Detected a total of 277/1092 stabilizing places and 891/2507 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:16:16] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:16] [INFO ] Invariant cache hit.
[2024-05-25 09:16:17] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:16:17] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 09:16:17] [INFO ] After 842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:16:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:16:17] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-25 09:16:18] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:18] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:16:18] [INFO ] After 143ms SMT Verify possible using 833 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:18] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-25 09:16:18] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2507/2507 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 961 transition count 3721
Applied a total of 262 rules in 181 ms. Remains 961 /1092 variables (removed 131) and now considering 3721/2507 (removed -1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 961/1092 places, 3721/2507 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79343 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79343 steps, saw 33118 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:16:22] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-25 09:16:22] [INFO ] Computed 44 invariants in 36 ms
[2024-05-25 09:16:22] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:16:22] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 09:16:22] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:16:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:16:22] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 09:16:23] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:23] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:16:24] [INFO ] After 562ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:24] [INFO ] Deduced a trap composed of 210 places in 420 ms of which 1 ms to minimize.
[2024-05-25 09:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 571 ms
[2024-05-25 09:16:24] [INFO ] After 1213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-25 09:16:24] [INFO ] After 2312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 102 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 94 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-25 09:16:24] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:16:24] [INFO ] Invariant cache hit.
[2024-05-25 09:16:25] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-25 09:16:25] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:16:25] [INFO ] Invariant cache hit.
[2024-05-25 09:16:26] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 09:16:42] [INFO ] Implicit Places using invariants and state equation in 16172 ms returned []
Implicit Place search using SMT with State Equation took 17162 ms to find 0 implicit places.
[2024-05-25 09:16:42] [INFO ] Redundant transitions in 166 ms returned []
[2024-05-25 09:16:42] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-25 09:16:42] [INFO ] Invariant cache hit.
[2024-05-25 09:16:43] [INFO ] Dead Transitions using invariants and state equation in 1190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18622 ms. Remains : 961/961 places, 3721/3721 transitions.
Graph (trivial) has 1046 edges and 961 vertex of which 17 / 961 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 4261 edges and 945 vertex of which 931 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 t1199.t1393 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 914 transition count 2952
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 817 transition count 2759
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 721 transition count 2591
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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 213 rules applied. Total rules applied 868 place count 649 transition count 2450
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1055 place count 580 transition count 2332
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1200 place count 531 transition count 2236
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1325 place count 484 transition count 2158
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1416 place count 453 transition count 2098
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1491 place count 424 transition count 2052
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1541 place count 407 transition count 2019
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 1581 place count 391 transition count 1995
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 1603 place count 383 transition count 1981
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 1617 place count 377 transition count 1973
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1622 place count 375 transition count 1970
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1624 place count 374 transition count 1969
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1624 place count 374 transition count 1958
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1646 place count 363 transition count 1958
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1930 place count 79 transition count 334
Iterating global reduction 15 with 284 rules applied. Total rules applied 2214 place count 79 transition count 334
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 264 rules applied. Total rules applied 2478 place count 79 transition count 70
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2491 place count 67 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2492 place count 66 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2492 place count 66 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2494 place count 65 transition count 68
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2506 place count 53 transition count 56
Iterating global reduction 18 with 12 rules applied. Total rules applied 2518 place count 53 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2526 place count 49 transition count 52
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2529 place count 49 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2530 place count 49 transition count 48
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 2537 place count 49 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2544 place count 42 transition count 41
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 20 with 12 rules applied. Total rules applied 2556 place count 42 transition count 41
Applied a total of 2556 rules in 285 ms. Remains 42 /961 variables (removed 919) and now considering 41/3721 (removed 3680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 42 cols
[2024-05-25 09:16:43] [INFO ] Computed 14 invariants in 0 ms
[2024-05-25 09:16:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:16:43] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:16:43] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:16:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:16:43] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-25 09:16:43] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:16:43] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 09:16:43] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2290 reset in 491 ms.
Product exploration explored 100000 steps with 2288 reset in 513 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1092 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1092/1092 places, 2507/2507 transitions.
Applied a total of 0 rules in 72 ms. Remains 1092 /1092 variables (removed 0) and now considering 2507/2507 (removed 0) transitions.
[2024-05-25 09:16:45] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 09:16:45] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
// Phase 1: matrix 2235 rows 1092 cols
[2024-05-25 09:16:45] [INFO ] Computed 44 invariants in 27 ms
[2024-05-25 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1098 ms. Remains : 1092/1092 places, 2507/2507 transitions.
Built C files in :
/tmp/ltsmin982140160620126055
[2024-05-25 09:16:46] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin982140160620126055
Running compilation step : cd /tmp/ltsmin982140160620126055;'/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/ltsmin982140160620126055;'/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/ltsmin982140160620126055;'/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 1092 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 2507/2507 transitions.
Applied a total of 0 rules in 43 ms. Remains 1092 /1092 variables (removed 0) and now considering 2507/2507 (removed 0) transitions.
[2024-05-25 09:16:49] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:49] [INFO ] Invariant cache hit.
[2024-05-25 09:16:50] [INFO ] Implicit Places using invariants in 823 ms returned []
[2024-05-25 09:16:50] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:50] [INFO ] Invariant cache hit.
[2024-05-25 09:16:51] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 09:16:58] [INFO ] Implicit Places using invariants and state equation in 7980 ms returned []
Implicit Place search using SMT with State Equation took 8805 ms to find 0 implicit places.
[2024-05-25 09:16:58] [INFO ] Flow matrix only has 2235 transitions (discarded 272 similar events)
[2024-05-25 09:16:58] [INFO ] Invariant cache hit.
[2024-05-25 09:16:59] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9753 ms. Remains : 1092/1092 places, 2507/2507 transitions.
Built C files in :
/tmp/ltsmin8771215267767780388
[2024-05-25 09:16:59] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8771215267767780388
Running compilation step : cd /tmp/ltsmin8771215267767780388;'/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/ltsmin8771215267767780388;'/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/ltsmin8771215267767780388;'/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 09:17:02] [INFO ] Flatten gal took : 48 ms
[2024-05-25 09:17:02] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:17:02] [INFO ] Time to serialize gal into /tmp/LTL14554384558978007123.gal : 8 ms
[2024-05-25 09:17:02] [INFO ] Time to serialize properties into /tmp/LTL5740680553963767760.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/LTL14554384558978007123.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17785689929742206288.hoa' '-atoms' '/tmp/LTL5740680553963767760.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/LTL5740680553963767760.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17785689929742206288.hoa
Detected timeout of ITS tools.
[2024-05-25 09:17:17] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:17:17] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:17:17] [INFO ] Time to serialize gal into /tmp/LTL18368460190717253670.gal : 11 ms
[2024-05-25 09:17:17] [INFO ] Time to serialize properties into /tmp/LTL2749438354243677852.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/LTL18368460190717253670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2749438354243677852.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(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2024-05-25 09:17:32] [INFO ] Flatten gal took : 48 ms
[2024-05-25 09:17:32] [INFO ] Applying decomposition
[2024-05-25 09:17:32] [INFO ] Flatten gal took : 49 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/graph5665944740086934718.txt' '-o' '/tmp/graph5665944740086934718.bin' '-w' '/tmp/graph5665944740086934718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5665944740086934718.bin' '-l' '-1' '-v' '-w' '/tmp/graph5665944740086934718.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:17:33] [INFO ] Decomposing Gal with order
[2024-05-25 09:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:17:33] [INFO ] Removed a total of 2254 redundant transitions.
[2024-05-25 09:17:33] [INFO ] Flatten gal took : 199 ms
[2024-05-25 09:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 984 labels/synchronizations in 39 ms.
[2024-05-25 09:17:33] [INFO ] Time to serialize gal into /tmp/LTL12784420900934905754.gal : 15 ms
[2024-05-25 09:17:33] [INFO ] Time to serialize properties into /tmp/LTL7617739120350350573.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/LTL12784420900934905754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7617739120350350573.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((u40.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i14.u80.Node11NotifyThatHeIsActive<1))"))||("((i19.i1.u82.No...246
Formula 0 simplified : XXG(!"((i19.i1.u82.Node11ManageTheCrashOfNode4>=1)&&(i19.i1.u151.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((u40.Node2ThinksNod...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1346087423660559460
[2024-05-25 09:17:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1346087423660559460
Running compilation step : cd /tmp/ltsmin1346087423660559460;'/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/ltsmin1346087423660559460;'/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/ltsmin1346087423660559460;'/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-S16C06-LTLFireability-13 finished in 155734 ms.
[2024-05-25 09:17:51] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9257359082639096022
[2024-05-25 09:17:51] [INFO ] Too many transitions (2721) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:17:51] [INFO ] Applying decomposition
[2024-05-25 09:17:51] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9257359082639096022
Running compilation step : cd /tmp/ltsmin9257359082639096022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 09:17:51] [INFO ] Flatten gal took : 67 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/graph5171682719950026036.txt' '-o' '/tmp/graph5171682719950026036.bin' '-w' '/tmp/graph5171682719950026036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5171682719950026036.bin' '-l' '-1' '-v' '-w' '/tmp/graph5171682719950026036.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:17:51] [INFO ] Decomposing Gal with order
[2024-05-25 09:17:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:17:51] [INFO ] Removed a total of 2115 redundant transitions.
[2024-05-25 09:17:51] [INFO ] Flatten gal took : 130 ms
[2024-05-25 09:17:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1779 labels/synchronizations in 72 ms.
[2024-05-25 09:17:52] [INFO ] Time to serialize gal into /tmp/LTLFireability2961227730354325564.gal : 16 ms
[2024-05-25 09:17:52] [INFO ] Time to serialize properties into /tmp/LTLFireability5749799022626384630.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/LTLFireability2961227730354325564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5749799022626384630.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 4 LTL properties
Checking formula 0 : !((F((G(("(((u0.Node6DontAnswerToAnyNode<1)||(u0.Node11IsActive<1))&&((i7.i2.u10.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)|...406
Formula 0 simplified : G(F(!"(((u0.Node6DontAnswerToAnyNode<1)||(u0.Node11IsActive<1))&&((i7.i2.u10.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(...396
Compilation finished in 5788 ms.
Running link step : cd /tmp/ltsmin9257359082639096022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9257359082639096022;'/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' '<>(([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9257359082639096022;'/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' '<>(([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9257359082639096022;'/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(X(X(((LTLAPp3==true)&&X(<>((LTLAPp4==true)))))))' '--buchi-type=spotba'
LTSmin run took 908 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9257359082639096022;'/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(((LTLAPp5==true)&&<>(!(LTLAPp5==true))))||[]((LTLAPp6==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 09:44:39] [INFO ] Flatten gal took : 585 ms
[2024-05-25 09:44:45] [INFO ] Time to serialize gal into /tmp/LTLFireability14562199357252928876.gal : 5746 ms
[2024-05-25 09:44:45] [INFO ] Time to serialize properties into /tmp/LTLFireability17748310908451958420.ltl : 8 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/LTLFireability14562199357252928876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17748310908451958420.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...299
Read 3 LTL properties
Checking formula 0 : !((F((G(("(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetect...352
Formula 0 simplified : G(F(!"(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectTh...342
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9257359082639096022;'/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(((LTLAPp5==true)&&<>(!(LTLAPp5==true))))||[]((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9257359082639096022;'/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(X(<>(((LTLAPp7==true)||[]((LTLAPp8==true))))))' '--buchi-type=spotba'
LTSmin run took 567802 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9257359082639096022;'/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' '<>(([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5594524 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16016364 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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-S16C06"
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-S16C06, 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-171654371900023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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 ;