About the Execution of 2023-gold for NoC3x3-PT-7B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.052 | 3600000.00 | 13160028.00 | 25639.90 | FTFTFF?TFFFFFFTF | 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-171654372800413.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 NoC3x3-PT-7B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800413
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K 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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716695184895
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=NoC3x3-PT-7B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 03:46:26] [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-26 03:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:46:26] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-05-26 03:46:26] [INFO ] Transformed 7014 places.
[2024-05-26 03:46:27] [INFO ] Transformed 8833 transitions.
[2024-05-26 03:46:27] [INFO ] Found NUPN structural information;
[2024-05-26 03:46:27] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-7B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1861 places :
Symmetric choice reduction at 0 with 1861 rule applications. Total rules 1861 place count 5153 transition count 6972
Iterating global reduction 0 with 1861 rules applied. Total rules applied 3722 place count 5153 transition count 6972
Discarding 493 places :
Symmetric choice reduction at 0 with 493 rule applications. Total rules 4215 place count 4660 transition count 6479
Iterating global reduction 0 with 493 rules applied. Total rules applied 4708 place count 4660 transition count 6479
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4791 place count 4577 transition count 6313
Iterating global reduction 0 with 83 rules applied. Total rules applied 4874 place count 4577 transition count 6313
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4957 place count 4494 transition count 6230
Iterating global reduction 0 with 83 rules applied. Total rules applied 5040 place count 4494 transition count 6230
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 5123 place count 4411 transition count 6147
Iterating global reduction 0 with 83 rules applied. Total rules applied 5206 place count 4411 transition count 6147
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 5288 place count 4329 transition count 6024
Iterating global reduction 0 with 82 rules applied. Total rules applied 5370 place count 4329 transition count 6024
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 5448 place count 4251 transition count 5868
Iterating global reduction 0 with 78 rules applied. Total rules applied 5526 place count 4251 transition count 5868
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 5545 place count 4251 transition count 5849
Applied a total of 5545 rules in 4207 ms. Remains 4251 /7014 variables (removed 2763) and now considering 5849/8833 (removed 2984) transitions.
// Phase 1: matrix 5849 rows 4251 cols
[2024-05-26 03:46:31] [INFO ] Computed 66 invariants in 59 ms
[2024-05-26 03:46:32] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2024-05-26 03:46:32] [INFO ] Invariant cache hit.
[2024-05-26 03:46:33] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2024-05-26 03:46:33] [INFO ] Invariant cache hit.
[2024-05-26 03:46:36] [INFO ] Dead Transitions using invariants and state equation in 3310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4251/7014 places, 5849/8833 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9531 ms. Remains : 4251/7014 places, 5849/8833 transitions.
Support contains 29 out of 4251 places after structural reductions.
[2024-05-26 03:46:37] [INFO ] Flatten gal took : 272 ms
[2024-05-26 03:46:37] [INFO ] Flatten gal took : 161 ms
[2024-05-26 03:46:37] [INFO ] Input system was already deterministic with 5849 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-26 03:46:38] [INFO ] Invariant cache hit.
[2024-05-26 03:46:40] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:46:40] [INFO ] After 1587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-26 03:46:41] [INFO ] [Nat]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:46:47] [INFO ] After 5164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-26 03:46:48] [INFO ] Deduced a trap composed of 112 places in 186 ms of which 3 ms to minimize.
[2024-05-26 03:46:48] [INFO ] Deduced a trap composed of 154 places in 148 ms of which 1 ms to minimize.
[2024-05-26 03:46:48] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 1 ms to minimize.
[2024-05-26 03:46:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1103 ms
[2024-05-26 03:46:50] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 2 ms to minimize.
[2024-05-26 03:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-05-26 03:46:53] [INFO ] After 11326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 2634 ms.
[2024-05-26 03:46:56] [INFO ] After 16264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 7 different solutions.
Parikh walk visited 13 properties in 623 ms.
Support contains 8 out of 4251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5132 edges and 4251 vertex of which 3217 / 4251 are part of one of the 33 SCC in 13 ms
Free SCC test removed 3184 places
Drop transitions removed 4160 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 4321 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 0 with 8 rules applied. Total rules applied 9 place count 1067 transition count 1520
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 1059 transition count 1513
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 1055 transition count 1513
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 28 place count 1055 transition count 1470
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 114 place count 1012 transition count 1470
Discarding 268 places :
Symmetric choice reduction at 3 with 268 rule applications. Total rules 382 place count 744 transition count 1079
Iterating global reduction 3 with 268 rules applied. Total rules applied 650 place count 744 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 744 transition count 1078
Discarding 194 places :
Symmetric choice reduction at 4 with 194 rule applications. Total rules 845 place count 550 transition count 832
Iterating global reduction 4 with 194 rules applied. Total rules applied 1039 place count 550 transition count 832
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 4 with 194 rules applied. Total rules applied 1233 place count 550 transition count 638
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 1519 place count 407 transition count 495
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1522 place count 407 transition count 492
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1523 place count 406 transition count 491
Iterating global reduction 6 with 1 rules applied. Total rules applied 1524 place count 406 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1526 place count 405 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1527 place count 405 transition count 489
Performed 9 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1545 place count 396 transition count 530
Drop transitions removed 2 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1568 place count 396 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1570 place count 395 transition count 518
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1582 place count 395 transition count 506
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 1603 place count 395 transition count 485
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1604 place count 394 transition count 484
Iterating global reduction 9 with 1 rules applied. Total rules applied 1605 place count 394 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1607 place count 393 transition count 495
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1612 place count 393 transition count 490
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1613 place count 392 transition count 489
Iterating global reduction 9 with 1 rules applied. Total rules applied 1614 place count 392 transition count 489
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1618 place count 392 transition count 485
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1619 place count 391 transition count 484
Iterating global reduction 9 with 1 rules applied. Total rules applied 1620 place count 391 transition count 484
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1623 place count 391 transition count 481
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1624 place count 390 transition count 480
Iterating global reduction 9 with 1 rules applied. Total rules applied 1625 place count 390 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1626 place count 390 transition count 479
Free-agglomeration rule applied 195 times.
Iterating global reduction 10 with 195 rules applied. Total rules applied 1821 place count 390 transition count 284
Reduce places removed 195 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 543 edges and 195 vertex of which 64 are kept as prefixes of interest. Removing 131 places using SCC suffix rule.1 ms
Discarding 131 places :
Also discarding 107 output transitions
Drop transitions removed 107 transitions
Iterating post reduction 10 with 233 rules applied. Total rules applied 2054 place count 64 transition count 140
Drop transitions removed 58 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 11 with 61 rules applied. Total rules applied 2115 place count 64 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2116 place count 63 transition count 78
Reduce places removed 10 places and 0 transitions.
Graph (trivial) has 29 edges and 53 vertex of which 14 / 53 are part of one of the 3 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 16 rules applied. Total rules applied 2132 place count 42 transition count 73
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 13 with 27 rules applied. Total rules applied 2159 place count 37 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2160 place count 37 transition count 51
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2161 place count 37 transition count 50
Applied a total of 2161 rules in 734 ms. Remains 37 /4251 variables (removed 4214) and now considering 50/5849 (removed 5799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 37/4251 places, 50/5849 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-26 03:46:58] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 37 cols
[2024-05-26 03:46:58] [INFO ] Computed 11 invariants in 0 ms
[2024-05-26 03:46:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-26 03:46:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:46:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-26 03:46:58] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:46:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-26 03:46:58] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:46:58] [INFO ] After 7ms 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-26 03:46:58] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 50/50 transitions.
Graph (trivial) has 9 edges and 37 vertex of which 4 / 37 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 42
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 28 transition count 37
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 28 transition count 37
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 28 transition count 35
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 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 1 with 12 rules applied. Total rules applied 22 place count 24 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 22 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 21 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 20 transition count 23
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 20 transition count 22
Applied a total of 31 rules in 10 ms. Remains 20 /37 variables (removed 17) and now considering 22/50 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 20/37 places, 22/50 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 65 stabilizing places and 65 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' '!(G(F(p0)))'
Support contains 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5146 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 6 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 1498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1024 transition count 1498
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1024 transition count 1462
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 988 transition count 1462
Discarding 276 places :
Symmetric choice reduction at 2 with 276 rule applications. Total rules 351 place count 712 transition count 1052
Iterating global reduction 2 with 276 rules applied. Total rules applied 627 place count 712 transition count 1052
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 629 place count 712 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 629 place count 712 transition count 1049
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 711 transition count 1049
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 833 place count 509 transition count 796
Iterating global reduction 3 with 202 rules applied. Total rules applied 1035 place count 509 transition count 796
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1236 place count 509 transition count 595
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1494 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1495 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1505 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1553 place count 346 transition count 417
Applied a total of 1553 rules in 156 ms. Remains 346 /4251 variables (removed 3905) and now considering 417/5849 (removed 5432) transitions.
[2024-05-26 03:46:58] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2024-05-26 03:46:58] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 03:46:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-26 03:46:58] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 03:46:58] [INFO ] Invariant cache hit.
[2024-05-26 03:46:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:46:59] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-26 03:46:59] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-26 03:46:59] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 03:46:59] [INFO ] Invariant cache hit.
[2024-05-26 03:46:59] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/4251 places, 417/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 787 ms. Remains : 346/4251 places, 417/5849 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 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s301 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-00 finished in 1018 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((F(G(p1))||p0)))))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5828
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5801
Applied a total of 61 rules in 2608 ms. Remains 4221 /4251 variables (removed 30) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 03:47:02] [INFO ] Computed 66 invariants in 35 ms
[2024-05-26 03:47:02] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-26 03:47:02] [INFO ] Invariant cache hit.
[2024-05-26 03:47:04] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2024-05-26 03:47:04] [INFO ] Invariant cache hit.
[2024-05-26 03:47:07] [INFO ] Dead Transitions using invariants and state equation in 3137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8064 ms. Remains : 4221/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s432 0) (EQ s553 0)), p1:(OR (EQ s996 0) (EQ s3668 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1799 ms.
Product exploration explored 100000 steps with 25000 reset in 1709 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 234152 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234152 steps, saw 226314 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:47:14] [INFO ] Invariant cache hit.
[2024-05-26 03:47:15] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:47:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2024-05-26 03:47:18] [INFO ] After 2769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:47:19] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 1 ms to minimize.
[2024-05-26 03:47:19] [INFO ] Deduced a trap composed of 171 places in 128 ms of which 1 ms to minimize.
[2024-05-26 03:47:19] [INFO ] Deduced a trap composed of 157 places in 117 ms of which 0 ms to minimize.
[2024-05-26 03:47:20] [INFO ] Deduced a trap composed of 170 places in 98 ms of which 1 ms to minimize.
[2024-05-26 03:47:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1250 ms
[2024-05-26 03:47:20] [INFO ] After 4392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 287 ms.
[2024-05-26 03:47:20] [INFO ] After 5324ms 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 1 properties in 46 ms.
Support contains 2 out of 4221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Graph (trivial) has 5104 edges and 4221 vertex of which 3231 / 4221 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3198 places
Drop transitions removed 4185 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 4345 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 1023 transition count 1419
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 75 place count 986 transition count 1419
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 347 place count 714 transition count 1011
Iterating global reduction 0 with 272 rules applied. Total rules applied 619 place count 714 transition count 1011
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 818 place count 515 transition count 770
Iterating global reduction 0 with 199 rules applied. Total rules applied 1017 place count 515 transition count 770
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 1216 place count 515 transition count 571
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 1 with 264 rules applied. Total rules applied 1480 place count 383 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1482 place count 382 transition count 453
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1484 place count 382 transition count 451
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1491 place count 382 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1493 place count 381 transition count 455
Free-agglomeration rule applied 201 times.
Iterating global reduction 2 with 201 rules applied. Total rules applied 1694 place count 381 transition count 254
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 490 edges and 180 vertex of which 16 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.0 ms
Discarding 164 places :
Also discarding 171 output transitions
Drop transitions removed 171 transitions
Iterating post reduction 2 with 238 rules applied. Total rules applied 1932 place count 16 transition count 47
Drop transitions removed 28 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 1963 place count 16 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1964 place count 16 transition count 15
Graph (complete) has 30 edges and 16 vertex of which 6 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 1965 place count 6 transition count 8
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1967 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1967 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1969 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1970 place count 4 transition count 4
Applied a total of 1970 rules in 133 ms. Remains 4 /4221 variables (removed 4217) and now considering 4/5801 (removed 5797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 4/4221 places, 4/5801 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Applied a total of 0 rules in 371 ms. Remains 4221 /4221 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2024-05-26 03:47:21] [INFO ] Invariant cache hit.
[2024-05-26 03:47:22] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-05-26 03:47:22] [INFO ] Invariant cache hit.
[2024-05-26 03:47:24] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2024-05-26 03:47:24] [INFO ] Invariant cache hit.
[2024-05-26 03:47:27] [INFO ] Dead Transitions using invariants and state equation in 3374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6090 ms. Remains : 4221/4221 places, 5801/5801 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 209411 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209411 steps, saw 202407 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:47:31] [INFO ] Invariant cache hit.
[2024-05-26 03:47:31] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:47:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-05-26 03:47:35] [INFO ] After 2793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 0 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 157 places in 122 ms of which 0 ms to minimize.
[2024-05-26 03:47:36] [INFO ] Deduced a trap composed of 170 places in 107 ms of which 0 ms to minimize.
[2024-05-26 03:47:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1262 ms
[2024-05-26 03:47:36] [INFO ] After 4428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 302 ms.
[2024-05-26 03:47:37] [INFO ] After 5365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2019 steps, including 1 resets, run visited all 2 properties in 20 ms. (steps per millisecond=100 )
Parikh walk visited 2 properties in 21 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 1659 ms.
Product exploration explored 100000 steps with 25000 reset in 1680 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Graph (trivial) has 5102 edges and 4221 vertex of which 3231 / 4221 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3198 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Discarding 246 places :
Symmetric choice reduction at 0 with 246 rule applications. Total rules 247 place count 777 transition count 1243
Iterating global reduction 0 with 246 rules applied. Total rules applied 493 place count 777 transition count 1243
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 691 place count 579 transition count 905
Iterating global reduction 0 with 198 rules applied. Total rules applied 889 place count 579 transition count 905
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 1087 place count 579 transition count 707
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 1087 place count 579 transition count 747
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 1120 place count 579 transition count 747
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 1143 place count 556 transition count 696
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 1166 place count 556 transition count 696
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 1189 place count 533 transition count 645
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 1212 place count 533 transition count 645
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 1347 place count 533 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1349 place count 531 transition count 638
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1351 place count 531 transition count 638
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1353 place count 529 transition count 636
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1355 place count 529 transition count 636
Deduced a syphon composed of 143 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 1356 place count 529 transition count 635
Deduced a syphon composed of 143 places in 0 ms
Applied a total of 1356 rules in 297 ms. Remains 529 /4221 variables (removed 3692) and now considering 635/5801 (removed 5166) transitions.
[2024-05-26 03:47:41] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-26 03:47:41] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 529 cols
[2024-05-26 03:47:41] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:47:42] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 529/4221 places, 635/5801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 613 ms. Remains : 529/4221 places, 635/5801 transitions.
Built C files in :
/tmp/ltsmin337020212866662531
[2024-05-26 03:47:42] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin337020212866662531
Running compilation step : cd /tmp/ltsmin337020212866662531;'/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/ltsmin337020212866662531;'/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/ltsmin337020212866662531;'/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 4221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Applied a total of 0 rules in 297 ms. Remains 4221 /4221 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 03:47:45] [INFO ] Computed 66 invariants in 28 ms
[2024-05-26 03:47:46] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-26 03:47:46] [INFO ] Invariant cache hit.
[2024-05-26 03:47:47] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-26 03:47:47] [INFO ] Invariant cache hit.
[2024-05-26 03:47:50] [INFO ] Dead Transitions using invariants and state equation in 3232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5209 ms. Remains : 4221/4221 places, 5801/5801 transitions.
Built C files in :
/tmp/ltsmin14896614445893268573
[2024-05-26 03:47:50] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14896614445893268573
Running compilation step : cd /tmp/ltsmin14896614445893268573;'/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/ltsmin14896614445893268573;'/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/ltsmin14896614445893268573;'/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-26 03:47:53] [INFO ] Flatten gal took : 138 ms
[2024-05-26 03:47:54] [INFO ] Flatten gal took : 140 ms
[2024-05-26 03:47:54] [INFO ] Time to serialize gal into /tmp/LTL2437575587497594596.gal : 33 ms
[2024-05-26 03:47:54] [INFO ] Time to serialize properties into /tmp/LTL8595100540929297269.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/LTL2437575587497594596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6446684327225665752.hoa' '-atoms' '/tmp/LTL8595100540929297269.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/LTL8595100540929297269.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6446684327225665752.hoa
Detected timeout of ITS tools.
[2024-05-26 03:48:09] [INFO ] Flatten gal took : 152 ms
[2024-05-26 03:48:09] [INFO ] Flatten gal took : 142 ms
[2024-05-26 03:48:09] [INFO ] Time to serialize gal into /tmp/LTL13898269820291095378.gal : 34 ms
[2024-05-26 03:48:09] [INFO ] Time to serialize properties into /tmp/LTL16461144729361962892.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/LTL13898269820291095378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16461144729361962892.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((p699==0)||(p906==0))")||(F(G("((p1626==0)||(p6072==0))"))))))))
Formula 0 simplified : XXX(!"((p699==0)||(p906==0))" & GF!"((p1626==0)||(p6072==0))")
Detected timeout of ITS tools.
[2024-05-26 03:48:24] [INFO ] Flatten gal took : 115 ms
[2024-05-26 03:48:24] [INFO ] Applying decomposition
[2024-05-26 03:48:25] [INFO ] Flatten gal took : 118 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/graph18136012284393206241.txt' '-o' '/tmp/graph18136012284393206241.bin' '-w' '/tmp/graph18136012284393206241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18136012284393206241.bin' '-l' '-1' '-v' '-w' '/tmp/graph18136012284393206241.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:48:25] [INFO ] Decomposing Gal with order
[2024-05-26 03:48:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:48:26] [INFO ] Removed a total of 1815 redundant transitions.
[2024-05-26 03:48:26] [INFO ] Flatten gal took : 370 ms
[2024-05-26 03:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 98 ms.
[2024-05-26 03:48:27] [INFO ] Time to serialize gal into /tmp/LTL12761846796107216716.gal : 53 ms
[2024-05-26 03:48:27] [INFO ] Time to serialize properties into /tmp/LTL14781086238814368539.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/LTL12761846796107216716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14781086238814368539.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((i3.i0.i1.u171.p699==0)||(i3.i0.i2.u221.p906==0))")||(F(G("((i6.i0.i6.u397.p1626==0)||(i28.i0.i4.u1472.p6072==0))"))))))))
Formula 0 simplified : XXX(!"((i3.i0.i1.u171.p699==0)||(i3.i0.i2.u221.p906==0))" & GF!"((i6.i0.i6.u397.p1626==0)||(i28.i0.i4.u1472.p6072==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16187911410548744631
[2024-05-26 03:48:42] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16187911410548744631
Running compilation step : cd /tmp/ltsmin16187911410548744631;'/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/ltsmin16187911410548744631;'/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/ltsmin16187911410548744631;'/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 NoC3x3-PT-7B-LTLFireability-01 finished in 105820 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(G(p0)))))'
Support contains 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4236 transition count 5826
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4236 transition count 5826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 4236 transition count 5825
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 4231 transition count 5816
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 4231 transition count 5816
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 4228 transition count 5813
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 4228 transition count 5813
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 4225 transition count 5807
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 4225 transition count 5807
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 4222 transition count 5803
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 4222 transition count 5803
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 4220 transition count 5799
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 4220 transition count 5799
Applied a total of 63 rules in 1942 ms. Remains 4220 /4251 variables (removed 31) and now considering 5799/5849 (removed 50) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2024-05-26 03:48:47] [INFO ] Computed 66 invariants in 19 ms
[2024-05-26 03:48:48] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-26 03:48:48] [INFO ] Invariant cache hit.
[2024-05-26 03:48:48] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2024-05-26 03:48:48] [INFO ] Invariant cache hit.
[2024-05-26 03:48:51] [INFO ] Dead Transitions using invariants and state equation in 2920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4220/4251 places, 5799/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6404 ms. Remains : 4220/4251 places, 5799/5849 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s2670 0)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 458 ms.
Product exploration explored 100000 steps with 32 reset in 637 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423502 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423502 steps, saw 409332 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:48:56] [INFO ] Invariant cache hit.
[2024-05-26 03:48:56] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:48:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:48:59] [INFO ] After 2537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:49:00] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2024-05-26 03:49:00] [INFO ] Deduced a trap composed of 159 places in 120 ms of which 0 ms to minimize.
[2024-05-26 03:49:00] [INFO ] Deduced a trap composed of 138 places in 84 ms of which 0 ms to minimize.
[2024-05-26 03:49:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 958 ms
[2024-05-26 03:49:01] [INFO ] After 3599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-26 03:49:01] [INFO ] After 4252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 742 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=123 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4220/4220 places, 5799/5799 transitions.
Applied a total of 0 rules in 249 ms. Remains 4220 /4220 variables (removed 0) and now considering 5799/5799 (removed 0) transitions.
[2024-05-26 03:49:01] [INFO ] Invariant cache hit.
[2024-05-26 03:49:02] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-26 03:49:02] [INFO ] Invariant cache hit.
[2024-05-26 03:49:03] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2024-05-26 03:49:03] [INFO ] Invariant cache hit.
[2024-05-26 03:49:06] [INFO ] Dead Transitions using invariants and state equation in 3168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4938 ms. Remains : 4220/4220 places, 5799/5799 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 450581 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450581 steps, saw 435524 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:49:09] [INFO ] Invariant cache hit.
[2024-05-26 03:49:10] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:49:10] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2024-05-26 03:49:13] [INFO ] After 2504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:49:13] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2024-05-26 03:49:13] [INFO ] Deduced a trap composed of 159 places in 124 ms of which 1 ms to minimize.
[2024-05-26 03:49:14] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 0 ms to minimize.
[2024-05-26 03:49:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 955 ms
[2024-05-26 03:49:14] [INFO ] After 3565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-26 03:49:14] [INFO ] After 4217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 899 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=149 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37 reset in 544 ms.
Product exploration explored 100000 steps with 37 reset in 618 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4220/4220 places, 5799/5799 transitions.
Graph (trivial) has 5107 edges and 4220 vertex of which 3234 / 4220 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3201 places
Ensure Unique test removed 4317 transitions
Reduce isomorphic transitions removed 4317 transitions.
Discarding 246 places :
Symmetric choice reduction at 0 with 246 rule applications. Total rules 247 place count 773 transition count 1236
Iterating global reduction 0 with 246 rules applied. Total rules applied 493 place count 773 transition count 1236
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 692 place count 574 transition count 893
Iterating global reduction 0 with 199 rules applied. Total rules applied 891 place count 574 transition count 893
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 1090 place count 574 transition count 694
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 1090 place count 574 transition count 742
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 1127 place count 574 transition count 742
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 1153 place count 548 transition count 682
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 1179 place count 548 transition count 682
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 1205 place count 522 transition count 622
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 1231 place count 522 transition count 622
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 1361 place count 522 transition count 622
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1361 rules in 134 ms. Remains 522 /4220 variables (removed 3698) and now considering 622/5799 (removed 5177) transitions.
[2024-05-26 03:49:16] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 03:49:16] [INFO ] Flow matrix only has 590 transitions (discarded 32 similar events)
// Phase 1: matrix 590 rows 522 cols
[2024-05-26 03:49:16] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 03:49:16] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 522/4220 places, 622/5799 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 522/4220 places, 622/5799 transitions.
Built C files in :
/tmp/ltsmin1474795884267357636
[2024-05-26 03:49:17] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1474795884267357636
Running compilation step : cd /tmp/ltsmin1474795884267357636;'/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/ltsmin1474795884267357636;'/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/ltsmin1474795884267357636;'/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 1 out of 4220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4220/4220 places, 5799/5799 transitions.
Applied a total of 0 rules in 283 ms. Remains 4220 /4220 variables (removed 0) and now considering 5799/5799 (removed 0) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2024-05-26 03:49:20] [INFO ] Computed 66 invariants in 19 ms
[2024-05-26 03:49:21] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-26 03:49:21] [INFO ] Invariant cache hit.
[2024-05-26 03:49:22] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
[2024-05-26 03:49:22] [INFO ] Invariant cache hit.
[2024-05-26 03:49:25] [INFO ] Dead Transitions using invariants and state equation in 3105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5547 ms. Remains : 4220/4220 places, 5799/5799 transitions.
Built C files in :
/tmp/ltsmin17865686380144279424
[2024-05-26 03:49:25] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17865686380144279424
Running compilation step : cd /tmp/ltsmin17865686380144279424;'/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/ltsmin17865686380144279424;'/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/ltsmin17865686380144279424;'/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-26 03:49:28] [INFO ] Flatten gal took : 102 ms
[2024-05-26 03:49:29] [INFO ] Flatten gal took : 107 ms
[2024-05-26 03:49:29] [INFO ] Time to serialize gal into /tmp/LTL5428634142107267840.gal : 31 ms
[2024-05-26 03:49:29] [INFO ] Time to serialize properties into /tmp/LTL10404350491144240880.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/LTL5428634142107267840.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5224307637232475468.hoa' '-atoms' '/tmp/LTL10404350491144240880.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/LTL10404350491144240880.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5224307637232475468.hoa
Detected timeout of ITS tools.
[2024-05-26 03:49:44] [INFO ] Flatten gal took : 92 ms
[2024-05-26 03:49:44] [INFO ] Flatten gal took : 98 ms
[2024-05-26 03:49:44] [INFO ] Time to serialize gal into /tmp/LTL13703878666175705590.gal : 17 ms
[2024-05-26 03:49:44] [INFO ] Time to serialize properties into /tmp/LTL6814977828706862059.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/LTL13703878666175705590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6814977828706862059.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(X(G("(p4405==0)"))))))
Formula 0 simplified : XXXF!"(p4405==0)"
Detected timeout of ITS tools.
[2024-05-26 03:49:59] [INFO ] Flatten gal took : 95 ms
[2024-05-26 03:49:59] [INFO ] Applying decomposition
[2024-05-26 03:49:59] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11446282098555560768.txt' '-o' '/tmp/graph11446282098555560768.bin' '-w' '/tmp/graph11446282098555560768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11446282098555560768.bin' '-l' '-1' '-v' '-w' '/tmp/graph11446282098555560768.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:49:59] [INFO ] Decomposing Gal with order
[2024-05-26 03:50:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:50:00] [INFO ] Removed a total of 1841 redundant transitions.
[2024-05-26 03:50:00] [INFO ] Flatten gal took : 179 ms
[2024-05-26 03:50:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 59 ms.
[2024-05-26 03:50:00] [INFO ] Time to serialize gal into /tmp/LTL860748319379569299.gal : 81 ms
[2024-05-26 03:50:00] [INFO ] Time to serialize properties into /tmp/LTL8975448817650527232.ltl : 13 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/LTL860748319379569299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8975448817650527232.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(i21.i1.i1.u1080.p4405==0)"))))))
Formula 0 simplified : XXXF!"(i21.i1.i1.u1080.p4405==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15350383488035321145
[2024-05-26 03:50:16] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15350383488035321145
Running compilation step : cd /tmp/ltsmin15350383488035321145;'/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/ltsmin15350383488035321145;'/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/ltsmin15350383488035321145;'/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 NoC3x3-PT-7B-LTLFireability-02 finished in 93733 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(G(p0))||(p1 U p2))))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4238 transition count 5829
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4238 transition count 5829
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 4238 transition count 5828
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 4234 transition count 5820
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 4234 transition count 5820
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 4232 transition count 5818
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 4230 transition count 5816
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 4230 transition count 5816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 4228 transition count 5814
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 4228 transition count 5814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 4226 transition count 5810
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 4226 transition count 5810
Applied a total of 51 rules in 1710 ms. Remains 4226 /4251 variables (removed 25) and now considering 5810/5849 (removed 39) transitions.
// Phase 1: matrix 5810 rows 4226 cols
[2024-05-26 03:50:20] [INFO ] Computed 66 invariants in 24 ms
[2024-05-26 03:50:21] [INFO ] Implicit Places using invariants in 781 ms returned []
[2024-05-26 03:50:21] [INFO ] Invariant cache hit.
[2024-05-26 03:50:23] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2024-05-26 03:50:23] [INFO ] Invariant cache hit.
[2024-05-26 03:50:26] [INFO ] Dead Transitions using invariants and state equation in 3320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4226/4251 places, 5810/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7285 ms. Remains : 4226/4251 places, 5810/5849 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(EQ s271 1), p1:(AND (EQ s1838 1) (EQ s2142 1)), p0:(EQ s3322 0)], 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]]
Entered a terminal (fully accepting) state of product in 16469 steps with 6 reset in 71 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-04 finished in 7592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p2&&X(p3))||p1)))))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5827
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5826
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 4233 transition count 5819
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 4233 transition count 5819
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 4231 transition count 5817
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 4231 transition count 5817
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 4229 transition count 5812
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 4229 transition count 5812
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 4227 transition count 5809
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 4227 transition count 5809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 4226 transition count 5807
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 4226 transition count 5807
Applied a total of 51 rules in 1695 ms. Remains 4226 /4251 variables (removed 25) and now considering 5807/5849 (removed 42) transitions.
// Phase 1: matrix 5807 rows 4226 cols
[2024-05-26 03:50:28] [INFO ] Computed 66 invariants in 22 ms
[2024-05-26 03:50:29] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-05-26 03:50:29] [INFO ] Invariant cache hit.
[2024-05-26 03:50:30] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
[2024-05-26 03:50:30] [INFO ] Invariant cache hit.
[2024-05-26 03:50:33] [INFO ] Dead Transitions using invariants and state equation in 3182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4226/4251 places, 5807/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7206 ms. Remains : 4226/4251 places, 5807/5849 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1385 1) (EQ s1628 1)), p1:(OR (EQ s156 1) (EQ s1628 1)), p2:(NEQ s1385 1), p3:(NEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24879 reset in 1617 ms.
Product exploration explored 100000 steps with 24996 reset in 1608 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 154 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 111834 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111834 steps, saw 108142 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-26 03:50:41] [INFO ] Invariant cache hit.
[2024-05-26 03:50:42] [INFO ] [Real]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-05-26 03:50:45] [INFO ] After 2688ms SMT Verify possible using state equation in real domain returned unsat :8 sat :1 real:5
[2024-05-26 03:50:45] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 0 ms to minimize.
[2024-05-26 03:50:46] [INFO ] Deduced a trap composed of 159 places in 172 ms of which 1 ms to minimize.
[2024-05-26 03:50:46] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 0 ms to minimize.
[2024-05-26 03:50:46] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 0 ms to minimize.
[2024-05-26 03:50:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1474 ms
[2024-05-26 03:50:47] [INFO ] After 4280ms SMT Verify possible using trap constraints in real domain returned unsat :8 sat :0 real:6
[2024-05-26 03:50:47] [INFO ] After 5255ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:6
[2024-05-26 03:50:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-05-26 03:50:51] [INFO ] After 3415ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :6
[2024-05-26 03:50:51] [INFO ] Deduced a trap composed of 162 places in 84 ms of which 1 ms to minimize.
[2024-05-26 03:50:52] [INFO ] Deduced a trap composed of 177 places in 102 ms of which 0 ms to minimize.
[2024-05-26 03:50:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2024-05-26 03:50:53] [INFO ] After 5521ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :6
Attempting to minimize the solution found.
Minimization took 882 ms.
[2024-05-26 03:50:54] [INFO ] After 7484ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :6
Fused 14 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 165 ms.
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Graph (trivial) has 5108 edges and 4226 vertex of which 3231 / 4226 are part of one of the 33 SCC in 1 ms
Free SCC test removed 3198 places
Drop transitions removed 4183 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 4345 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1028 transition count 1459
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 5 rules applied. Total rules applied 9 place count 1025 transition count 1457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1024 transition count 1457
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 10 place count 1024 transition count 1420
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 84 place count 987 transition count 1420
Discarding 273 places :
Symmetric choice reduction at 3 with 273 rule applications. Total rules 357 place count 714 transition count 1011
Iterating global reduction 3 with 273 rules applied. Total rules applied 630 place count 714 transition count 1011
Discarding 199 places :
Symmetric choice reduction at 3 with 199 rule applications. Total rules 829 place count 515 transition count 770
Iterating global reduction 3 with 199 rules applied. Total rules applied 1028 place count 515 transition count 770
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 3 with 199 rules applied. Total rules applied 1227 place count 515 transition count 571
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 1489 place count 384 transition count 440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1490 place count 383 transition count 439
Iterating global reduction 4 with 1 rules applied. Total rules applied 1491 place count 383 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 382 transition count 450
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1494 place count 382 transition count 449
Free-agglomeration rule applied 204 times.
Iterating global reduction 4 with 204 rules applied. Total rules applied 1698 place count 382 transition count 245
Reduce places removed 204 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 470 edges and 178 vertex of which 16 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.1 ms
Discarding 162 places :
Also discarding 165 output transitions
Drop transitions removed 165 transitions
Iterating post reduction 4 with 243 rules applied. Total rules applied 1941 place count 16 transition count 42
Drop transitions removed 24 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1968 place count 16 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1969 place count 15 transition count 14
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 5 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 4 rules applied. Total rules applied 1973 place count 9 transition count 14
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1978 place count 9 transition count 9
Applied a total of 1978 rules in 110 ms. Remains 9 /4226 variables (removed 4217) and now considering 9/5807 (removed 5798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 9/4226 places, 9/5807 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 28 factoid took 375 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Applied a total of 0 rules in 244 ms. Remains 4226 /4226 variables (removed 0) and now considering 5807/5807 (removed 0) transitions.
[2024-05-26 03:50:55] [INFO ] Invariant cache hit.
[2024-05-26 03:50:56] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-26 03:50:56] [INFO ] Invariant cache hit.
[2024-05-26 03:50:57] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-26 03:50:57] [INFO ] Invariant cache hit.
[2024-05-26 03:51:00] [INFO ] Dead Transitions using invariants and state equation in 3194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5061 ms. Remains : 4226/4226 places, 5807/5807 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 107 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 133522 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133522 steps, saw 129053 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-26 03:51:04] [INFO ] Invariant cache hit.
[2024-05-26 03:51:05] [INFO ] [Real]Absence check using 66 positive place invariants in 50 ms returned sat
[2024-05-26 03:51:07] [INFO ] After 3424ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-26 03:51:08] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-05-26 03:51:12] [INFO ] After 3183ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-26 03:51:12] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 0 ms to minimize.
[2024-05-26 03:51:12] [INFO ] Deduced a trap composed of 155 places in 138 ms of which 0 ms to minimize.
[2024-05-26 03:51:12] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 1 ms to minimize.
[2024-05-26 03:51:13] [INFO ] Deduced a trap composed of 177 places in 91 ms of which 0 ms to minimize.
[2024-05-26 03:51:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1267 ms
[2024-05-26 03:51:14] [INFO ] After 5652ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 746 ms.
[2024-05-26 03:51:15] [INFO ] After 7344ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 712 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=59 )
Parikh walk visited 4 properties in 77 ms.
Support contains 1 out of 4226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Graph (trivial) has 5114 edges and 4226 vertex of which 3239 / 4226 are part of one of the 33 SCC in 3 ms
Free SCC test removed 3206 places
Drop transitions removed 4196 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 4356 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 1020 transition count 1414
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 75 place count 983 transition count 1414
Discarding 273 places :
Symmetric choice reduction at 0 with 273 rule applications. Total rules 348 place count 710 transition count 1005
Iterating global reduction 0 with 273 rules applied. Total rules applied 621 place count 710 transition count 1005
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 821 place count 510 transition count 763
Iterating global reduction 0 with 200 rules applied. Total rules applied 1021 place count 510 transition count 763
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 1221 place count 510 transition count 563
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 1 with 260 rules applied. Total rules applied 1481 place count 380 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1483 place count 379 transition count 444
Free-agglomeration rule applied 204 times.
Iterating global reduction 1 with 204 rules applied. Total rules applied 1687 place count 379 transition count 240
Reduce places removed 204 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 463 edges and 175 vertex of which 3 are kept as prefixes of interest. Removing 172 places using SCC suffix rule.0 ms
Discarding 172 places :
Also discarding 193 output transitions
Drop transitions removed 193 transitions
Iterating post reduction 1 with 243 rules applied. Total rules applied 1930 place count 3 transition count 9
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1936 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1937 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1938 place count 2 transition count 2
Iterating global reduction 3 with 1 rules applied. Total rules applied 1939 place count 2 transition count 2
Applied a total of 1939 rules in 99 ms. Remains 2 /4226 variables (removed 4224) and now considering 2/5807 (removed 5805) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2/4226 places, 2/5807 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p3)), (F p0), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 252 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Product exploration explored 100000 steps with 24987 reset in 1650 ms.
Product exploration explored 100000 steps with 24998 reset in 1624 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p3)]
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Graph (trivial) has 5108 edges and 4226 vertex of which 3231 / 4226 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3198 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1028 transition count 1495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1028 transition count 1494
Discarding 249 places :
Symmetric choice reduction at 2 with 249 rule applications. Total rules 255 place count 779 transition count 1245
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 2 with 249 rules applied. Total rules applied 504 place count 779 transition count 1245
Discarding 199 places :
Symmetric choice reduction at 2 with 199 rule applications. Total rules 703 place count 580 transition count 902
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 2 with 199 rules applied. Total rules applied 902 place count 580 transition count 902
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 2 with 199 rules applied. Total rules applied 1101 place count 580 transition count 703
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1101 place count 580 transition count 751
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 1138 place count 580 transition count 751
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1164 place count 554 transition count 691
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1190 place count 554 transition count 691
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1216 place count 528 transition count 631
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1242 place count 528 transition count 631
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 3 with 131 rules applied. Total rules applied 1373 place count 528 transition count 631
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1376 place count 525 transition count 628
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1379 place count 525 transition count 628
Deduced a syphon composed of 142 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1380 place count 525 transition count 627
Deduced a syphon composed of 142 places in 0 ms
Applied a total of 1380 rules in 153 ms. Remains 525 /4226 variables (removed 3701) and now considering 627/5807 (removed 5180) transitions.
[2024-05-26 03:51:19] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 03:51:19] [INFO ] Flow matrix only has 595 transitions (discarded 32 similar events)
// Phase 1: matrix 595 rows 525 cols
[2024-05-26 03:51:20] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 03:51:20] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/4226 places, 627/5807 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 525/4226 places, 627/5807 transitions.
Built C files in :
/tmp/ltsmin2142479315397031487
[2024-05-26 03:51:20] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2142479315397031487
Running compilation step : cd /tmp/ltsmin2142479315397031487;'/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/ltsmin2142479315397031487;'/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/ltsmin2142479315397031487;'/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 4226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Applied a total of 0 rules in 252 ms. Remains 4226 /4226 variables (removed 0) and now considering 5807/5807 (removed 0) transitions.
// Phase 1: matrix 5807 rows 4226 cols
[2024-05-26 03:51:23] [INFO ] Computed 66 invariants in 30 ms
[2024-05-26 03:51:24] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-05-26 03:51:24] [INFO ] Invariant cache hit.
[2024-05-26 03:51:25] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2024-05-26 03:51:25] [INFO ] Invariant cache hit.
[2024-05-26 03:51:28] [INFO ] Dead Transitions using invariants and state equation in 3016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5503 ms. Remains : 4226/4226 places, 5807/5807 transitions.
Built C files in :
/tmp/ltsmin12655933173289517721
[2024-05-26 03:51:28] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12655933173289517721
Running compilation step : cd /tmp/ltsmin12655933173289517721;'/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/ltsmin12655933173289517721;'/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/ltsmin12655933173289517721;'/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-26 03:51:32] [INFO ] Flatten gal took : 89 ms
[2024-05-26 03:51:32] [INFO ] Flatten gal took : 93 ms
[2024-05-26 03:51:32] [INFO ] Time to serialize gal into /tmp/LTL14484520158830551822.gal : 15 ms
[2024-05-26 03:51:32] [INFO ] Time to serialize properties into /tmp/LTL9682459173902232946.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/LTL14484520158830551822.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1799229183023259680.hoa' '-atoms' '/tmp/LTL9682459173902232946.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/LTL9682459173902232946.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1799229183023259680.hoa
Detected timeout of ITS tools.
[2024-05-26 03:51:47] [INFO ] Flatten gal took : 85 ms
[2024-05-26 03:51:47] [INFO ] Flatten gal took : 88 ms
[2024-05-26 03:51:47] [INFO ] Time to serialize gal into /tmp/LTL16197567700658504724.gal : 16 ms
[2024-05-26 03:51:47] [INFO ] Time to serialize properties into /tmp/LTL9835356327426456091.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/LTL16197567700658504724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9835356327426456091.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 : !((G(("((p2279==1)&&(p2681==1))")U(X(("((p230==1)||(p2681==1))")||(("(p2279!=1)")&&(X("(p230!=1)"))))))))
Formula 0 simplified : F(!"((p2279==1)&&(p2681==1))" R X(!"((p230==1)||(p2681==1))" & (!"(p2279!=1)" | X!"(p230!=1)")))
Detected timeout of ITS tools.
[2024-05-26 03:52:02] [INFO ] Flatten gal took : 87 ms
[2024-05-26 03:52:02] [INFO ] Applying decomposition
[2024-05-26 03:52:02] [INFO ] Flatten gal took : 106 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/graph14673233694017090966.txt' '-o' '/tmp/graph14673233694017090966.bin' '-w' '/tmp/graph14673233694017090966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14673233694017090966.bin' '-l' '-1' '-v' '-w' '/tmp/graph14673233694017090966.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:52:02] [INFO ] Decomposing Gal with order
[2024-05-26 03:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:52:03] [INFO ] Removed a total of 1801 redundant transitions.
[2024-05-26 03:52:03] [INFO ] Flatten gal took : 168 ms
[2024-05-26 03:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 15 ms.
[2024-05-26 03:52:03] [INFO ] Time to serialize gal into /tmp/LTL13965441831304707716.gal : 32 ms
[2024-05-26 03:52:03] [INFO ] Time to serialize properties into /tmp/LTL3568892681802304812.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/LTL13965441831304707716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3568892681802304812.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 : !((G(("((i10.u547.p2279==1)&&(i12.u656.p2681==1))")U(X(("((i0.u62.p230==1)||(i12.u656.p2681==1))")||(("(i10.u547.p2279!=1)")&&(X("(i0....176
Formula 0 simplified : F(!"((i10.u547.p2279==1)&&(i12.u656.p2681==1))" R X(!"((i0.u62.p230==1)||(i12.u656.p2681==1))" & (!"(i10.u547.p2279!=1)" | X!"(i0.u6...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5708189880938488792
[2024-05-26 03:52:18] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5708189880938488792
Running compilation step : cd /tmp/ltsmin5708189880938488792;'/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/ltsmin5708189880938488792;'/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/ltsmin5708189880938488792;'/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 NoC3x3-PT-7B-LTLFireability-06 finished in 115283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5827
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5826
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5817
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5817
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5814
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5808
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5804
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5800
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5800
Applied a total of 61 rules in 1715 ms. Remains 4221 /4251 variables (removed 30) and now considering 5800/5849 (removed 49) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2024-05-26 03:52:23] [INFO ] Computed 66 invariants in 22 ms
[2024-05-26 03:52:24] [INFO ] Implicit Places using invariants in 779 ms returned []
[2024-05-26 03:52:24] [INFO ] Invariant cache hit.
[2024-05-26 03:52:25] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-26 03:52:25] [INFO ] Invariant cache hit.
[2024-05-26 03:52:28] [INFO ] Dead Transitions using invariants and state equation in 3163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5800/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6433 ms. Remains : 4221/4251 places, 5800/5849 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s950 0) (EQ s1276 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2004 ms.
Product exploration explored 100000 steps with 33333 reset in 2009 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-07 finished in 10668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1||X(p1))) U p1))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5831
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5831
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5830
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 4233 transition count 5823
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 4233 transition count 5823
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 4230 transition count 5820
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 4230 transition count 5820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4227 transition count 5814
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4227 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4224 transition count 5810
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4224 transition count 5810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 4222 transition count 5806
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 4222 transition count 5806
Applied a total of 59 rules in 1709 ms. Remains 4222 /4251 variables (removed 29) and now considering 5806/5849 (removed 43) transitions.
// Phase 1: matrix 5806 rows 4222 cols
[2024-05-26 03:52:34] [INFO ] Computed 66 invariants in 22 ms
[2024-05-26 03:52:35] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-26 03:52:35] [INFO ] Invariant cache hit.
[2024-05-26 03:52:36] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2024-05-26 03:52:36] [INFO ] Invariant cache hit.
[2024-05-26 03:52:39] [INFO ] Dead Transitions using invariants and state equation in 2999 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4251 places, 5806/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6978 ms. Remains : 4222/4251 places, 5806/5849 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s432 1) (EQ s609 1)), p0:(EQ s2062 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-08 finished in 7176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p0||X(((p0 U p1) U (p0&&(p0 U p1))))))))'
Support contains 2 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5828
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5801
Applied a total of 61 rules in 1700 ms. Remains 4221 /4251 variables (removed 30) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 03:52:41] [INFO ] Computed 66 invariants in 33 ms
[2024-05-26 03:52:42] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-26 03:52:42] [INFO ] Invariant cache hit.
[2024-05-26 03:52:43] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2024-05-26 03:52:43] [INFO ] Invariant cache hit.
[2024-05-26 03:52:46] [INFO ] Dead Transitions using invariants and state equation in 3057 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6981 ms. Remains : 4221/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s4183 1), p1:(EQ s487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-09 finished in 7154 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 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5146 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 1498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1024 transition count 1498
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1024 transition count 1462
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 988 transition count 1462
Discarding 276 places :
Symmetric choice reduction at 2 with 276 rule applications. Total rules 351 place count 712 transition count 1052
Iterating global reduction 2 with 276 rules applied. Total rules applied 627 place count 712 transition count 1052
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 629 place count 712 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 629 place count 712 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 711 transition count 1049
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 833 place count 509 transition count 796
Iterating global reduction 3 with 202 rules applied. Total rules applied 1035 place count 509 transition count 796
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1236 place count 509 transition count 595
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1494 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1495 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1505 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1553 place count 346 transition count 417
Applied a total of 1553 rules in 90 ms. Remains 346 /4251 variables (removed 3905) and now considering 417/5849 (removed 5432) transitions.
[2024-05-26 03:52:47] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2024-05-26 03:52:47] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:52:47] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-26 03:52:47] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 03:52:47] [INFO ] Invariant cache hit.
[2024-05-26 03:52:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:52:47] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-26 03:52:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 03:52:47] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 03:52:47] [INFO ] Invariant cache hit.
[2024-05-26 03:52:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/4251 places, 417/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 346/4251 places, 417/5849 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s23 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-10 finished in 695 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 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5144 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 1025 transition count 1463
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 989 transition count 1463
Discarding 275 places :
Symmetric choice reduction at 0 with 275 rule applications. Total rules 348 place count 714 transition count 1054
Iterating global reduction 0 with 275 rules applied. Total rules applied 623 place count 714 transition count 1054
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 625 place count 714 transition count 1052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 625 place count 714 transition count 1051
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 627 place count 713 transition count 1051
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 828 place count 512 transition count 799
Iterating global reduction 1 with 201 rules applied. Total rules applied 1029 place count 512 transition count 799
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 1229 place count 512 transition count 599
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 1487 place count 383 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1488 place count 382 transition count 469
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 373 vertex of which 48 / 373 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 1498 place count 349 transition count 469
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1546 place count 349 transition count 421
Applied a total of 1546 rules in 85 ms. Remains 349 /4251 variables (removed 3902) and now considering 421/5849 (removed 5428) transitions.
[2024-05-26 03:52:47] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2024-05-26 03:52:47] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:52:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-26 03:52:47] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
[2024-05-26 03:52:47] [INFO ] Invariant cache hit.
[2024-05-26 03:52:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:52:48] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-26 03:52:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 03:52:48] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
[2024-05-26 03:52:48] [INFO ] Invariant cache hit.
[2024-05-26 03:52:48] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/4251 places, 421/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 349/4251 places, 421/5849 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s164 1) (EQ s315 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-11 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(G(p2)))))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5141 edges and 4251 vertex of which 3156 / 4251 are part of one of the 32 SCC in 3 ms
Free SCC test removed 3124 places
Ensure Unique test removed 4213 transitions
Reduce isomorphic transitions removed 4213 transitions.
Reduce places removed 1 places and 1 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 0 with 26 rules applied. Total rules applied 27 place count 1126 transition count 1609
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 40 rules applied. Total rules applied 67 place count 1100 transition count 1595
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 77 place count 1091 transition count 1594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 1090 transition count 1594
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 78 place count 1090 transition count 1536
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 194 place count 1032 transition count 1536
Discarding 266 places :
Symmetric choice reduction at 4 with 266 rule applications. Total rules 460 place count 766 transition count 1136
Iterating global reduction 4 with 266 rules applied. Total rules applied 726 place count 766 transition count 1136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 728 place count 766 transition count 1134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 728 place count 766 transition count 1133
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 730 place count 765 transition count 1133
Discarding 194 places :
Symmetric choice reduction at 5 with 194 rule applications. Total rules 924 place count 571 transition count 891
Iterating global reduction 5 with 194 rules applied. Total rules applied 1118 place count 571 transition count 891
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Iterating post reduction 5 with 193 rules applied. Total rules applied 1311 place count 571 transition count 698
Performed 159 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 6 with 318 rules applied. Total rules applied 1629 place count 412 transition count 534
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1631 place count 412 transition count 532
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 7 with 4 rules applied. Total rules applied 1635 place count 410 transition count 530
Performed 13 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1661 place count 397 transition count 615
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1688 place count 397 transition count 588
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 8 with 66 rules applied. Total rules applied 1754 place count 397 transition count 522
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1754 place count 397 transition count 521
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1756 place count 396 transition count 521
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1764 place count 392 transition count 552
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1770 place count 392 transition count 546
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1785 place count 392 transition count 531
Applied a total of 1785 rules in 139 ms. Remains 392 /4251 variables (removed 3859) and now considering 531/5849 (removed 5318) transitions.
[2024-05-26 03:52:48] [INFO ] Flow matrix only has 500 transitions (discarded 31 similar events)
// Phase 1: matrix 500 rows 392 cols
[2024-05-26 03:52:48] [INFO ] Computed 66 invariants in 1 ms
[2024-05-26 03:52:48] [INFO ] Implicit Places using invariants in 218 ms returned [10, 45, 86, 125, 180, 251, 292, 329, 372]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 220 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/4251 places, 531/5849 transitions.
Graph (trivial) has 269 edges and 383 vertex of which 46 / 383 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 359 transition count 484
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 359 transition count 482
Applied a total of 5 rules in 23 ms. Remains 359 /383 variables (removed 24) and now considering 482/531 (removed 49) transitions.
[2024-05-26 03:52:48] [INFO ] Flow matrix only has 451 transitions (discarded 31 similar events)
// Phase 1: matrix 451 rows 359 cols
[2024-05-26 03:52:48] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:52:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-26 03:52:48] [INFO ] Flow matrix only has 451 transitions (discarded 31 similar events)
[2024-05-26 03:52:48] [INFO ] Invariant cache hit.
[2024-05-26 03:52:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 03:52:49] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 359/4251 places, 482/5849 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 819 ms. Remains : 359/4251 places, 482/5849 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s24 1), p1:(EQ s96 1), p2:(EQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-13 finished in 950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4238 transition count 5828
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4238 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 4238 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 4233 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 4233 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 4230 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 4230 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4227 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4227 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4224 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4224 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 4222 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 4222 transition count 5801
Applied a total of 59 rules in 1705 ms. Remains 4222 /4251 variables (removed 29) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2024-05-26 03:52:51] [INFO ] Computed 66 invariants in 22 ms
[2024-05-26 03:52:51] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-26 03:52:51] [INFO ] Invariant cache hit.
[2024-05-26 03:52:53] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
[2024-05-26 03:52:53] [INFO ] Invariant cache hit.
[2024-05-26 03:52:56] [INFO ] Dead Transitions using invariants and state equation in 3096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6998 ms. Remains : 4222/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s465 1), p0:(AND (OR (EQ s2716 1) (EQ s2316 1)) (EQ s434 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2104 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-15 finished in 7135 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((F(G(p1))||p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : NoC3x3-PT-7B-LTLFireability-02
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5147 edges and 4251 vertex of which 3259 / 4251 are part of one of the 33 SCC in 3 ms
Free SCC test removed 3226 places
Ensure Unique test removed 4351 transitions
Reduce isomorphic transitions removed 4351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1024 transition count 1496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1023 transition count 1496
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1023 transition count 1460
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 987 transition count 1460
Discarding 275 places :
Symmetric choice reduction at 2 with 275 rule applications. Total rules 350 place count 712 transition count 1051
Iterating global reduction 2 with 275 rules applied. Total rules applied 625 place count 712 transition count 1051
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 627 place count 712 transition count 1049
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 627 place count 712 transition count 1048
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 629 place count 711 transition count 1048
Discarding 201 places :
Symmetric choice reduction at 3 with 201 rule applications. Total rules 830 place count 510 transition count 796
Iterating global reduction 3 with 201 rules applied. Total rules applied 1031 place count 510 transition count 796
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 3 with 200 rules applied. Total rules applied 1231 place count 510 transition count 596
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1489 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1490 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1500 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1548 place count 347 transition count 418
Applied a total of 1548 rules in 93 ms. Remains 347 /4251 variables (removed 3904) and now considering 418/5849 (removed 5431) transitions.
[2024-05-26 03:52:56] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2024-05-26 03:52:56] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:52:57] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-26 03:52:57] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 03:52:57] [INFO ] Invariant cache hit.
[2024-05-26 03:52:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:52:57] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-26 03:52:57] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 03:52:57] [INFO ] Invariant cache hit.
[2024-05-26 03:52:57] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 347/4251 places, 418/5849 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 646 ms. Remains : 347/4251 places, 418/5849 transitions.
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s229 0)], 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 232 steps with 3 reset in 4 ms.
Treatment of property NoC3x3-PT-7B-LTLFireability-02 finished in 881 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p2&&X(p3))||p1)))))'
[2024-05-26 03:52:57] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin209965843936119727
[2024-05-26 03:52:57] [INFO ] Too many transitions (5849) to apply POR reductions. Disabling POR matrices.
[2024-05-26 03:52:57] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin209965843936119727
Running compilation step : cd /tmp/ltsmin209965843936119727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 03:52:57] [INFO ] Applying decomposition
[2024-05-26 03:52:57] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9355212407527130060.txt' '-o' '/tmp/graph9355212407527130060.bin' '-w' '/tmp/graph9355212407527130060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9355212407527130060.bin' '-l' '-1' '-v' '-w' '/tmp/graph9355212407527130060.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:52:58] [INFO ] Decomposing Gal with order
[2024-05-26 03:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:52:58] [INFO ] Removed a total of 1827 redundant transitions.
[2024-05-26 03:52:58] [INFO ] Flatten gal took : 200 ms
[2024-05-26 03:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 89 ms.
[2024-05-26 03:52:59] [INFO ] Time to serialize gal into /tmp/LTLFireability118700350675742830.gal : 60 ms
[2024-05-26 03:52:59] [INFO ] Time to serialize properties into /tmp/LTLFireability261075670972698810.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/LTLFireability118700350675742830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability261075670972698810.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...274
Read 2 LTL properties
Checking formula 0 : !((X(X(X(("((i4.u175.p699==0)||(i4.u226.p906==0))")||(F(G("((i7.u402.p1626==0)||(i29.u1476.p6072==0))"))))))))
Formula 0 simplified : XXX(!"((i4.u175.p699==0)||(i4.u226.p906==0))" & GF!"((i7.u402.p1626==0)||(i29.u1476.p6072==0))")
Compilation finished in 20471 ms.
Running link step : cd /tmp/ltsmin209965843936119727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin209965843936119727;'/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((<>([]((LTLAPp1==true)))||(LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 5019 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin209965843936119727;'/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' '[](((LTLAPp3==true) U X((((LTLAPp5==true)&&X((LTLAPp6==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 04:15:11] [INFO ] Applying decomposition
[2024-05-26 04:15:12] [INFO ] Flatten gal took : 599 ms
[2024-05-26 04:15:12] [INFO ] Decomposing Gal with order
[2024-05-26 04:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 04:15:14] [INFO ] Removed a total of 604 redundant transitions.
[2024-05-26 04:15:14] [INFO ] Flatten gal took : 648 ms
[2024-05-26 04:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1289 labels/synchronizations in 848 ms.
[2024-05-26 04:15:16] [INFO ] Time to serialize gal into /tmp/LTLFireability10848296338205639401.gal : 50 ms
[2024-05-26 04:15:16] [INFO ] Time to serialize properties into /tmp/LTLFireability9601004806963872457.ltl : 11 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/LTLFireability10848296338205639401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9601004806963872457.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...277
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u8...1002
Formula 0 simplified : F(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u89...995
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin209965843936119727;'/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' '[](((LTLAPp3==true) U X((((LTLAPp5==true)&&X((LTLAPp6==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin209965843936119727;'/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' '[](((LTLAPp3==true) U X((((LTLAPp5==true)&&X((LTLAPp6==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 04:37:31] [INFO ] Flatten gal took : 806 ms
[2024-05-26 04:37:37] [INFO ] Input system was already deterministic with 5849 transitions.
[2024-05-26 04:37:37] [INFO ] Transformed 4251 places.
[2024-05-26 04:37:38] [INFO ] Transformed 5849 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 04:37:42] [INFO ] Time to serialize gal into /tmp/LTLFireability3327004213011969980.gal : 62 ms
[2024-05-26 04:37:42] [INFO ] Time to serialize properties into /tmp/LTLFireability12476074919823404374.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/LTLFireability3327004213011969980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12476074919823404374.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((p2279==1)&&(p2681==1))")U(X(("((p230==1)||(p2681==1))")||(("(p2279!=1)")&&(X("(p230!=1)"))))))))
Formula 0 simplified : F(!"((p2279==1)&&(p2681==1))" R X(!"((p230==1)||(p2681==1))" & (!"(p2279!=1)" | X!"(p230!=1)")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9907244 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15588960 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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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-171654372800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B 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 ;