About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S24C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12065.823 | 3600000.00 | 5885000.00 | 29390.80 | ????FFFFF??F??FF | 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-171654372000058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S24C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716638763593
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:06:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 12:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:06:05] [INFO ] Load time of PNML (sax parser for PT used): 464 ms
[2024-05-25 12:06:05] [INFO ] Transformed 12464 places.
[2024-05-25 12:06:05] [INFO ] Transformed 18463 transitions.
[2024-05-25 12:06:05] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 63 out of 12464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 12424 transition count 18463
Discarding 3583 places :
Symmetric choice reduction at 1 with 3583 rule applications. Total rules 3623 place count 8841 transition count 14880
Iterating global reduction 1 with 3583 rules applied. Total rules applied 7206 place count 8841 transition count 14880
Discarding 3286 places :
Symmetric choice reduction at 1 with 3286 rule applications. Total rules 10492 place count 5555 transition count 11594
Iterating global reduction 1 with 3286 rules applied. Total rules applied 13778 place count 5555 transition count 11594
Discarding 530 places :
Symmetric choice reduction at 1 with 530 rule applications. Total rules 14308 place count 5025 transition count 8414
Iterating global reduction 1 with 530 rules applied. Total rules applied 14838 place count 5025 transition count 8414
Applied a total of 14838 rules in 3386 ms. Remains 5025 /12464 variables (removed 7439) and now considering 8414/18463 (removed 10049) transitions.
[2024-05-25 12:06:09] [INFO ] Flow matrix only has 7814 transitions (discarded 600 similar events)
// Phase 1: matrix 7814 rows 5025 cols
[2024-05-25 12:06:09] [INFO ] Computed 989 invariants in 463 ms
[2024-05-25 12:06:13] [INFO ] Implicit Places using invariants in 4127 ms returned []
[2024-05-25 12:06:13] [INFO ] Flow matrix only has 7814 transitions (discarded 600 similar events)
[2024-05-25 12:06:13] [INFO ] Invariant cache hit.
[2024-05-25 12:06:17] [INFO ] Implicit Places using invariants and state equation in 3604 ms returned []
Implicit Place search using SMT with State Equation took 7761 ms to find 0 implicit places.
[2024-05-25 12:06:17] [INFO ] Flow matrix only has 7814 transitions (discarded 600 similar events)
[2024-05-25 12:06:17] [INFO ] Invariant cache hit.
[2024-05-25 12:06:22] [INFO ] Dead Transitions using invariants and state equation in 5161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5025/12464 places, 8414/18463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16314 ms. Remains : 5025/12464 places, 8414/18463 transitions.
Support contains 63 out of 5025 places after structural reductions.
[2024-05-25 12:06:23] [INFO ] Flatten gal took : 475 ms
[2024-05-25 12:06:23] [INFO ] Flatten gal took : 290 ms
[2024-05-25 12:06:23] [INFO ] Input system was already deterministic with 8414 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2024-05-25 12:06:24] [INFO ] Flow matrix only has 7814 transitions (discarded 600 similar events)
[2024-05-25 12:06:24] [INFO ] Invariant cache hit.
[2024-05-25 12:06:27] [INFO ] [Real]Absence check using 47 positive place invariants in 64 ms returned sat
[2024-05-25 12:06:27] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 319 ms returned sat
[2024-05-25 12:06:40] [INFO ] After 11252ms SMT Verify possible using state equation in real domain returned unsat :3 sat :5 real:19
[2024-05-25 12:06:40] [INFO ] State equation strengthened by 2952 read => feed constraints.
[2024-05-25 12:06:42] [INFO ] After 1798ms SMT Verify possible using 2952 Read/Feed constraints in real domain returned unsat :3 sat :0 real:24
[2024-05-25 12:06:42] [INFO ] After 17674ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:24
[2024-05-25 12:06:44] [INFO ] [Nat]Absence check using 47 positive place invariants in 63 ms returned sat
[2024-05-25 12:06:44] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 298 ms returned sat
[2024-05-25 12:06:57] [INFO ] After 11229ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :24
[2024-05-25 12:07:07] [INFO ] After 9700ms SMT Verify possible using 2952 Read/Feed constraints in natural domain returned unsat :3 sat :23
[2024-05-25 12:07:07] [INFO ] After 9702ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :23
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 12:07:07] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :23
Fused 27 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 42 out of 5025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5025 transition count 8412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5023 transition count 8412
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 306 Pre rules applied. Total rules applied 4 place count 5023 transition count 8106
Deduced a syphon composed of 306 places in 16 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 2 with 612 rules applied. Total rules applied 616 place count 4717 transition count 8106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 621 place count 4712 transition count 8086
Iterating global reduction 2 with 5 rules applied. Total rules applied 626 place count 4712 transition count 8086
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 628 place count 4710 transition count 8074
Iterating global reduction 2 with 2 rules applied. Total rules applied 630 place count 4710 transition count 8074
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 686 place count 4682 transition count 8046
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 688 place count 4680 transition count 8044
Iterating global reduction 2 with 2 rules applied. Total rules applied 690 place count 4680 transition count 8044
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 690 place count 4680 transition count 8043
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 692 place count 4679 transition count 8043
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 694 place count 4677 transition count 8031
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 4677 transition count 8031
Free-agglomeration rule (complex) applied 321 times.
Iterating global reduction 2 with 321 rules applied. Total rules applied 1017 place count 4677 transition count 10345
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 2 with 321 rules applied. Total rules applied 1338 place count 4356 transition count 10345
Partial Free-agglomeration rule applied 143 times.
Drop transitions removed 143 transitions
Iterating global reduction 3 with 143 rules applied. Total rules applied 1481 place count 4356 transition count 10345
Applied a total of 1481 rules in 4300 ms. Remains 4356 /5025 variables (removed 669) and now considering 10345/8414 (removed -1931) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4303 ms. Remains : 4356/5025 places, 10345/8414 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-25 12:07:12] [INFO ] Flow matrix only has 9483 transitions (discarded 862 similar events)
// Phase 1: matrix 9483 rows 4356 cols
[2024-05-25 12:07:13] [INFO ] Computed 989 invariants in 261 ms
[2024-05-25 12:07:14] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:07:14] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 271 ms returned sat
[2024-05-25 12:07:16] [INFO ] After 3138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-25 12:07:17] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:07:17] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 272 ms returned sat
[2024-05-25 12:07:30] [INFO ] After 11052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-25 12:07:30] [INFO ] State equation strengthened by 5552 read => feed constraints.
[2024-05-25 12:07:41] [INFO ] After 10931ms SMT Verify possible using 5552 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-25 12:07:41] [INFO ] After 10933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 12:07:41] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 32 out of 4356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4356/4356 places, 10345/10345 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 4356 transition count 10342
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 4353 transition count 10342
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4350 transition count 10339
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4350 transition count 10339
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 4350 transition count 10337
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4348 transition count 10337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4347 transition count 10336
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 42 place count 4347 transition count 10362
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 66 place count 4323 transition count 10362
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 4323 transition count 10362
Applied a total of 67 rules in 2191 ms. Remains 4323 /4356 variables (removed 33) and now considering 10362/10345 (removed -17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2191 ms. Remains : 4323/4356 places, 10362/10345 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-25 12:07:44] [INFO ] Flow matrix only has 9478 transitions (discarded 884 similar events)
// Phase 1: matrix 9478 rows 4323 cols
[2024-05-25 12:07:44] [INFO ] Computed 989 invariants in 305 ms
[2024-05-25 12:07:46] [INFO ] [Real]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 12:07:46] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 291 ms returned sat
[2024-05-25 12:07:57] [INFO ] After 10172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:10
[2024-05-25 12:07:57] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:08:00] [INFO ] After 3251ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-25 12:08:00] [INFO ] After 16181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-25 12:08:02] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 12:08:02] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 263 ms returned sat
[2024-05-25 12:08:11] [INFO ] After 8327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-25 12:08:25] [INFO ] After 14183ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-25 12:08:25] [INFO ] After 14184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 12:08:25] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 28 out of 4323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4323/4323 places, 10362/10362 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4323 transition count 10360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4321 transition count 10360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 4321 transition count 10359
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4320 transition count 10359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 4319 transition count 10358
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 4319 transition count 10358
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4319 transition count 10356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 4317 transition count 10356
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 4315 transition count 10354
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 4315 transition count 10354
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 4315 transition count 10354
Applied a total of 17 rules in 2066 ms. Remains 4315 /4323 variables (removed 8) and now considering 10354/10362 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2066 ms. Remains : 4315/4323 places, 10354/10362 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Computed a total of 2401 stabilizing places and 3213 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||G((p1&&X(G((G(p3)||p2)))))))))'
Support contains 5 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5007 transition count 8371
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5007 transition count 8371
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 4994 transition count 8313
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 4994 transition count 8313
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 4990 transition count 8289
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 4990 transition count 8289
Applied a total of 70 rules in 1404 ms. Remains 4990 /5025 variables (removed 35) and now considering 8289/8414 (removed 125) transitions.
[2024-05-25 12:08:29] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
// Phase 1: matrix 7689 rows 4990 cols
[2024-05-25 12:08:30] [INFO ] Computed 989 invariants in 263 ms
[2024-05-25 12:08:34] [INFO ] Implicit Places using invariants in 4867 ms returned []
[2024-05-25 12:08:34] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:08:34] [INFO ] Invariant cache hit.
[2024-05-25 12:08:38] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 8492 ms to find 0 implicit places.
[2024-05-25 12:08:38] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:08:38] [INFO ] Invariant cache hit.
[2024-05-25 12:08:43] [INFO ] Dead Transitions using invariants and state equation in 5043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4990/5025 places, 8289/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14941 ms. Remains : 4990/5025 places, 8289/8414 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 499 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 8}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3))), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(OR (LT s1821 1) (LT s2576 1)), p0:(LT s1005 1), p2:(OR (LT s1821 1) (LT s2576 1)), p3:(AND (GEQ s1626 1) (GEQ s4761 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1616 reset in 1137 ms.
Product exploration explored 100000 steps with 1616 reset in 1074 ms.
Computed a total of 2366 stabilizing places and 3088 stable transitions
Computed a total of 2366 stabilizing places and 3088 stable transitions
Detected a total of 2366/4990 stabilizing places and 3088/8289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 12:08:47] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:08:47] [INFO ] Invariant cache hit.
[2024-05-25 12:08:48] [INFO ] [Real]Absence check using 47 positive place invariants in 58 ms returned sat
[2024-05-25 12:08:48] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 300 ms returned sat
[2024-05-25 12:08:53] [INFO ] After 5580ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-25 12:08:54] [INFO ] [Nat]Absence check using 47 positive place invariants in 55 ms returned sat
[2024-05-25 12:08:54] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 295 ms returned sat
[2024-05-25 12:08:59] [INFO ] After 5230ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2024-05-25 12:08:59] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:09:01] [INFO ] After 1936ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2024-05-25 12:09:07] [INFO ] Deduced a trap composed of 901 places in 5081 ms of which 12 ms to minimize.
[2024-05-25 12:09:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5572 ms
[2024-05-25 12:09:08] [INFO ] After 8475ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 690 ms.
[2024-05-25 12:09:09] [INFO ] After 15717ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 4990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 322 Pre rules applied. Total rules applied 0 place count 4990 transition count 7967
Deduced a syphon composed of 322 places in 5 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 0 with 644 rules applied. Total rules applied 644 place count 4668 transition count 7967
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 696 place count 4642 transition count 7941
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 1033 place count 4642 transition count 10344
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 1370 place count 4305 transition count 10344
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 1395 place count 4305 transition count 10344
Applied a total of 1395 rules in 2179 ms. Remains 4305 /4990 variables (removed 685) and now considering 10344/8289 (removed -2055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2180 ms. Remains : 4305/4990 places, 10344/8289 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21411 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21411 steps, saw 9825 distinct states, run finished after 3004 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:09:14] [INFO ] Flow matrix only has 9458 transitions (discarded 886 similar events)
// Phase 1: matrix 9458 rows 4305 cols
[2024-05-25 12:09:15] [INFO ] Computed 989 invariants in 238 ms
[2024-05-25 12:09:15] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:09:16] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 262 ms returned sat
[2024-05-25 12:09:21] [INFO ] After 6575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:09:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:09:22] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 266 ms returned sat
[2024-05-25 12:09:29] [INFO ] After 6438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:09:29] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:09:32] [INFO ] After 3024ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:09:37] [INFO ] Deduced a trap composed of 409 places in 4726 ms of which 5 ms to minimize.
[2024-05-25 12:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5257 ms
[2024-05-25 12:09:44] [INFO ] Deduced a trap composed of 339 places in 5446 ms of which 7 ms to minimize.
[2024-05-25 12:09:50] [INFO ] Deduced a trap composed of 322 places in 5223 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:09:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:09:50] [INFO ] After 28730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 4305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 544 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 519 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
[2024-05-25 12:09:51] [INFO ] Flow matrix only has 9458 transitions (discarded 886 similar events)
[2024-05-25 12:09:51] [INFO ] Invariant cache hit.
[2024-05-25 12:09:55] [INFO ] Implicit Places using invariants in 3992 ms returned []
Implicit Place search using SMT only with invariants took 3993 ms to find 0 implicit places.
[2024-05-25 12:09:55] [INFO ] Flow matrix only has 9458 transitions (discarded 886 similar events)
[2024-05-25 12:09:55] [INFO ] Invariant cache hit.
[2024-05-25 12:10:01] [INFO ] Dead Transitions using invariants and state equation in 5625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10141 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Graph (trivial) has 3327 edges and 4305 vertex of which 25 / 4305 are part of one of the 1 SCC in 8 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 31991 edges and 4281 vertex of which 4259 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3873 transition count 8615
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 3631 transition count 8135
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 3391 transition count 7697
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 3152 transition count 7301
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 558 rules applied. Total rules applied 2838 place count 2953 transition count 6942
Ensure Unique test removed 35 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 519 rules applied. Total rules applied 3357 place count 2756 transition count 6620
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3807 place count 2594 transition count 6332
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4221 place count 2434 transition count 6078
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4573 place count 2306 transition count 5854
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4893 place count 2180 transition count 5660
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5159 place count 2082 transition count 5492
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5397 place count 1986 transition count 5350
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5589 place count 1914 transition count 5230
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5757 place count 1844 transition count 5132
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5887 place count 1794 transition count 5052
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 5997 place count 1746 transition count 4990
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6077 place count 1714 transition count 4942
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6141 place count 1684 transition count 4908
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6183 place count 1666 transition count 4884
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6213 place count 1650 transition count 4870
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6229 place count 1642 transition count 4862
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6238 place count 1636 transition count 4859
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6242 place count 1633 transition count 4858
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6242 place count 1633 transition count 4558
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 23 with 899 rules applied. Total rules applied 7141 place count 1034 transition count 4558
Discarding 311 places :
Symmetric choice reduction at 23 with 311 rule applications. Total rules 7452 place count 723 transition count 4247
Iterating global reduction 23 with 311 rules applied. Total rules applied 7763 place count 723 transition count 4247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7763 place count 723 transition count 4246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7765 place count 722 transition count 4246
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 8303 place count 184 transition count 1018
Iterating global reduction 23 with 538 rules applied. Total rules applied 8841 place count 184 transition count 1018
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 9379 place count 184 transition count 480
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9430 place count 158 transition count 455
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 9431 place count 158 transition count 454
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 24 with 7 rules applied. Total rules applied 9438 place count 158 transition count 447
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 24 with 7 rules applied. Total rules applied 9445 place count 151 transition count 447
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9456 place count 140 transition count 381
Ensure Unique test removed 10 places
Iterating global reduction 25 with 21 rules applied. Total rules applied 9477 place count 130 transition count 381
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9488 place count 130 transition count 370
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9498 place count 120 transition count 310
Iterating global reduction 26 with 10 rules applied. Total rules applied 9508 place count 120 transition count 310
Discarding 9 places :
Symmetric choice reduction at 26 with 9 rule applications. Total rules 9517 place count 111 transition count 301
Iterating global reduction 26 with 9 rules applied. Total rules applied 9526 place count 111 transition count 301
Partial Free-agglomeration rule applied 204 times.
Drop transitions removed 204 transitions
Iterating global reduction 26 with 204 rules applied. Total rules applied 9730 place count 111 transition count 301
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9741 place count 100 transition count 235
Ensure Unique test removed 1 places
Iterating global reduction 26 with 12 rules applied. Total rules applied 9753 place count 99 transition count 235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9764 place count 99 transition count 224
Applied a total of 9764 rules in 6149 ms. Remains 99 /4305 variables (removed 4206) and now considering 224/10344 (removed 10120) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 99 cols
[2024-05-25 12:10:07] [INFO ] Computed 30 invariants in 12 ms
[2024-05-25 12:10:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:10:07] [INFO ] [Real]Absence check using 4 positive and 26 generalized place invariants in 3 ms returned sat
[2024-05-25 12:10:07] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:10:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:10:07] [INFO ] [Nat]Absence check using 4 positive and 26 generalized place invariants in 3 ms returned sat
[2024-05-25 12:10:07] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:10:07] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 12:10:07] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 p1 (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND p3 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))))), (F (AND p0 p3 p1)), (F (NOT (AND p0 p1 p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)))), (F (AND p3 p1))]
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 4990 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Applied a total of 0 rules in 324 ms. Remains 4990 /4990 variables (removed 0) and now considering 8289/8289 (removed 0) transitions.
[2024-05-25 12:10:08] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
// Phase 1: matrix 7689 rows 4990 cols
[2024-05-25 12:10:09] [INFO ] Computed 989 invariants in 297 ms
[2024-05-25 12:10:13] [INFO ] Implicit Places using invariants in 4599 ms returned []
[2024-05-25 12:10:13] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:10:13] [INFO ] Invariant cache hit.
[2024-05-25 12:10:17] [INFO ] Implicit Places using invariants and state equation in 3611 ms returned []
Implicit Place search using SMT with State Equation took 8211 ms to find 0 implicit places.
[2024-05-25 12:10:17] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:10:17] [INFO ] Invariant cache hit.
[2024-05-25 12:10:22] [INFO ] Dead Transitions using invariants and state equation in 4922 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13459 ms. Remains : 4990/4990 places, 8289/8289 transitions.
Computed a total of 2366 stabilizing places and 3088 stable transitions
Computed a total of 2366 stabilizing places and 3088 stable transitions
Detected a total of 2366/4990 stabilizing places and 3088/8289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:10:22] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:10:22] [INFO ] Invariant cache hit.
[2024-05-25 12:10:23] [INFO ] [Real]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 12:10:23] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 304 ms returned sat
[2024-05-25 12:10:28] [INFO ] After 5502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:10:28] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 12:10:29] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 310 ms returned sat
[2024-05-25 12:10:33] [INFO ] After 4643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:10:33] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:10:35] [INFO ] After 1559ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:10:40] [INFO ] Deduced a trap composed of 901 places in 5019 ms of which 6 ms to minimize.
[2024-05-25 12:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5496 ms
[2024-05-25 12:10:41] [INFO ] After 7584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 441 ms.
[2024-05-25 12:10:41] [INFO ] After 13718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4990 transition count 8288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4989 transition count 8288
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 322 Pre rules applied. Total rules applied 2 place count 4989 transition count 7966
Deduced a syphon composed of 322 places in 5 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 2 with 644 rules applied. Total rules applied 646 place count 4667 transition count 7966
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 647 place count 4666 transition count 7960
Iterating global reduction 2 with 1 rules applied. Total rules applied 648 place count 4666 transition count 7960
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 700 place count 4640 transition count 7934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 701 place count 4639 transition count 7933
Iterating global reduction 2 with 1 rules applied. Total rules applied 702 place count 4639 transition count 7933
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 702 place count 4639 transition count 7932
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 704 place count 4638 transition count 7932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 705 place count 4637 transition count 7926
Iterating global reduction 2 with 1 rules applied. Total rules applied 706 place count 4637 transition count 7926
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 2 with 336 rules applied. Total rules applied 1042 place count 4637 transition count 10340
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 2 with 336 rules applied. Total rules applied 1378 place count 4301 transition count 10340
Applied a total of 1378 rules in 2669 ms. Remains 4301 /4990 variables (removed 689) and now considering 10340/8289 (removed -2051) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2669 ms. Remains : 4301/4990 places, 10340/8289 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21630 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21630 steps, saw 9927 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:10:48] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 12:10:48] [INFO ] Computed 989 invariants in 227 ms
[2024-05-25 12:10:48] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:10:49] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 253 ms returned sat
[2024-05-25 12:10:49] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:10:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 61 ms returned sat
[2024-05-25 12:10:50] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 251 ms returned sat
[2024-05-25 12:10:54] [INFO ] After 4127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:10:54] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:10:56] [INFO ] After 2363ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:10:57] [INFO ] After 3193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 534 ms.
[2024-05-25 12:10:58] [INFO ] After 8796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 516 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 526 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 12:10:59] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 12:10:59] [INFO ] Invariant cache hit.
[2024-05-25 12:11:08] [INFO ] Implicit Places using invariants in 9054 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2511, 2517, 2525, 2535, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2562, 2570, 2576, 2580, 2582, 2584, 2586, 2588, 2590, 2592, 2607, 2613, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2637, 2643, 2651, 2661, 2673, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2704, 2714, 2722, 2728, 2732, 2734, 2736, 2738, 2740, 2742, 2757, 2763, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2773, 2775, 2777, 2779, 2781, 2785, 2791, 2799, 2809, 2821, 2835, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2870, 2882, 2892, 2900, 2906, 2910, 2912, 2914, 2916, 2918, 2933, 2939, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2949, 2951, 2953, 2955, 2959, 2965, 2973, 2983, 2995, 3009, 3025, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3064, 3078, 3090, 3100, 3108, 3114, 3118, 3120, 3122, 3124, 3139, 3145, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3155, 3157, 3159, 3163, 3169, 3177, 3187, 3199, 3213, 3229, 3247, 3266, 3267, 3268, 3269, 3270, 3271, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360, 3362, 3364, 3379, 3385, 3387, 3388, 3389, 3390, 3391, 3392, 3393, 3395, 3397, 3401, 3407, 3415, 3425, 3437, 3451, 3467, 3485, 3505, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3552, 3570, 3586, 3600, 3612, 3622, 3630, 3636, 3640, 3642, 3657, 3659, 3662, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3672, 3676, 3682, 3690, 3700, 3712, 3726, 3742, 3760, 3780, 3802, 3825, 3826, 3827, 3828, 3829, 3830, 3831, 3853, 3873, 3891, 3907, 3921, 3933, 3943, 3951, 3957, 3961, 3976]
Discarding 926 places :
Implicit Place search using SMT only with invariants took 9082 ms to find 926 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3375/4301 places, 10340/10340 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3087 transition count 10052
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3087 transition count 10052
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 2799 transition count 9764
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 2799 transition count 9764
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 2799 transition count 9761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 2796 transition count 9761
Applied a total of 1158 rules in 1312 ms. Remains 2796 /3375 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2024-05-25 12:11:09] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2796 cols
[2024-05-25 12:11:09] [INFO ] Computed 63 invariants in 162 ms
[2024-05-25 12:11:14] [INFO ] Implicit Places using invariants in 4421 ms returned [1373, 1517]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4428 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 479 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 15828 ms. Remains : 2794/4301 places, 9761/10340 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25589 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25589 steps, saw 10898 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:11:18] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 12:11:18] [INFO ] Computed 61 invariants in 129 ms
[2024-05-25 12:11:18] [INFO ] [Real]Absence check using 47 positive place invariants in 37 ms returned sat
[2024-05-25 12:11:18] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-25 12:11:21] [INFO ] After 3379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:11:21] [INFO ] [Nat]Absence check using 47 positive place invariants in 40 ms returned sat
[2024-05-25 12:11:21] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 17 ms returned sat
[2024-05-25 12:11:25] [INFO ] After 3125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:11:25] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:11:27] [INFO ] After 2434ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:11:29] [INFO ] Deduced a trap composed of 381 places in 1920 ms of which 3 ms to minimize.
[2024-05-25 12:11:32] [INFO ] Deduced a trap composed of 130 places in 2118 ms of which 3 ms to minimize.
[2024-05-25 12:11:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4630 ms
[2024-05-25 12:11:32] [INFO ] After 7567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 415 ms.
[2024-05-25 12:11:33] [INFO ] After 11585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 469 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 481 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-25 12:11:34] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:11:34] [INFO ] Invariant cache hit.
[2024-05-25 12:11:38] [INFO ] Implicit Places using invariants in 3966 ms returned []
[2024-05-25 12:11:38] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:11:38] [INFO ] Invariant cache hit.
[2024-05-25 12:11:44] [INFO ] Implicit Places using invariants and state equation in 6161 ms returned []
Implicit Place search using SMT with State Equation took 10132 ms to find 0 implicit places.
[2024-05-25 12:11:45] [INFO ] Redundant transitions in 1377 ms returned []
[2024-05-25 12:11:45] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:11:45] [INFO ] Invariant cache hit.
[2024-05-25 12:11:50] [INFO ] Dead Transitions using invariants and state equation in 4959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16960 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Graph (trivial) has 3039 edges and 2794 vertex of which 25 / 2794 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 11533 edges and 2770 vertex of which 2748 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 24 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 2723 transition count 8032
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 721 rules applied. Total rules applied 966 place count 2482 transition count 7552
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 677 rules applied. Total rules applied 1643 place count 2243 transition count 7114
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 595 rules applied. Total rules applied 2238 place count 2044 transition count 6718
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 556 rules applied. Total rules applied 2794 place count 1847 transition count 6359
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 484 rules applied. Total rules applied 3278 place count 1685 transition count 6037
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 448 rules applied. Total rules applied 3726 place count 1525 transition count 5749
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 382 rules applied. Total rules applied 4108 place count 1397 transition count 5495
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4458 place count 1271 transition count 5271
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 292 rules applied. Total rules applied 4750 place count 1173 transition count 5077
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 264 rules applied. Total rules applied 5014 place count 1077 transition count 4909
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 214 rules applied. Total rules applied 5228 place count 1005 transition count 4767
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5418 place count 935 transition count 4647
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 148 rules applied. Total rules applied 5566 place count 885 transition count 4549
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5694 place count 837 transition count 4469
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 94 rules applied. Total rules applied 5788 place count 805 transition count 4407
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 78 rules applied. Total rules applied 5866 place count 775 transition count 4359
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 52 rules applied. Total rules applied 5918 place count 757 transition count 4325
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 40 rules applied. Total rules applied 5958 place count 741 transition count 4301
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 22 rules applied. Total rules applied 5980 place count 733 transition count 4287
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 14 rules applied. Total rules applied 5994 place count 727 transition count 4279
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 5 rules applied. Total rules applied 5999 place count 725 transition count 4276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 6001 place count 724 transition count 4275
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 12 Pre rules applied. Total rules applied 6001 place count 724 transition count 4263
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 23 with 24 rules applied. Total rules applied 6025 place count 712 transition count 4263
Discarding 621 places :
Symmetric choice reduction at 23 with 621 rule applications. Total rules 6646 place count 91 transition count 657
Iterating global reduction 23 with 621 rules applied. Total rules applied 7267 place count 91 transition count 657
Ensure Unique test removed 573 transitions
Reduce isomorphic transitions removed 573 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 23 with 593 rules applied. Total rules applied 7860 place count 91 transition count 64
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 21 rules applied. Total rules applied 7881 place count 71 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 7882 place count 70 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 7882 place count 70 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 7884 place count 69 transition count 62
Discarding 20 places :
Symmetric choice reduction at 26 with 20 rule applications. Total rules 7904 place count 49 transition count 42
Iterating global reduction 26 with 20 rules applied. Total rules applied 7924 place count 49 transition count 42
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 26 with 2 rules applied. Total rules applied 7926 place count 48 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 7927 place count 48 transition count 40
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 26 with 13 rules applied. Total rules applied 7940 place count 48 transition count 27
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 26 with 13 rules applied. Total rules applied 7953 place count 35 transition count 27
Applied a total of 7953 rules in 2590 ms. Remains 35 /2794 variables (removed 2759) and now considering 27/9761 (removed 9734) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 27 rows 35 cols
[2024-05-25 12:11:53] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 12:11:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:11:53] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-25 12:11:53] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:11:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:11:53] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 12:11:53] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:11:53] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 12:11:53] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1 p2))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 429 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 265 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1617 reset in 946 ms.
Product exploration explored 100000 steps with 1618 reset in 989 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 4990 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 311 Pre rules applied. Total rules applied 0 place count 4990 transition count 8290
Deduced a syphon composed of 311 places in 5 ms
Iterating global reduction 0 with 311 rules applied. Total rules applied 311 place count 4990 transition count 8290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 312 place count 4989 transition count 8284
Deduced a syphon composed of 311 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 313 place count 4989 transition count 8284
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 337 places in 5 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 339 place count 4989 transition count 8284
Deduced a syphon composed of 337 places in 5 ms
Applied a total of 339 rules in 2741 ms. Remains 4989 /4990 variables (removed 1) and now considering 8284/8289 (removed 5) transitions.
[2024-05-25 12:12:01] [INFO ] Redundant transitions in 1211 ms returned []
[2024-05-25 12:12:01] [INFO ] Flow matrix only has 7684 transitions (discarded 600 similar events)
// Phase 1: matrix 7684 rows 4989 cols
[2024-05-25 12:12:01] [INFO ] Computed 989 invariants in 198 ms
[2024-05-25 12:12:06] [INFO ] Dead Transitions using invariants and state equation in 5087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4989/4990 places, 8284/8289 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9054 ms. Remains : 4989/4990 places, 8284/8289 transitions.
Built C files in :
/tmp/ltsmin4774159724496182558
[2024-05-25 12:12:06] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4774159724496182558
Running compilation step : cd /tmp/ltsmin4774159724496182558;'/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/ltsmin4774159724496182558;'/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/ltsmin4774159724496182558;'/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 4990 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4989 transition count 8283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4989 transition count 8283
Applied a total of 2 rules in 759 ms. Remains 4989 /4990 variables (removed 1) and now considering 8283/8289 (removed 6) transitions.
[2024-05-25 12:12:10] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2024-05-25 12:12:10] [INFO ] Computed 989 invariants in 171 ms
[2024-05-25 12:12:13] [INFO ] Implicit Places using invariants in 3466 ms returned []
[2024-05-25 12:12:13] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
[2024-05-25 12:12:13] [INFO ] Invariant cache hit.
[2024-05-25 12:12:18] [INFO ] Implicit Places using invariants and state equation in 4943 ms returned []
Implicit Place search using SMT with State Equation took 8415 ms to find 0 implicit places.
[2024-05-25 12:12:18] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
[2024-05-25 12:12:18] [INFO ] Invariant cache hit.
[2024-05-25 12:12:23] [INFO ] Dead Transitions using invariants and state equation in 5225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4989/4990 places, 8283/8289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14400 ms. Remains : 4989/4990 places, 8283/8289 transitions.
Built C files in :
/tmp/ltsmin9688816893904147160
[2024-05-25 12:12:24] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9688816893904147160
Running compilation step : cd /tmp/ltsmin9688816893904147160;'/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/ltsmin9688816893904147160;'/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/ltsmin9688816893904147160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:12:27] [INFO ] Flatten gal took : 329 ms
[2024-05-25 12:12:28] [INFO ] Flatten gal took : 246 ms
[2024-05-25 12:12:28] [INFO ] Time to serialize gal into /tmp/LTL8075746595265165655.gal : 68 ms
[2024-05-25 12:12:28] [INFO ] Time to serialize properties into /tmp/LTL13396077244529729810.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/LTL8075746595265165655.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4682918087374362736.hoa' '-atoms' '/tmp/LTL13396077244529729810.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/LTL13396077244529729810.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4682918087374362736.hoa
Detected timeout of ITS tools.
[2024-05-25 12:12:43] [INFO ] Flatten gal took : 228 ms
[2024-05-25 12:12:43] [INFO ] Flatten gal took : 228 ms
[2024-05-25 12:12:43] [INFO ] Time to serialize gal into /tmp/LTL17177205944564902377.gal : 51 ms
[2024-05-25 12:12:43] [INFO ] Time to serialize properties into /tmp/LTL11881631226947436601.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/LTL17177205944564902377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11881631226947436601.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(G("(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15Notif...369
Formula 0 simplified : XX(XF!"(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15NotifyThatHe...351
Detected timeout of ITS tools.
[2024-05-25 12:12:59] [INFO ] Flatten gal took : 221 ms
[2024-05-25 12:12:59] [INFO ] Applying decomposition
[2024-05-25 12:12:59] [INFO ] Flatten gal took : 220 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/graph16430577366201758667.txt' '-o' '/tmp/graph16430577366201758667.bin' '-w' '/tmp/graph16430577366201758667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16430577366201758667.bin' '-l' '-1' '-v' '-w' '/tmp/graph16430577366201758667.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:13:00] [INFO ] Decomposing Gal with order
[2024-05-25 12:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:13:02] [INFO ] Removed a total of 6035 redundant transitions.
[2024-05-25 12:13:02] [INFO ] Flatten gal took : 1256 ms
[2024-05-25 12:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 3869 labels/synchronizations in 409 ms.
[2024-05-25 12:13:03] [INFO ] Time to serialize gal into /tmp/LTL10538688717104914009.gal : 115 ms
[2024-05-25 12:13:03] [INFO ] Time to serialize properties into /tmp/LTL7015306801179864863.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/LTL10538688717104914009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7015306801179864863.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(i3.u644.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((i23.u201.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14...427
Formula 0 simplified : XX(XF!"(i3.u644.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((i23.u201.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(i...409
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9545510488863628248
[2024-05-25 12:13:18] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9545510488863628248
Running compilation step : cd /tmp/ltsmin9545510488863628248;'/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/ltsmin9545510488863628248;'/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/ltsmin9545510488863628248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 finished in 293048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 10 place count 5020 transition count 8096
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 636 place count 4707 transition count 8096
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 650 place count 4693 transition count 8057
Iterating global reduction 2 with 14 rules applied. Total rules applied 664 place count 4693 transition count 8057
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 664 place count 4693 transition count 8054
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 670 place count 4690 transition count 8054
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 679 place count 4681 transition count 8000
Iterating global reduction 2 with 9 rules applied. Total rules applied 688 place count 4681 transition count 8000
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 746 place count 4652 transition count 7971
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 751 place count 4647 transition count 7966
Iterating global reduction 2 with 5 rules applied. Total rules applied 756 place count 4647 transition count 7966
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 756 place count 4647 transition count 7962
Deduced a syphon composed of 4 places in 24 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 764 place count 4643 transition count 7962
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 769 place count 4638 transition count 7932
Iterating global reduction 2 with 5 rules applied. Total rules applied 774 place count 4638 transition count 7932
Applied a total of 774 rules in 3203 ms. Remains 4638 /5025 variables (removed 387) and now considering 7932/8414 (removed 482) transitions.
[2024-05-25 12:13:24] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
// Phase 1: matrix 7332 rows 4638 cols
[2024-05-25 12:13:24] [INFO ] Computed 989 invariants in 181 ms
[2024-05-25 12:13:29] [INFO ] Implicit Places using invariants in 5111 ms returned []
[2024-05-25 12:13:29] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:13:29] [INFO ] Invariant cache hit.
[2024-05-25 12:13:33] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 8659 ms to find 0 implicit places.
[2024-05-25 12:13:34] [INFO ] Redundant transitions in 858 ms returned []
[2024-05-25 12:13:34] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:13:34] [INFO ] Invariant cache hit.
[2024-05-25 12:13:38] [INFO ] Dead Transitions using invariants and state equation in 4564 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4638/5025 places, 7932/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17291 ms. Remains : 4638/5025 places, 7932/8414 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01 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:(OR (LT s2713 1) (LT s4394 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]]
Product exploration explored 100000 steps with 2295 reset in 1210 ms.
Product exploration explored 100000 steps with 2298 reset in 1231 ms.
Computed a total of 2039 stabilizing places and 2756 stable transitions
Computed a total of 2039 stabilizing places and 2756 stable transitions
Detected a total of 2039/4638 stabilizing places and 2756/7932 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24763 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24763 steps, saw 11549 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:13:44] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:13:44] [INFO ] Invariant cache hit.
[2024-05-25 12:13:45] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 12:13:45] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 276 ms returned sat
[2024-05-25 12:13:49] [INFO ] After 4550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:13:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 12:13:49] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 283 ms returned sat
[2024-05-25 12:13:53] [INFO ] After 3813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:13:53] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:13:54] [INFO ] After 647ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:13:59] [INFO ] Deduced a trap composed of 561 places in 4767 ms of which 7 ms to minimize.
[2024-05-25 12:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5226 ms
[2024-05-25 12:13:59] [INFO ] After 6026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 286 ms.
[2024-05-25 12:14:00] [INFO ] After 11028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 4638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4638/4638 places, 7932/7932 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4638 transition count 10341
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4302 transition count 10341
Applied a total of 672 rules in 1237 ms. Remains 4302 /4638 variables (removed 336) and now considering 10341/7932 (removed -2409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1237 ms. Remains : 4302/4638 places, 10341/7932 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22613 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22613 steps, saw 10362 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:14:04] [INFO ] Flow matrix only has 9455 transitions (discarded 886 similar events)
// Phase 1: matrix 9455 rows 4302 cols
[2024-05-25 12:14:05] [INFO ] Computed 989 invariants in 261 ms
[2024-05-25 12:14:05] [INFO ] [Real]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 12:14:05] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 254 ms returned sat
[2024-05-25 12:14:10] [INFO ] After 4995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:14:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 12:14:10] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 244 ms returned sat
[2024-05-25 12:14:15] [INFO ] After 4509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:14:15] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:14:17] [INFO ] After 1938ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:14:17] [INFO ] After 2387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 289 ms.
[2024-05-25 12:14:18] [INFO ] After 8038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4302/4302 places, 10341/10341 transitions.
Applied a total of 0 rules in 575 ms. Remains 4302 /4302 variables (removed 0) and now considering 10341/10341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 4302/4302 places, 10341/10341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4302/4302 places, 10341/10341 transitions.
Applied a total of 0 rules in 553 ms. Remains 4302 /4302 variables (removed 0) and now considering 10341/10341 (removed 0) transitions.
[2024-05-25 12:14:19] [INFO ] Flow matrix only has 9455 transitions (discarded 886 similar events)
[2024-05-25 12:14:19] [INFO ] Invariant cache hit.
[2024-05-25 12:14:28] [INFO ] Implicit Places using invariants in 9200 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1950, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2305, 2309, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2512, 2518, 2526, 2536, 2547, 2548, 2549, 2550, 2551, 2552, 2553, 2563, 2571, 2577, 2581, 2583, 2585, 2587, 2589, 2591, 2593, 2608, 2614, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2624, 2626, 2628, 2630, 2632, 2634, 2638, 2644, 2652, 2662, 2674, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2705, 2715, 2723, 2729, 2733, 2735, 2737, 2739, 2741, 2743, 2758, 2764, 2766, 2767, 2768, 2769, 2770, 2771, 2772, 2774, 2776, 2778, 2780, 2782, 2786, 2792, 2800, 2810, 2822, 2836, 2851, 2852, 2853, 2854, 2855, 2856, 2857, 2871, 2883, 2893, 2901, 2907, 2911, 2913, 2915, 2917, 2919, 2934, 2940, 2942, 2943, 2944, 2945, 2946, 2947, 2948, 2950, 2952, 2954, 2956, 2960, 2966, 2974, 2984, 2996, 3010, 3026, 3043, 3044, 3045, 3046, 3047, 3048, 3049, 3065, 3079, 3091, 3101, 3109, 3115, 3119, 3121, 3123, 3125, 3140, 3146, 3148, 3149, 3150, 3151, 3152, 3153, 3154, 3156, 3158, 3160, 3164, 3170, 3178, 3188, 3200, 3214, 3230, 3248, 3267, 3268, 3269, 3270, 3271, 3272, 3273, 3291, 3307, 3321, 3333, 3343, 3351, 3357, 3361, 3363, 3365, 3380, 3386, 3388, 3389, 3390, 3391, 3392, 3393, 3394, 3396, 3398, 3402, 3408, 3416, 3426, 3438, 3452, 3468, 3486, 3506, 3527, 3528, 3529, 3530, 3531, 3532, 3533, 3553, 3571, 3587, 3601, 3613, 3623, 3631, 3637, 3641, 3643, 3658, 3660, 3663, 3665, 3666, 3667, 3668, 3669, 3670, 3671, 3673, 3677, 3683, 3691, 3701, 3713, 3727, 3743, 3761, 3781, 3803, 3826, 3827, 3828, 3829, 3830, 3831, 3832, 3854, 3874, 3892, 3908, 3922, 3934, 3944, 3952, 3958, 3962, 3977]
Discarding 926 places :
Implicit Place search using SMT only with invariants took 9221 ms to find 926 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3376/4302 places, 10341/10341 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3088 transition count 10053
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3088 transition count 10053
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 2800 transition count 9765
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 2800 transition count 9765
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 2800 transition count 9762
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 2797 transition count 9762
Applied a total of 1158 rules in 1421 ms. Remains 2797 /3376 variables (removed 579) and now considering 9762/10341 (removed 579) transitions.
[2024-05-25 12:14:29] [INFO ] Flow matrix only has 8876 transitions (discarded 886 similar events)
// Phase 1: matrix 8876 rows 2797 cols
[2024-05-25 12:14:30] [INFO ] Computed 63 invariants in 168 ms
[2024-05-25 12:14:34] [INFO ] Implicit Places using invariants in 4524 ms returned [1312, 1513]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4532 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2795/4302 places, 9762/10341 transitions.
Applied a total of 0 rules in 519 ms. Remains 2795 /2795 variables (removed 0) and now considering 9762/9762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16249 ms. Remains : 2795/4302 places, 9762/10341 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11722 steps, run visited all 1 properties in 1295 ms. (steps per millisecond=9 )
Probabilistic random walk after 11722 steps, saw 5181 distinct states, run finished after 1296 ms. (steps per millisecond=9 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 4638 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4638/4638 places, 7932/7932 transitions.
Applied a total of 0 rules in 536 ms. Remains 4638 /4638 variables (removed 0) and now considering 7932/7932 (removed 0) transitions.
[2024-05-25 12:14:37] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
// Phase 1: matrix 7332 rows 4638 cols
[2024-05-25 12:14:37] [INFO ] Computed 989 invariants in 192 ms
[2024-05-25 12:14:42] [INFO ] Implicit Places using invariants in 5007 ms returned []
[2024-05-25 12:14:42] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:14:42] [INFO ] Invariant cache hit.
[2024-05-25 12:14:45] [INFO ] Implicit Places using invariants and state equation in 3329 ms returned []
Implicit Place search using SMT with State Equation took 8338 ms to find 0 implicit places.
[2024-05-25 12:14:46] [INFO ] Redundant transitions in 844 ms returned []
[2024-05-25 12:14:46] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:14:46] [INFO ] Invariant cache hit.
[2024-05-25 12:14:51] [INFO ] Dead Transitions using invariants and state equation in 4423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14148 ms. Remains : 4638/4638 places, 7932/7932 transitions.
Computed a total of 2039 stabilizing places and 2756 stable transitions
Computed a total of 2039 stabilizing places and 2756 stable transitions
Detected a total of 2039/4638 stabilizing places and 2756/7932 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24250 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24250 steps, saw 11309 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:14:54] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:14:54] [INFO ] Invariant cache hit.
[2024-05-25 12:14:55] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 12:14:55] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 276 ms returned sat
[2024-05-25 12:14:58] [INFO ] After 4361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:14:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 12:14:59] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 277 ms returned sat
[2024-05-25 12:15:03] [INFO ] After 3641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:15:03] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:15:04] [INFO ] After 619ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:15:08] [INFO ] Deduced a trap composed of 561 places in 4521 ms of which 4 ms to minimize.
[2024-05-25 12:15:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4976 ms
[2024-05-25 12:15:09] [INFO ] After 5743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 282 ms.
[2024-05-25 12:15:09] [INFO ] After 10560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4638/4638 places, 7932/7932 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4638 transition count 10341
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4302 transition count 10341
Applied a total of 672 rules in 1242 ms. Remains 4302 /4638 variables (removed 336) and now considering 10341/7932 (removed -2409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 4302/4638 places, 10341/7932 transitions.
Finished random walk after 2678 steps, including 71 resets, run visited all 1 properties in 95 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2298 reset in 1118 ms.
Product exploration explored 100000 steps with 2296 reset in 1168 ms.
Built C files in :
/tmp/ltsmin10707571806571679853
[2024-05-25 12:15:13] [INFO ] Too many transitions (7932) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:15:13] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10707571806571679853
Running compilation step : cd /tmp/ltsmin10707571806571679853;'/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/ltsmin10707571806571679853;'/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/ltsmin10707571806571679853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 4638 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4638/4638 places, 7932/7932 transitions.
Applied a total of 0 rules in 544 ms. Remains 4638 /4638 variables (removed 0) and now considering 7932/7932 (removed 0) transitions.
[2024-05-25 12:15:17] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:15:17] [INFO ] Invariant cache hit.
[2024-05-25 12:15:20] [INFO ] Implicit Places using invariants in 3567 ms returned []
[2024-05-25 12:15:20] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:15:20] [INFO ] Invariant cache hit.
[2024-05-25 12:15:24] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 6960 ms to find 0 implicit places.
[2024-05-25 12:15:24] [INFO ] Redundant transitions in 766 ms returned []
[2024-05-25 12:15:24] [INFO ] Flow matrix only has 7332 transitions (discarded 600 similar events)
[2024-05-25 12:15:24] [INFO ] Invariant cache hit.
[2024-05-25 12:15:29] [INFO ] Dead Transitions using invariants and state equation in 4473 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12748 ms. Remains : 4638/4638 places, 7932/7932 transitions.
Built C files in :
/tmp/ltsmin2482915810338434392
[2024-05-25 12:15:29] [INFO ] Too many transitions (7932) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:15:29] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2482915810338434392
Running compilation step : cd /tmp/ltsmin2482915810338434392;'/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/ltsmin2482915810338434392;'/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/ltsmin2482915810338434392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:15:32] [INFO ] Flatten gal took : 229 ms
[2024-05-25 12:15:32] [INFO ] Flatten gal took : 232 ms
[2024-05-25 12:15:33] [INFO ] Time to serialize gal into /tmp/LTL1129685789663364938.gal : 33 ms
[2024-05-25 12:15:33] [INFO ] Time to serialize properties into /tmp/LTL5971450937508079830.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1129685789663364938.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17346716155966080648.hoa' '-atoms' '/tmp/LTL5971450937508079830.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/LTL5971450937508079830.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17346716155966080648.hoa
Detected timeout of ITS tools.
[2024-05-25 12:15:48] [INFO ] Flatten gal took : 231 ms
[2024-05-25 12:15:48] [INFO ] Flatten gal took : 230 ms
[2024-05-25 12:15:48] [INFO ] Time to serialize gal into /tmp/LTL740543610465399073.gal : 36 ms
[2024-05-25 12:15:48] [INFO ] Time to serialize properties into /tmp/LTL16980107762459916242.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/LTL740543610465399073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16980107762459916242.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node18ManageTheCrashOfNode8<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : FG!"((Node18ManageTheCrashOfNode8<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2024-05-25 12:16:03] [INFO ] Flatten gal took : 219 ms
[2024-05-25 12:16:03] [INFO ] Applying decomposition
[2024-05-25 12:16:04] [INFO ] Flatten gal took : 225 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/graph14152548397747369682.txt' '-o' '/tmp/graph14152548397747369682.bin' '-w' '/tmp/graph14152548397747369682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14152548397747369682.bin' '-l' '-1' '-v' '-w' '/tmp/graph14152548397747369682.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:16:04] [INFO ] Decomposing Gal with order
[2024-05-25 12:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:16:06] [INFO ] Removed a total of 6811 redundant transitions.
[2024-05-25 12:16:06] [INFO ] Flatten gal took : 1186 ms
[2024-05-25 12:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4931 labels/synchronizations in 375 ms.
[2024-05-25 12:16:07] [INFO ] Time to serialize gal into /tmp/LTL18077337571641049985.gal : 54 ms
[2024-05-25 12:16:07] [INFO ] Time to serialize properties into /tmp/LTL12725811273812284957.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/LTL18077337571641049985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12725811273812284957.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 : !((G(F("((i18.u360.Node18ManageTheCrashOfNode8<1)||(i18.u361.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : FG!"((i18.u360.Node18ManageTheCrashOfNode8<1)||(i18.u361.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4953199236726249600
[2024-05-25 12:16:22] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4953199236726249600
Running compilation step : cd /tmp/ltsmin4953199236726249600;'/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/ltsmin4953199236726249600;'/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/ltsmin4953199236726249600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01 finished in 183732 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 G(p2)))))) U G(!p2)))'
Support contains 8 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5007 transition count 8366
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5007 transition count 8366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 4995 transition count 8319
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 4995 transition count 8319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 4990 transition count 8289
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 4990 transition count 8289
Applied a total of 70 rules in 1790 ms. Remains 4990 /5025 variables (removed 35) and now considering 8289/8414 (removed 125) transitions.
[2024-05-25 12:16:26] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
// Phase 1: matrix 7689 rows 4990 cols
[2024-05-25 12:16:27] [INFO ] Computed 989 invariants in 182 ms
[2024-05-25 12:16:30] [INFO ] Implicit Places using invariants in 3759 ms returned []
[2024-05-25 12:16:30] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:16:30] [INFO ] Invariant cache hit.
[2024-05-25 12:16:35] [INFO ] Implicit Places using invariants and state equation in 4941 ms returned []
Implicit Place search using SMT with State Equation took 8703 ms to find 0 implicit places.
[2024-05-25 12:16:35] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:16:35] [INFO ] Invariant cache hit.
[2024-05-25 12:16:40] [INFO ] Dead Transitions using invariants and state equation in 5279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4990/5025 places, 8289/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15773 ms. Remains : 4990/5025 places, 8289/8414 transitions.
Stuttering acceptance computed with spot in 399 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p2, acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s120 1) (GEQ s121 1) (GEQ s2193 1)), p0:(AND (GEQ s1255 1) (GEQ s1401 1)), p1:(AND (GEQ s4145 1) (GEQ s4290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24889 reset in 2466 ms.
Product exploration explored 100000 steps with 24950 reset in 2595 ms.
Computed a total of 2366 stabilizing places and 3088 stable transitions
Computed a total of 2366 stabilizing places and 3088 stable transitions
Detected a total of 2366/4990 stabilizing places and 3088/8289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 313 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 12:16:48] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:16:48] [INFO ] Invariant cache hit.
[2024-05-25 12:16:49] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 12:16:49] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 276 ms returned sat
[2024-05-25 12:16:55] [INFO ] After 7291ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:6
[2024-05-25 12:16:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:16:56] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 276 ms returned sat
[2024-05-25 12:17:08] [INFO ] After 11669ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2024-05-25 12:17:08] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:17:16] [INFO ] After 8299ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :6 sat :4
[2024-05-25 12:17:23] [INFO ] Deduced a trap composed of 768 places in 5112 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:17:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:17:23] [INFO ] After 27708ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:6
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 4990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 320 Pre rules applied. Total rules applied 0 place count 4990 transition count 7969
Deduced a syphon composed of 320 places in 4 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 0 with 640 rules applied. Total rules applied 640 place count 4670 transition count 7969
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 690 place count 4645 transition count 7944
Free-agglomeration rule (complex) applied 285 times.
Iterating global reduction 0 with 285 rules applied. Total rules applied 975 place count 4645 transition count 7659
Reduce places removed 285 places and 0 transitions.
Iterating post reduction 0 with 285 rules applied. Total rules applied 1260 place count 4360 transition count 7659
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 1308 place count 4360 transition count 7659
Applied a total of 1308 rules in 2004 ms. Remains 4360 /4990 variables (removed 630) and now considering 7659/8289 (removed 630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2004 ms. Remains : 4360/4990 places, 7659/8289 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 23168 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23168 steps, saw 10813 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:17:28] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
// Phase 1: matrix 6774 rows 4360 cols
[2024-05-25 12:17:28] [INFO ] Computed 989 invariants in 156 ms
[2024-05-25 12:17:29] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 12:17:29] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 248 ms returned sat
[2024-05-25 12:17:29] [INFO ] After 1113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 12:17:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 12:17:30] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 264 ms returned sat
[2024-05-25 12:17:43] [INFO ] After 12134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 12:17:43] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:17:51] [INFO ] After 8511ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 12:17:55] [INFO ] After 11720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 12:17:55] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 4360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4360/4360 places, 7659/7659 transitions.
Applied a total of 0 rules in 412 ms. Remains 4360 /4360 variables (removed 0) and now considering 7659/7659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 4360/4360 places, 7659/7659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4360/4360 places, 7659/7659 transitions.
Applied a total of 0 rules in 410 ms. Remains 4360 /4360 variables (removed 0) and now considering 7659/7659 (removed 0) transitions.
[2024-05-25 12:17:55] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:17:55] [INFO ] Invariant cache hit.
[2024-05-25 12:18:00] [INFO ] Implicit Places using invariants in 4438 ms returned []
[2024-05-25 12:18:00] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:18:00] [INFO ] Invariant cache hit.
[2024-05-25 12:18:04] [INFO ] Implicit Places using invariants and state equation in 4417 ms returned []
Implicit Place search using SMT with State Equation took 8857 ms to find 0 implicit places.
[2024-05-25 12:18:05] [INFO ] Redundant transitions in 781 ms returned []
[2024-05-25 12:18:05] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:18:05] [INFO ] Invariant cache hit.
[2024-05-25 12:18:10] [INFO ] Dead Transitions using invariants and state equation in 4608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14663 ms. Remains : 4360/4360 places, 7659/7659 transitions.
Graph (trivial) has 2704 edges and 4360 vertex of which 25 / 4360 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 12289 edges and 4336 vertex of which 4314 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 242 rules applied. Total rules applied 244 place count 3928 transition count 5932
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 720 rules applied. Total rules applied 964 place count 3687 transition count 5453
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1642 place count 3447 transition count 5015
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2277 place count 3208 transition count 4619
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 557 rules applied. Total rules applied 2834 place count 3009 transition count 4261
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3351 place count 2812 transition count 3941
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 447 rules applied. Total rules applied 3798 place count 2651 transition count 3655
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4209 place count 2492 transition count 3403
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4558 place count 2365 transition count 3181
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4875 place count 2240 transition count 2989
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5138 place count 2143 transition count 2823
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5373 place count 2048 transition count 2683
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5562 place count 1977 transition count 2565
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5727 place count 1908 transition count 2469
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 127 rules applied. Total rules applied 5854 place count 1859 transition count 2391
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 5961 place count 1812 transition count 2331
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 16 with 77 rules applied. Total rules applied 6038 place count 1781 transition count 2285
Ensure Unique test removed 12 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 17 with 61 rules applied. Total rules applied 6099 place count 1752 transition count 2253
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 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 18 with 40 rules applied. Total rules applied 6139 place count 1735 transition count 2230
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 29 rules applied. Total rules applied 6168 place count 1720 transition count 2216
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6184 place count 1712 transition count 2208
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 6192 place count 1706 transition count 2206
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6194 place count 1704 transition count 2206
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6194 place count 1704 transition count 1906
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 298 places
Reduce places removed 598 places and 0 transitions.
Iterating global reduction 23 with 898 rules applied. Total rules applied 7092 place count 1106 transition count 1906
Discarding 312 places :
Symmetric choice reduction at 23 with 312 rule applications. Total rules 7404 place count 794 transition count 1594
Iterating global reduction 23 with 312 rules applied. Total rules applied 7716 place count 794 transition count 1594
Discarding 46 places :
Symmetric choice reduction at 23 with 46 rule applications. Total rules 7762 place count 748 transition count 1318
Iterating global reduction 23 with 46 rules applied. Total rules applied 7808 place count 748 transition count 1318
Discarding 527 places :
Symmetric choice reduction at 23 with 527 rule applications. Total rules 8335 place count 221 transition count 791
Iterating global reduction 23 with 527 rules applied. Total rules applied 8862 place count 221 transition count 791
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 23 with 527 rules applied. Total rules applied 9389 place count 221 transition count 264
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 24 with 48 rules applied. Total rules applied 9437 place count 197 transition count 240
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 24 with 18 rules applied. Total rules applied 9455 place count 197 transition count 222
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 24 with 17 rules applied. Total rules applied 9472 place count 197 transition count 205
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 25 with 18 rules applied. Total rules applied 9490 place count 180 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 9491 place count 179 transition count 204
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 27 with 10 rules applied. Total rules applied 9501 place count 179 transition count 194
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 9511 place count 169 transition count 194
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 28 with 2 rules applied. Total rules applied 9513 place count 169 transition count 194
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 28 with 3 rules applied. Total rules applied 9516 place count 169 transition count 194
Applied a total of 9516 rules in 3055 ms. Remains 169 /4360 variables (removed 4191) and now considering 194/7659 (removed 7465) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 194 rows 169 cols
[2024-05-25 12:18:13] [INFO ] Computed 43 invariants in 4 ms
[2024-05-25 12:18:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:18:13] [INFO ] [Real]Absence check using 4 positive and 39 generalized place invariants in 5 ms returned sat
[2024-05-25 12:18:13] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-25 12:18:13] [INFO ] After 146ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 12:18:13] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:1
[2024-05-25 12:18:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:18:13] [INFO ] [Nat]Absence check using 4 positive and 39 generalized place invariants in 5 ms returned sat
[2024-05-25 12:18:13] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 12:18:13] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-25 12:18:13] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 18 factoid took 1965 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 556 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 230 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 4990 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Applied a total of 0 rules in 425 ms. Remains 4990 /4990 variables (removed 0) and now considering 8289/8289 (removed 0) transitions.
[2024-05-25 12:18:16] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
// Phase 1: matrix 7689 rows 4990 cols
[2024-05-25 12:18:17] [INFO ] Computed 989 invariants in 175 ms
[2024-05-25 12:18:20] [INFO ] Implicit Places using invariants in 3735 ms returned []
[2024-05-25 12:18:20] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:18:20] [INFO ] Invariant cache hit.
[2024-05-25 12:18:25] [INFO ] Implicit Places using invariants and state equation in 4881 ms returned []
Implicit Place search using SMT with State Equation took 8619 ms to find 0 implicit places.
[2024-05-25 12:18:25] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:18:25] [INFO ] Invariant cache hit.
[2024-05-25 12:18:30] [INFO ] Dead Transitions using invariants and state equation in 5247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14292 ms. Remains : 4990/4990 places, 8289/8289 transitions.
Computed a total of 2366 stabilizing places and 3088 stable transitions
Computed a total of 2366 stabilizing places and 3088 stable transitions
Detected a total of 2366/4990 stabilizing places and 3088/8289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), true, (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:18:31] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:18:31] [INFO ] Invariant cache hit.
[2024-05-25 12:18:31] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2024-05-25 12:18:32] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 282 ms returned sat
[2024-05-25 12:18:36] [INFO ] After 5143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:18:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2024-05-25 12:18:37] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 285 ms returned sat
[2024-05-25 12:18:41] [INFO ] After 4150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:18:41] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:18:42] [INFO ] After 576ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:18:47] [INFO ] Deduced a trap composed of 546 places in 5185 ms of which 5 ms to minimize.
[2024-05-25 12:18:53] [INFO ] Deduced a trap composed of 908 places in 4975 ms of which 4 ms to minimize.
[2024-05-25 12:18:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 11123 ms
[2024-05-25 12:18:53] [INFO ] After 11867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 245 ms.
[2024-05-25 12:18:53] [INFO ] After 17208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 321 Pre rules applied. Total rules applied 0 place count 4990 transition count 7968
Deduced a syphon composed of 321 places in 4 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 0 with 642 rules applied. Total rules applied 642 place count 4669 transition count 7968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 4668 transition count 7967
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 4668 transition count 7967
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 644 place count 4668 transition count 7966
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 646 place count 4667 transition count 7966
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 4666 transition count 7960
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 4666 transition count 7960
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 698 place count 4641 transition count 7935
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 1035 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 1372 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 1396 place count 4304 transition count 10343
Applied a total of 1396 rules in 3203 ms. Remains 4304 /4990 variables (removed 686) and now considering 10343/8289 (removed -2054) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3204 ms. Remains : 4304/4990 places, 10343/8289 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22555 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22555 steps, saw 10340 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:19:00] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:19:00] [INFO ] Computed 989 invariants in 224 ms
[2024-05-25 12:19:01] [INFO ] [Real]Absence check using 49 positive place invariants in 56 ms returned sat
[2024-05-25 12:19:01] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 264 ms returned sat
[2024-05-25 12:19:05] [INFO ] After 4508ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:19:05] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:19:07] [INFO ] After 1122ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:19:07] [INFO ] After 6488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:19:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 54 ms returned sat
[2024-05-25 12:19:07] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 250 ms returned sat
[2024-05-25 12:19:12] [INFO ] After 4652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:19:14] [INFO ] After 1793ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:19:19] [INFO ] Deduced a trap composed of 235 places in 4731 ms of which 4 ms to minimize.
[2024-05-25 12:19:25] [INFO ] Deduced a trap composed of 430 places in 4750 ms of which 4 ms to minimize.
[2024-05-25 12:19:31] [INFO ] Deduced a trap composed of 453 places in 4828 ms of which 4 ms to minimize.
[2024-05-25 12:19:36] [INFO ] Deduced a trap composed of 366 places in 4970 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:19:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:19:36] [INFO ] After 29865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 590 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 567 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
[2024-05-25 12:19:38] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:19:38] [INFO ] Invariant cache hit.
[2024-05-25 12:19:43] [INFO ] Implicit Places using invariants in 4941 ms returned []
Implicit Place search using SMT only with invariants took 4941 ms to find 0 implicit places.
[2024-05-25 12:19:43] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:19:43] [INFO ] Invariant cache hit.
[2024-05-25 12:19:49] [INFO ] Dead Transitions using invariants and state equation in 5960 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11471 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Graph (trivial) has 3329 edges and 4304 vertex of which 25 / 4304 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 32009 edges and 4280 vertex of which 4258 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3872 transition count 8614
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3630 transition count 8133
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3389 transition count 7693
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3149 transition count 7295
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2949 transition count 6935
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2751 transition count 6613
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2589 transition count 6325
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2429 transition count 6071
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2301 transition count 5847
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2175 transition count 5653
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2077 transition count 5485
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 1981 transition count 5343
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 1909 transition count 5223
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1839 transition count 5125
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1789 transition count 5045
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1741 transition count 4983
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1709 transition count 4935
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1679 transition count 4901
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1661 transition count 4877
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1645 transition count 4863
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1637 transition count 4855
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1630 transition count 4853
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1628 transition count 4853
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6250 place count 1628 transition count 4553
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 23 with 899 rules applied. Total rules applied 7149 place count 1029 transition count 4553
Discarding 312 places :
Symmetric choice reduction at 23 with 312 rule applications. Total rules 7461 place count 717 transition count 4241
Iterating global reduction 23 with 312 rules applied. Total rules applied 7773 place count 717 transition count 4241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7773 place count 717 transition count 4240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7775 place count 716 transition count 4240
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8315 place count 176 transition count 1000
Iterating global reduction 23 with 540 rules applied. Total rules applied 8855 place count 176 transition count 1000
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9395 place count 176 transition count 460
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9446 place count 150 transition count 435
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 24 with 11 rules applied. Total rules applied 9457 place count 150 transition count 424
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 24 with 11 rules applied. Total rules applied 9468 place count 139 transition count 424
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9479 place count 128 transition count 358
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 9501 place count 117 transition count 358
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9512 place count 117 transition count 347
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9523 place count 106 transition count 281
Iterating global reduction 26 with 11 rules applied. Total rules applied 9534 place count 106 transition count 281
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9545 place count 95 transition count 270
Iterating global reduction 26 with 11 rules applied. Total rules applied 9556 place count 95 transition count 270
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 26 with 24 rules applied. Total rules applied 9580 place count 95 transition count 270
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9591 place count 84 transition count 204
Ensure Unique test removed 1 places
Iterating global reduction 26 with 12 rules applied. Total rules applied 9603 place count 83 transition count 204
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9614 place count 83 transition count 193
Applied a total of 9614 rules in 5969 ms. Remains 83 /4304 variables (removed 4221) and now considering 193/10343 (removed 10150) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 83 cols
[2024-05-25 12:19:55] [INFO ] Computed 27 invariants in 4 ms
[2024-05-25 12:19:55] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 12:19:55] [INFO ] [Real]Absence check using 3 positive and 24 generalized place invariants in 3 ms returned sat
[2024-05-25 12:19:55] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:19:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-25 12:19:55] [INFO ] [Nat]Absence check using 3 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 12:19:55] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:19:55] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 12:19:55] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), true, (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 248 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 278 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Product exploration explored 100000 steps with 24929 reset in 2432 ms.
Product exploration explored 100000 steps with 24919 reset in 2470 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 503 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 4990 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 311 Pre rules applied. Total rules applied 0 place count 4990 transition count 8290
Deduced a syphon composed of 311 places in 5 ms
Iterating global reduction 0 with 311 rules applied. Total rules applied 311 place count 4990 transition count 8290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 312 place count 4989 transition count 8288
Deduced a syphon composed of 311 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 313 place count 4989 transition count 8288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 314 place count 4988 transition count 8282
Deduced a syphon composed of 311 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 315 place count 4988 transition count 8282
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 336 places in 4 ms
Iterating global reduction 0 with 25 rules applied. Total rules applied 340 place count 4988 transition count 8282
Deduced a syphon composed of 336 places in 5 ms
Applied a total of 340 rules in 2283 ms. Remains 4988 /4990 variables (removed 2) and now considering 8282/8289 (removed 7) transitions.
[2024-05-25 12:20:04] [INFO ] Redundant transitions in 980 ms returned []
[2024-05-25 12:20:04] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
// Phase 1: matrix 7682 rows 4988 cols
[2024-05-25 12:20:05] [INFO ] Computed 989 invariants in 204 ms
[2024-05-25 12:20:10] [INFO ] Dead Transitions using invariants and state equation in 5355 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4988/4990 places, 8282/8289 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8627 ms. Remains : 4988/4990 places, 8282/8289 transitions.
Built C files in :
/tmp/ltsmin9949128621897152305
[2024-05-25 12:20:10] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9949128621897152305
Running compilation step : cd /tmp/ltsmin9949128621897152305;'/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/ltsmin9949128621897152305;'/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/ltsmin9949128621897152305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 4990 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4990/4990 places, 8289/8289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4989 transition count 8288
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4989 transition count 8288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4988 transition count 8282
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4988 transition count 8282
Applied a total of 4 rules in 1286 ms. Remains 4988 /4990 variables (removed 2) and now considering 8282/8289 (removed 7) transitions.
[2024-05-25 12:20:14] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
// Phase 1: matrix 7682 rows 4988 cols
[2024-05-25 12:20:14] [INFO ] Computed 989 invariants in 180 ms
[2024-05-25 12:20:18] [INFO ] Implicit Places using invariants in 4108 ms returned []
[2024-05-25 12:20:18] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
[2024-05-25 12:20:18] [INFO ] Invariant cache hit.
[2024-05-25 12:20:22] [INFO ] Implicit Places using invariants and state equation in 3615 ms returned []
Implicit Place search using SMT with State Equation took 7725 ms to find 0 implicit places.
[2024-05-25 12:20:22] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
[2024-05-25 12:20:22] [INFO ] Invariant cache hit.
[2024-05-25 12:20:27] [INFO ] Dead Transitions using invariants and state equation in 4970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4988/4990 places, 8282/8289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13982 ms. Remains : 4988/4990 places, 8282/8289 transitions.
Built C files in :
/tmp/ltsmin17647965090242304408
[2024-05-25 12:20:27] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17647965090242304408
Running compilation step : cd /tmp/ltsmin17647965090242304408;'/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/ltsmin17647965090242304408;'/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/ltsmin17647965090242304408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:20:30] [INFO ] Flatten gal took : 222 ms
[2024-05-25 12:20:30] [INFO ] Flatten gal took : 213 ms
[2024-05-25 12:20:31] [INFO ] Time to serialize gal into /tmp/LTL12139670538042318532.gal : 327 ms
[2024-05-25 12:20:31] [INFO ] Time to serialize properties into /tmp/LTL13414720254425752358.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/LTL12139670538042318532.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6739118873229437105.hoa' '-atoms' '/tmp/LTL13414720254425752358.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13414720254425752358.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6739118873229437105.hoa
Detected timeout of ITS tools.
[2024-05-25 12:20:46] [INFO ] Flatten gal took : 206 ms
[2024-05-25 12:20:46] [INFO ] Flatten gal took : 218 ms
[2024-05-25 12:20:46] [INFO ] Time to serialize gal into /tmp/LTL3482421592330858527.gal : 46 ms
[2024-05-25 12:20:46] [INFO ] Time to serialize properties into /tmp/LTL4384241890460530686.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/LTL3482421592330858527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4384241890460530686.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(G((!("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))"))||(("((Node23HasAskedItsLeafSetToRx4...534
Formula 0 simplified : XXF("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))" & (!"((Node23HasAskedItsLeafSetToRx4ToReplac...514
Detected timeout of ITS tools.
[2024-05-25 12:21:02] [INFO ] Flatten gal took : 216 ms
[2024-05-25 12:21:02] [INFO ] Applying decomposition
[2024-05-25 12:21:02] [INFO ] Flatten gal took : 226 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/graph3607451088780133799.txt' '-o' '/tmp/graph3607451088780133799.bin' '-w' '/tmp/graph3607451088780133799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3607451088780133799.bin' '-l' '-1' '-v' '-w' '/tmp/graph3607451088780133799.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:21:02] [INFO ] Decomposing Gal with order
[2024-05-25 12:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:21:04] [INFO ] Removed a total of 6129 redundant transitions.
[2024-05-25 12:21:04] [INFO ] Flatten gal took : 767 ms
[2024-05-25 12:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2860 labels/synchronizations in 243 ms.
[2024-05-25 12:21:04] [INFO ] Time to serialize gal into /tmp/LTL7558328822776765526.gal : 58 ms
[2024-05-25 12:21:04] [INFO ] Time to serialize properties into /tmp/LTL17777206883872446528.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/LTL7558328822776765526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17777206883872446528.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(G((!("((i5.u7.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i5.u150.LeafSetOfLx5IsSentToNode4>=1))"))||(("((i11.u25.Node23H...615
Formula 0 simplified : XXF("((i5.u7.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i5.u150.LeafSetOfLx5IsSentToNode4>=1))" & (!"((i11.u25.Node23HasAskedI...595
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13947658771801313498
[2024-05-25 12:21:19] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13947658771801313498
Running compilation step : cd /tmp/ltsmin13947658771801313498;'/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/ltsmin13947658771801313498;'/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/ltsmin13947658771801313498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 finished in 297641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 4 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 10 place count 5020 transition count 8096
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 636 place count 4707 transition count 8096
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 651 place count 4692 transition count 8051
Iterating global reduction 2 with 15 rules applied. Total rules applied 666 place count 4692 transition count 8051
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 666 place count 4692 transition count 8048
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 672 place count 4689 transition count 8048
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 681 place count 4680 transition count 7994
Iterating global reduction 2 with 9 rules applied. Total rules applied 690 place count 4680 transition count 7994
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 748 place count 4651 transition count 7965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 753 place count 4646 transition count 7960
Iterating global reduction 2 with 5 rules applied. Total rules applied 758 place count 4646 transition count 7960
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 758 place count 4646 transition count 7956
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 766 place count 4642 transition count 7956
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 771 place count 4637 transition count 7926
Iterating global reduction 2 with 5 rules applied. Total rules applied 776 place count 4637 transition count 7926
Applied a total of 776 rules in 3005 ms. Remains 4637 /5025 variables (removed 388) and now considering 7926/8414 (removed 488) transitions.
[2024-05-25 12:21:25] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2024-05-25 12:21:25] [INFO ] Computed 989 invariants in 187 ms
[2024-05-25 12:21:30] [INFO ] Implicit Places using invariants in 4982 ms returned []
[2024-05-25 12:21:30] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:21:30] [INFO ] Invariant cache hit.
[2024-05-25 12:21:34] [INFO ] Implicit Places using invariants and state equation in 3515 ms returned []
Implicit Place search using SMT with State Equation took 8498 ms to find 0 implicit places.
[2024-05-25 12:21:35] [INFO ] Redundant transitions in 849 ms returned []
[2024-05-25 12:21:35] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:21:35] [INFO ] Invariant cache hit.
[2024-05-25 12:21:39] [INFO ] Dead Transitions using invariants and state equation in 4305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4637/5025 places, 7926/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16667 ms. Remains : 4637/5025 places, 7926/8414 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1030 1) (GEQ s2280 1)), p1:(AND (GEQ s1954 1) (GEQ s2750 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2296 reset in 1175 ms.
Product exploration explored 100000 steps with 2294 reset in 1230 ms.
Computed a total of 2038 stabilizing places and 2750 stable transitions
Computed a total of 2038 stabilizing places and 2750 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22798 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22798 steps, saw 10659 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:21:45] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:21:45] [INFO ] Invariant cache hit.
[2024-05-25 12:21:46] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:21:46] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 281 ms returned sat
[2024-05-25 12:21:46] [INFO ] After 1075ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 12:21:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 12:21:47] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 280 ms returned sat
[2024-05-25 12:21:52] [INFO ] After 4831ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 12:21:52] [INFO ] State equation strengthened by 2852 read => feed constraints.
[2024-05-25 12:21:54] [INFO ] After 2148ms SMT Verify possible using 2852 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 12:22:01] [INFO ] Deduced a trap composed of 495 places in 4560 ms of which 5 ms to minimize.
[2024-05-25 12:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5013 ms
[2024-05-25 12:22:01] [INFO ] After 8840ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1602 ms.
[2024-05-25 12:22:03] [INFO ] After 16415ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4637/4637 places, 7926/7926 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4637 transition count 10340
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4301 transition count 10340
Applied a total of 672 rules in 1238 ms. Remains 4301 /4637 variables (removed 336) and now considering 10340/7926 (removed -2414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1238 ms. Remains : 4301/4637 places, 10340/7926 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21309 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21309 steps, saw 9783 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:22:07] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 12:22:08] [INFO ] Computed 989 invariants in 229 ms
[2024-05-25 12:22:08] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-05-25 12:22:09] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 256 ms returned sat
[2024-05-25 12:22:09] [INFO ] After 992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:22:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2024-05-25 12:22:10] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 277 ms returned sat
[2024-05-25 12:22:16] [INFO ] After 5920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:22:16] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:22:20] [INFO ] After 4671ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:22:26] [INFO ] Deduced a trap composed of 587 places in 4649 ms of which 5 ms to minimize.
[2024-05-25 12:22:32] [INFO ] Deduced a trap composed of 227 places in 5216 ms of which 4 ms to minimize.
[2024-05-25 12:22:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10693 ms
[2024-05-25 12:22:39] [INFO ] Deduced a trap composed of 481 places in 4951 ms of which 11 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:22:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:22:39] [INFO ] After 29993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 550 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 572 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 12:22:40] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 12:22:40] [INFO ] Invariant cache hit.
[2024-05-25 12:22:49] [INFO ] Implicit Places using invariants in 9219 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2511, 2517, 2525, 2535, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2562, 2570, 2576, 2580, 2582, 2584, 2586, 2588, 2590, 2592, 2607, 2613, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2637, 2643, 2651, 2661, 2673, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2704, 2714, 2722, 2728, 2732, 2734, 2736, 2738, 2740, 2742, 2757, 2763, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2773, 2775, 2777, 2779, 2781, 2785, 2791, 2799, 2809, 2821, 2835, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2870, 2882, 2892, 2900, 2906, 2910, 2912, 2914, 2916, 2918, 2933, 2939, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2949, 2951, 2953, 2955, 2959, 2965, 2973, 2983, 2995, 3009, 3025, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3064, 3078, 3090, 3100, 3108, 3114, 3118, 3120, 3122, 3124, 3139, 3145, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3155, 3157, 3159, 3163, 3169, 3177, 3187, 3199, 3213, 3229, 3247, 3266, 3267, 3268, 3269, 3270, 3271, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360, 3362, 3364, 3379, 3385, 3387, 3388, 3389, 3390, 3391, 3392, 3393, 3395, 3397, 3401, 3407, 3415, 3425, 3437, 3451, 3467, 3485, 3505, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3552, 3570, 3586, 3600, 3612, 3622, 3630, 3636, 3640, 3642, 3657, 3659, 3662, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3672, 3676, 3682, 3690, 3700, 3712, 3726, 3742, 3760, 3780, 3802, 3825, 3826, 3827, 3828, 3829, 3830, 3831, 3853, 3873, 3891, 3907, 3921, 3933, 3943, 3951, 3957, 3961, 3976]
Discarding 926 places :
Implicit Place search using SMT only with invariants took 9235 ms to find 926 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3375/4301 places, 10340/10340 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3087 transition count 10052
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3087 transition count 10052
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 2799 transition count 9764
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 2799 transition count 9764
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 2799 transition count 9761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 2796 transition count 9761
Applied a total of 1158 rules in 1423 ms. Remains 2796 /3375 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2024-05-25 12:22:50] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2796 cols
[2024-05-25 12:22:51] [INFO ] Computed 63 invariants in 162 ms
[2024-05-25 12:22:55] [INFO ] Implicit Places using invariants in 4342 ms returned [1373, 1517]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4356 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 492 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16080 ms. Remains : 2794/4301 places, 9761/10340 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 24533 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24533 steps, saw 10462 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:22:59] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 12:22:59] [INFO ] Computed 61 invariants in 127 ms
[2024-05-25 12:23:00] [INFO ] [Real]Absence check using 47 positive place invariants in 40 ms returned sat
[2024-05-25 12:23:00] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-25 12:23:00] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:23:00] [INFO ] [Nat]Absence check using 47 positive place invariants in 36 ms returned sat
[2024-05-25 12:23:00] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 13 ms returned sat
[2024-05-25 12:23:05] [INFO ] After 4698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:23:05] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:23:14] [INFO ] After 9211ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:23:18] [INFO ] Deduced a trap composed of 286 places in 2002 ms of which 3 ms to minimize.
[2024-05-25 12:23:21] [INFO ] Deduced a trap composed of 135 places in 2187 ms of which 3 ms to minimize.
[2024-05-25 12:23:23] [INFO ] Deduced a trap composed of 134 places in 2204 ms of which 3 ms to minimize.
[2024-05-25 12:23:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7315 ms
[2024-05-25 12:23:27] [INFO ] Deduced a trap composed of 2 places in 2524 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:23:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:23:27] [INFO ] After 27564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 499 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 498 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-25 12:23:28] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:23:28] [INFO ] Invariant cache hit.
[2024-05-25 12:23:32] [INFO ] Implicit Places using invariants in 4146 ms returned []
[2024-05-25 12:23:32] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:23:32] [INFO ] Invariant cache hit.
[2024-05-25 12:23:39] [INFO ] Implicit Places using invariants and state equation in 6644 ms returned []
Implicit Place search using SMT with State Equation took 10799 ms to find 0 implicit places.
[2024-05-25 12:23:40] [INFO ] Redundant transitions in 1268 ms returned []
[2024-05-25 12:23:40] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:23:40] [INFO ] Invariant cache hit.
[2024-05-25 12:23:45] [INFO ] Dead Transitions using invariants and state equation in 5093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17666 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 657 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Support contains 2 out of 4637 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4637/4637 places, 7926/7926 transitions.
Applied a total of 0 rules in 525 ms. Remains 4637 /4637 variables (removed 0) and now considering 7926/7926 (removed 0) transitions.
[2024-05-25 12:23:47] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2024-05-25 12:23:47] [INFO ] Computed 989 invariants in 182 ms
[2024-05-25 12:23:51] [INFO ] Implicit Places using invariants in 4825 ms returned []
[2024-05-25 12:23:51] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:23:51] [INFO ] Invariant cache hit.
[2024-05-25 12:23:55] [INFO ] Implicit Places using invariants and state equation in 3369 ms returned []
Implicit Place search using SMT with State Equation took 8197 ms to find 0 implicit places.
[2024-05-25 12:23:56] [INFO ] Redundant transitions in 839 ms returned []
[2024-05-25 12:23:56] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:23:56] [INFO ] Invariant cache hit.
[2024-05-25 12:24:00] [INFO ] Dead Transitions using invariants and state equation in 4412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13981 ms. Remains : 4637/4637 places, 7926/7926 transitions.
Computed a total of 2038 stabilizing places and 2750 stable transitions
Computed a total of 2038 stabilizing places and 2750 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25026 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25026 steps, saw 11670 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:24:03] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:24:03] [INFO ] Invariant cache hit.
[2024-05-25 12:24:04] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 12:24:04] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 280 ms returned sat
[2024-05-25 12:24:08] [INFO ] After 3718ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:24:08] [INFO ] State equation strengthened by 2852 read => feed constraints.
[2024-05-25 12:24:08] [INFO ] After 499ms SMT Verify possible using 2852 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:24:08] [INFO ] After 5112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:24:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 12:24:09] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 290 ms returned sat
[2024-05-25 12:24:13] [INFO ] After 3744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:24:14] [INFO ] After 1110ms SMT Verify possible using 2852 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:24:19] [INFO ] Deduced a trap composed of 665 places in 4557 ms of which 7 ms to minimize.
[2024-05-25 12:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5002 ms
[2024-05-25 12:24:19] [INFO ] After 6260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-25 12:24:20] [INFO ] After 11115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4637/4637 places, 7926/7926 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4637 transition count 10340
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4301 transition count 10340
Applied a total of 672 rules in 1211 ms. Remains 4301 /4637 variables (removed 336) and now considering 10340/7926 (removed -2414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1211 ms. Remains : 4301/4637 places, 10340/7926 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22985 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22985 steps, saw 10525 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:24:24] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 12:24:24] [INFO ] Computed 989 invariants in 220 ms
[2024-05-25 12:24:25] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 12:24:25] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 260 ms returned sat
[2024-05-25 12:24:25] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:24:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2024-05-25 12:24:26] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 265 ms returned sat
[2024-05-25 12:24:31] [INFO ] After 5037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:24:31] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:24:36] [INFO ] After 4460ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:24:41] [INFO ] Deduced a trap composed of 317 places in 5295 ms of which 5 ms to minimize.
[2024-05-25 12:24:46] [INFO ] Deduced a trap composed of 451 places in 4837 ms of which 5 ms to minimize.
[2024-05-25 12:24:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10996 ms
[2024-05-25 12:24:47] [INFO ] After 15659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 340 ms.
[2024-05-25 12:24:47] [INFO ] After 21906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 568 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 554 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 12:24:48] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 12:24:48] [INFO ] Invariant cache hit.
[2024-05-25 12:24:52] [INFO ] Implicit Places using invariants in 4048 ms returned []
Implicit Place search using SMT only with invariants took 4048 ms to find 0 implicit places.
[2024-05-25 12:24:52] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 12:24:52] [INFO ] Invariant cache hit.
[2024-05-25 12:24:58] [INFO ] Dead Transitions using invariants and state equation in 5651 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10255 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Graph (trivial) has 3327 edges and 4301 vertex of which 25 / 4301 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 32005 edges and 4277 vertex of which 4255 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3869 transition count 8611
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3627 transition count 8130
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3386 transition count 7690
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3146 transition count 7292
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2946 transition count 6932
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2748 transition count 6610
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2586 transition count 6322
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2426 transition count 6068
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2298 transition count 5844
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2172 transition count 5650
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2074 transition count 5482
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 237 rules applied. Total rules applied 5406 place count 1978 transition count 5341
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5595 place count 1907 transition count 5223
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5760 place count 1838 transition count 5127
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5888 place count 1789 transition count 5048
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5997 place count 1742 transition count 4986
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6077 place count 1710 transition count 4938
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6141 place count 1680 transition count 4904
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6183 place count 1662 transition count 4880
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6213 place count 1646 transition count 4866
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6229 place count 1638 transition count 4858
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6238 place count 1632 transition count 4855
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6242 place count 1629 transition count 4854
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6242 place count 1629 transition count 4554
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 300 places
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 23 with 900 rules applied. Total rules applied 7142 place count 1029 transition count 4554
Discarding 312 places :
Symmetric choice reduction at 23 with 312 rule applications. Total rules 7454 place count 717 transition count 4242
Iterating global reduction 23 with 312 rules applied. Total rules applied 7766 place count 717 transition count 4242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7766 place count 717 transition count 4241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7768 place count 716 transition count 4241
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8319 place count 165 transition count 935
Iterating global reduction 23 with 551 rules applied. Total rules applied 8870 place count 165 transition count 935
Ensure Unique test removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 23 with 551 rules applied. Total rules applied 9421 place count 165 transition count 384
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 24 with 52 rules applied. Total rules applied 9473 place count 138 transition count 359
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 9474 place count 138 transition count 358
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 24 with 13 rules applied. Total rules applied 9487 place count 138 transition count 345
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 9500 place count 125 transition count 345
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9522 place count 103 transition count 213
Ensure Unique test removed 21 places
Iterating global reduction 25 with 43 rules applied. Total rules applied 9565 place count 82 transition count 213
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9587 place count 82 transition count 191
Discarding 21 places :
Symmetric choice reduction at 26 with 21 rule applications. Total rules 9608 place count 61 transition count 65
Iterating global reduction 26 with 21 rules applied. Total rules applied 9629 place count 61 transition count 65
Discarding 20 places :
Symmetric choice reduction at 26 with 20 rule applications. Total rules 9649 place count 41 transition count 45
Iterating global reduction 26 with 20 rules applied. Total rules applied 9669 place count 41 transition count 45
Applied a total of 9669 rules in 5831 ms. Remains 41 /4301 variables (removed 4260) and now considering 45/10340 (removed 10295) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 41 cols
[2024-05-25 12:25:04] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 12:25:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:25:04] [INFO ] [Real]Absence check using 4 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-25 12:25:04] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:25:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:25:04] [INFO ] [Nat]Absence check using 4 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-25 12:25:04] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:25:04] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 12:25:04] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 2295 reset in 1112 ms.
Product exploration explored 100000 steps with 2295 reset in 1151 ms.
Built C files in :
/tmp/ltsmin16954482490846560764
[2024-05-25 12:25:06] [INFO ] Too many transitions (7926) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:25:06] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16954482490846560764
Running compilation step : cd /tmp/ltsmin16954482490846560764;'/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/ltsmin16954482490846560764;'/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/ltsmin16954482490846560764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 4637 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4637/4637 places, 7926/7926 transitions.
Applied a total of 0 rules in 541 ms. Remains 4637 /4637 variables (removed 0) and now considering 7926/7926 (removed 0) transitions.
[2024-05-25 12:25:10] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2024-05-25 12:25:10] [INFO ] Computed 989 invariants in 186 ms
[2024-05-25 12:25:15] [INFO ] Implicit Places using invariants in 4948 ms returned []
[2024-05-25 12:25:15] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:25:15] [INFO ] Invariant cache hit.
[2024-05-25 12:25:18] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 8415 ms to find 0 implicit places.
[2024-05-25 12:25:19] [INFO ] Redundant transitions in 826 ms returned []
[2024-05-25 12:25:19] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:25:19] [INFO ] Invariant cache hit.
[2024-05-25 12:25:24] [INFO ] Dead Transitions using invariants and state equation in 4412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14203 ms. Remains : 4637/4637 places, 7926/7926 transitions.
Built C files in :
/tmp/ltsmin13340565158273534366
[2024-05-25 12:25:24] [INFO ] Too many transitions (7926) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:25:24] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13340565158273534366
Running compilation step : cd /tmp/ltsmin13340565158273534366;'/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/ltsmin13340565158273534366;'/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/ltsmin13340565158273534366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:25:27] [INFO ] Flatten gal took : 218 ms
[2024-05-25 12:25:27] [INFO ] Flatten gal took : 218 ms
[2024-05-25 12:25:27] [INFO ] Time to serialize gal into /tmp/LTL5716448486182788627.gal : 32 ms
[2024-05-25 12:25:27] [INFO ] Time to serialize properties into /tmp/LTL15015897931324995474.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5716448486182788627.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12312919785306640561.hoa' '-atoms' '/tmp/LTL15015897931324995474.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15015897931324995474.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12312919785306640561.hoa
Detected timeout of ITS tools.
[2024-05-25 12:25:43] [INFO ] Flatten gal took : 208 ms
[2024-05-25 12:25:43] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:25:43] [INFO ] Time to serialize gal into /tmp/LTL8586641478536436637.gal : 33 ms
[2024-05-25 12:25:43] [INFO ] Time to serialize properties into /tmp/LTL11527430856887927018.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/LTL8586641478536436637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11527430856887927018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(Node14NotifyThatHeIsActive<1))"))||(G("((NodesCanDetectThatNode10Ha...232
Formula 0 simplified : G(F!"((Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(Node14NotifyThatHeIsActive<1))" & F!"((NodesCanDetectThatNode10HasCra...224
Detected timeout of ITS tools.
[2024-05-25 12:25:58] [INFO ] Flatten gal took : 213 ms
[2024-05-25 12:25:58] [INFO ] Applying decomposition
[2024-05-25 12:25:58] [INFO ] Flatten gal took : 214 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/graph6172904865487607951.txt' '-o' '/tmp/graph6172904865487607951.bin' '-w' '/tmp/graph6172904865487607951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6172904865487607951.bin' '-l' '-1' '-v' '-w' '/tmp/graph6172904865487607951.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:25:59] [INFO ] Decomposing Gal with order
[2024-05-25 12:25:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:26:00] [INFO ] Removed a total of 6625 redundant transitions.
[2024-05-25 12:26:00] [INFO ] Flatten gal took : 1121 ms
[2024-05-25 12:26:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4954 labels/synchronizations in 322 ms.
[2024-05-25 12:26:01] [INFO ] Time to serialize gal into /tmp/LTL12750013422184300703.gal : 58 ms
[2024-05-25 12:26:01] [INFO ] Time to serialize properties into /tmp/LTL17283229896488187807.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/LTL12750013422184300703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17283229896488187807.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 : !((F((G("((i13.u86.Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(i13.u176.Node14NotifyThatHeIsActive<1))"))||(G("((i13.u180....267
Formula 0 simplified : G(F!"((i13.u86.Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(i13.u176.Node14NotifyThatHeIsActive<1))" & F!"((i13.u180.Node...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18039745353269853539
[2024-05-25 12:26:16] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18039745353269853539
Running compilation step : cd /tmp/ltsmin18039745353269853539;'/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/ltsmin18039745353269853539;'/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/ltsmin18039745353269853539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 finished in 296884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 6 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5006 transition count 8370
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5006 transition count 8370
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 52 place count 4992 transition count 8311
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 4992 transition count 8311
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 4987 transition count 8281
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 4987 transition count 8281
Applied a total of 76 rules in 1738 ms. Remains 4987 /5025 variables (removed 38) and now considering 8281/8414 (removed 133) transitions.
[2024-05-25 12:26:21] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2024-05-25 12:26:21] [INFO ] Computed 989 invariants in 174 ms
[2024-05-25 12:26:25] [INFO ] Implicit Places using invariants in 3613 ms returned []
[2024-05-25 12:26:25] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
[2024-05-25 12:26:25] [INFO ] Invariant cache hit.
[2024-05-25 12:26:30] [INFO ] Implicit Places using invariants and state equation in 5539 ms returned []
Implicit Place search using SMT with State Equation took 9152 ms to find 0 implicit places.
[2024-05-25 12:26:30] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
[2024-05-25 12:26:30] [INFO ] Invariant cache hit.
[2024-05-25 12:26:36] [INFO ] Dead Transitions using invariants and state equation in 5489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4987/5025 places, 8281/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16379 ms. Remains : 4987/5025 places, 8281/8414 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s371 1) (GEQ s1742 1) (GEQ s1744 1)), p0:(AND (GEQ s2218 1) (GEQ s4731 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 60 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-04 finished in 16531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5005 transition count 8364
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5005 transition count 8364
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 4991 transition count 8305
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 4991 transition count 8305
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 4986 transition count 8275
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 4986 transition count 8275
Applied a total of 78 rules in 1788 ms. Remains 4986 /5025 variables (removed 39) and now considering 8275/8414 (removed 139) transitions.
[2024-05-25 12:26:37] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
// Phase 1: matrix 7675 rows 4986 cols
[2024-05-25 12:26:38] [INFO ] Computed 989 invariants in 168 ms
[2024-05-25 12:26:41] [INFO ] Implicit Places using invariants in 3634 ms returned []
[2024-05-25 12:26:41] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
[2024-05-25 12:26:41] [INFO ] Invariant cache hit.
[2024-05-25 12:26:46] [INFO ] Implicit Places using invariants and state equation in 4425 ms returned []
Implicit Place search using SMT with State Equation took 8059 ms to find 0 implicit places.
[2024-05-25 12:26:46] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
[2024-05-25 12:26:46] [INFO ] Invariant cache hit.
[2024-05-25 12:26:51] [INFO ] Dead Transitions using invariants and state equation in 5183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4986/5025 places, 8275/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15032 ms. Remains : 4986/5025 places, 8275/8414 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s860 1) (GEQ s3084 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 finished in 15150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5005 transition count 8364
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5005 transition count 8364
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 4991 transition count 8305
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 4991 transition count 8305
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 4986 transition count 8275
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 4986 transition count 8275
Applied a total of 78 rules in 1714 ms. Remains 4986 /5025 variables (removed 39) and now considering 8275/8414 (removed 139) transitions.
[2024-05-25 12:26:53] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
[2024-05-25 12:26:53] [INFO ] Invariant cache hit.
[2024-05-25 12:26:57] [INFO ] Implicit Places using invariants in 4475 ms returned []
[2024-05-25 12:26:57] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
[2024-05-25 12:26:57] [INFO ] Invariant cache hit.
[2024-05-25 12:27:02] [INFO ] Implicit Places using invariants and state equation in 4608 ms returned []
Implicit Place search using SMT with State Equation took 9085 ms to find 0 implicit places.
[2024-05-25 12:27:02] [INFO ] Flow matrix only has 7675 transitions (discarded 600 similar events)
[2024-05-25 12:27:02] [INFO ] Invariant cache hit.
[2024-05-25 12:27:07] [INFO ] Dead Transitions using invariants and state equation in 5154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4986/5025 places, 8275/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15954 ms. Remains : 4986/5025 places, 8275/8414 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1646 1) (GEQ s2096 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 finished in 16075 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 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 10 place count 5020 transition count 8096
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 636 place count 4707 transition count 8096
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 651 place count 4692 transition count 8051
Iterating global reduction 2 with 15 rules applied. Total rules applied 666 place count 4692 transition count 8051
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 666 place count 4692 transition count 8048
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 672 place count 4689 transition count 8048
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 681 place count 4680 transition count 7994
Iterating global reduction 2 with 9 rules applied. Total rules applied 690 place count 4680 transition count 7994
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 748 place count 4651 transition count 7965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 753 place count 4646 transition count 7960
Iterating global reduction 2 with 5 rules applied. Total rules applied 758 place count 4646 transition count 7960
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 758 place count 4646 transition count 7956
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 766 place count 4642 transition count 7956
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 771 place count 4637 transition count 7926
Iterating global reduction 2 with 5 rules applied. Total rules applied 776 place count 4637 transition count 7926
Applied a total of 776 rules in 2960 ms. Remains 4637 /5025 variables (removed 388) and now considering 7926/8414 (removed 488) transitions.
[2024-05-25 12:27:10] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2024-05-25 12:27:10] [INFO ] Computed 989 invariants in 181 ms
[2024-05-25 12:27:15] [INFO ] Implicit Places using invariants in 4960 ms returned []
[2024-05-25 12:27:15] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:27:15] [INFO ] Invariant cache hit.
[2024-05-25 12:27:19] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned []
Implicit Place search using SMT with State Equation took 8853 ms to find 0 implicit places.
[2024-05-25 12:27:20] [INFO ] Redundant transitions in 852 ms returned []
[2024-05-25 12:27:20] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
[2024-05-25 12:27:20] [INFO ] Invariant cache hit.
[2024-05-25 12:27:24] [INFO ] Dead Transitions using invariants and state equation in 4336 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4637/5025 places, 7926/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17012 ms. Remains : 4637/5025 places, 7926/8414 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1948 1) (GEQ s4448 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 42 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-08 finished in 17082 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))'
Support contains 1 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 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 0 with 4 rules applied. Total rules applied 4 place count 5025 transition count 8410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5021 transition count 8410
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 8 place count 5021 transition count 8097
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 634 place count 4708 transition count 8097
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 649 place count 4693 transition count 8052
Iterating global reduction 2 with 15 rules applied. Total rules applied 664 place count 4693 transition count 8052
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 664 place count 4693 transition count 8049
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 670 place count 4690 transition count 8049
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 679 place count 4681 transition count 7995
Iterating global reduction 2 with 9 rules applied. Total rules applied 688 place count 4681 transition count 7995
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 746 place count 4652 transition count 7966
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 750 place count 4648 transition count 7962
Iterating global reduction 2 with 4 rules applied. Total rules applied 754 place count 4648 transition count 7962
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 754 place count 4648 transition count 7959
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 760 place count 4645 transition count 7959
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 764 place count 4641 transition count 7935
Iterating global reduction 2 with 4 rules applied. Total rules applied 768 place count 4641 transition count 7935
Applied a total of 768 rules in 2913 ms. Remains 4641 /5025 variables (removed 384) and now considering 7935/8414 (removed 479) transitions.
[2024-05-25 12:27:27] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:27:27] [INFO ] Computed 989 invariants in 179 ms
[2024-05-25 12:27:31] [INFO ] Implicit Places using invariants in 3641 ms returned []
[2024-05-25 12:27:31] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:27:31] [INFO ] Invariant cache hit.
[2024-05-25 12:27:34] [INFO ] Implicit Places using invariants and state equation in 3546 ms returned []
Implicit Place search using SMT with State Equation took 7187 ms to find 0 implicit places.
[2024-05-25 12:27:35] [INFO ] Redundant transitions in 849 ms returned []
[2024-05-25 12:27:35] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:27:35] [INFO ] Invariant cache hit.
[2024-05-25 12:27:39] [INFO ] Dead Transitions using invariants and state equation in 4489 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5025 places, 7935/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15444 ms. Remains : 4641/5025 places, 7935/8414 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09 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}]], initial=1, aps=[p0:(LT s2075 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2297 reset in 1143 ms.
Product exploration explored 100000 steps with 2297 reset in 1162 ms.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24907 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24907 steps, saw 11618 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:27:45] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:27:45] [INFO ] Invariant cache hit.
[2024-05-25 12:27:46] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 12:27:46] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2024-05-25 12:27:50] [INFO ] After 3816ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:27:50] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:27:50] [INFO ] After 421ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:27:50] [INFO ] After 5116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:27:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 12:27:51] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 277 ms returned sat
[2024-05-25 12:27:55] [INFO ] After 3812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:27:56] [INFO ] After 900ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:01] [INFO ] Deduced a trap composed of 474 places in 4551 ms of which 4 ms to minimize.
[2024-05-25 12:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5163 ms
[2024-05-25 12:28:01] [INFO ] After 6203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-25 12:28:01] [INFO ] After 11086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 4641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4304 transition count 10343
Applied a total of 699 rules in 1899 ms. Remains 4304 /4641 variables (removed 337) and now considering 10343/7935 (removed -2408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1900 ms. Remains : 4304/4641 places, 10343/7935 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22889 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22889 steps, saw 10489 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:28:07] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:28:07] [INFO ] Computed 989 invariants in 229 ms
[2024-05-25 12:28:08] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 12:28:08] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 274 ms returned sat
[2024-05-25 12:28:08] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:28:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:28:09] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 295 ms returned sat
[2024-05-25 12:28:13] [INFO ] After 4588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:13] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:28:15] [INFO ] After 1576ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:20] [INFO ] Deduced a trap composed of 213 places in 5079 ms of which 5 ms to minimize.
[2024-05-25 12:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6302 ms
[2024-05-25 12:28:21] [INFO ] After 8073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 287 ms.
[2024-05-25 12:28:22] [INFO ] After 13917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 559 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 565 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
[2024-05-25 12:28:23] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:28:23] [INFO ] Invariant cache hit.
[2024-05-25 12:28:27] [INFO ] Implicit Places using invariants in 4325 ms returned []
Implicit Place search using SMT only with invariants took 4331 ms to find 0 implicit places.
[2024-05-25 12:28:27] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:28:27] [INFO ] Invariant cache hit.
[2024-05-25 12:28:33] [INFO ] Dead Transitions using invariants and state equation in 5741 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10639 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Graph (trivial) has 3329 edges and 4304 vertex of which 25 / 4304 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 32010 edges and 4280 vertex of which 4258 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3872 transition count 8614
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3630 transition count 8133
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3389 transition count 7693
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3149 transition count 7295
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2949 transition count 6935
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2751 transition count 6613
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2589 transition count 6325
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2429 transition count 6071
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2301 transition count 5847
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2175 transition count 5653
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2077 transition count 5485
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 1981 transition count 5343
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 1909 transition count 5223
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1839 transition count 5125
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1789 transition count 5045
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1741 transition count 4983
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1709 transition count 4935
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1679 transition count 4901
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1661 transition count 4877
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1645 transition count 4863
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1637 transition count 4855
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1630 transition count 4853
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1628 transition count 4853
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6250 place count 1628 transition count 4553
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 23 with 899 rules applied. Total rules applied 7149 place count 1029 transition count 4553
Discarding 311 places :
Symmetric choice reduction at 23 with 311 rule applications. Total rules 7460 place count 718 transition count 4242
Iterating global reduction 23 with 311 rules applied. Total rules applied 7771 place count 718 transition count 4242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7771 place count 718 transition count 4241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7773 place count 717 transition count 4241
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8313 place count 177 transition count 1001
Iterating global reduction 23 with 540 rules applied. Total rules applied 8853 place count 177 transition count 1001
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9393 place count 177 transition count 461
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9444 place count 151 transition count 436
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9456 place count 151 transition count 424
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9468 place count 139 transition count 424
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9490 place count 117 transition count 292
Ensure Unique test removed 12 places
Iterating global reduction 25 with 34 rules applied. Total rules applied 9524 place count 105 transition count 292
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9546 place count 105 transition count 270
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9557 place count 94 transition count 204
Iterating global reduction 26 with 11 rules applied. Total rules applied 9568 place count 94 transition count 204
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9579 place count 83 transition count 193
Iterating global reduction 26 with 11 rules applied. Total rules applied 9590 place count 83 transition count 193
Applied a total of 9590 rules in 5988 ms. Remains 83 /4304 variables (removed 4221) and now considering 193/10343 (removed 10150) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 83 cols
[2024-05-25 12:28:39] [INFO ] Computed 27 invariants in 3 ms
[2024-05-25 12:28:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:28:39] [INFO ] [Real]Absence check using 3 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 12:28:39] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:28:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:28:39] [INFO ] [Nat]Absence check using 3 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 12:28:39] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:39] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 12:28:39] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Support contains 1 out of 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 548 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:28:40] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:28:40] [INFO ] Computed 989 invariants in 179 ms
[2024-05-25 12:28:44] [INFO ] Implicit Places using invariants in 3769 ms returned []
[2024-05-25 12:28:44] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:28:44] [INFO ] Invariant cache hit.
[2024-05-25 12:28:47] [INFO ] Implicit Places using invariants and state equation in 3536 ms returned []
Implicit Place search using SMT with State Equation took 7307 ms to find 0 implicit places.
[2024-05-25 12:28:48] [INFO ] Redundant transitions in 858 ms returned []
[2024-05-25 12:28:48] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:28:48] [INFO ] Invariant cache hit.
[2024-05-25 12:28:53] [INFO ] Dead Transitions using invariants and state equation in 4463 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13183 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24542 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24542 steps, saw 11449 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:28:56] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:28:56] [INFO ] Invariant cache hit.
[2024-05-25 12:28:56] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:28:57] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 285 ms returned sat
[2024-05-25 12:29:01] [INFO ] After 3658ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:29:01] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:29:01] [INFO ] After 402ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:29:01] [INFO ] After 4961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:29:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:29:02] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 271 ms returned sat
[2024-05-25 12:29:06] [INFO ] After 3798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:29:06] [INFO ] After 890ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:29:11] [INFO ] Deduced a trap composed of 474 places in 4489 ms of which 5 ms to minimize.
[2024-05-25 12:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5093 ms
[2024-05-25 12:29:12] [INFO ] After 6136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 222 ms.
[2024-05-25 12:29:12] [INFO ] After 10987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 4641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4304 transition count 10343
Applied a total of 699 rules in 1767 ms. Remains 4304 /4641 variables (removed 337) and now considering 10343/7935 (removed -2408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 4304/4641 places, 10343/7935 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23438 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23438 steps, saw 10732 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:29:17] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:29:17] [INFO ] Computed 989 invariants in 219 ms
[2024-05-25 12:29:18] [INFO ] [Real]Absence check using 49 positive place invariants in 61 ms returned sat
[2024-05-25 12:29:18] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 255 ms returned sat
[2024-05-25 12:29:18] [INFO ] After 789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:29:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 12:29:19] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 258 ms returned sat
[2024-05-25 12:29:23] [INFO ] After 4361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:29:23] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:29:25] [INFO ] After 1410ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:29:30] [INFO ] Deduced a trap composed of 213 places in 4775 ms of which 5 ms to minimize.
[2024-05-25 12:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5970 ms
[2024-05-25 12:29:31] [INFO ] After 7566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 287 ms.
[2024-05-25 12:29:31] [INFO ] After 13048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 557 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 557 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
[2024-05-25 12:29:32] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:29:32] [INFO ] Invariant cache hit.
[2024-05-25 12:29:41] [INFO ] Implicit Places using invariants in 9138 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1877, 1879, 1880, 1881, 1882, 1883, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1909, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1937, 1952, 1954, 1957, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2015, 2030, 2036, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2094, 2109, 2115, 2117, 2118, 2119, 2120, 2121, 2122, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2145, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2189, 2195, 2197, 2198, 2199, 2200, 2201, 2202, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2227, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2275, 2281, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2307, 2311, 2317, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2336, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2356, 2371, 2377, 2379, 2380, 2381, 2382, 2383, 2384, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2401, 2405, 2411, 2419, 2428, 2429, 2430, 2431, 2432, 2433, 2434, 2442, 2448, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2466, 2481, 2487, 2489, 2490, 2491, 2492, 2493, 2494, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2509, 2513, 2519, 2527, 2537, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2564, 2572, 2578, 2582, 2584, 2586, 2588, 2590, 2592, 2594, 2609, 2615, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2625, 2627, 2629, 2631, 2633, 2635, 2639, 2645, 2653, 2663, 2675, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2706, 2716, 2724, 2730, 2734, 2736, 2738, 2740, 2742, 2744, 2759, 2765, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2775, 2777, 2779, 2781, 2783, 2787, 2793, 2801, 2811, 2823, 2837, 2852, 2853, 2854, 2855, 2856, 2857, 2858, 2872, 2884, 2894, 2902, 2908, 2912, 2914, 2916, 2918, 2920, 2935, 2941, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2951, 2953, 2955, 2957, 2961, 2967, 2975, 2985, 2997, 3011, 3027, 3044, 3045, 3046, 3047, 3048, 3049, 3050, 3066, 3080, 3092, 3102, 3110, 3116, 3120, 3122, 3124, 3126, 3141, 3147, 3149, 3150, 3151, 3152, 3153, 3154, 3155, 3157, 3159, 3161, 3165, 3171, 3179, 3189, 3201, 3215, 3231, 3249, 3268, 3269, 3270, 3271, 3272, 3273, 3274, 3292, 3308, 3322, 3334, 3344, 3352, 3358, 3362, 3364, 3366, 3381, 3387, 3389, 3390, 3391, 3392, 3393, 3394, 3395, 3397, 3399, 3403, 3409, 3417, 3427, 3439, 3453, 3469, 3487, 3507, 3528, 3529, 3530, 3531, 3532, 3533, 3534, 3554, 3572, 3588, 3602, 3614, 3624, 3632, 3638, 3642, 3644, 3659, 3661, 3664, 3666, 3667, 3668, 3669, 3670, 3671, 3672, 3674, 3678, 3684, 3692, 3702, 3714, 3728, 3744, 3762, 3782, 3804, 3827, 3828, 3829, 3830, 3831, 3832, 3833, 3855, 3875, 3893, 3909, 3923, 3935, 3945, 3953, 3959, 3963, 3978]
Discarding 925 places :
Implicit Place search using SMT only with invariants took 9154 ms to find 925 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3379/4304 places, 10343/10343 transitions.
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 287 place count 3092 transition count 10056
Iterating global reduction 0 with 287 rules applied. Total rules applied 574 place count 3092 transition count 10056
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 861 place count 2805 transition count 9769
Iterating global reduction 0 with 287 rules applied. Total rules applied 1148 place count 2805 transition count 9769
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1151 place count 2805 transition count 9766
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1154 place count 2802 transition count 9766
Applied a total of 1154 rules in 1399 ms. Remains 2802 /3379 variables (removed 577) and now considering 9766/10343 (removed 577) transitions.
[2024-05-25 12:29:43] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
// Phase 1: matrix 8880 rows 2802 cols
[2024-05-25 12:29:43] [INFO ] Computed 64 invariants in 157 ms
[2024-05-25 12:29:47] [INFO ] Implicit Places using invariants in 4387 ms returned [353, 1344]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4395 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2800/4304 places, 9766/10343 transitions.
Applied a total of 0 rules in 494 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16000 ms. Remains : 2800/4304 places, 9766/10343 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 27219 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27219 steps, saw 11556 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:29:51] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
// Phase 1: matrix 8880 rows 2800 cols
[2024-05-25 12:29:51] [INFO ] Computed 62 invariants in 122 ms
[2024-05-25 12:29:52] [INFO ] [Real]Absence check using 47 positive place invariants in 39 ms returned sat
[2024-05-25 12:29:52] [INFO ] [Real]Absence check using 47 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-25 12:29:54] [INFO ] After 2418ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:29:54] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:29:55] [INFO ] After 547ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:29:55] [INFO ] After 3371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:29:55] [INFO ] [Nat]Absence check using 47 positive place invariants in 37 ms returned sat
[2024-05-25 12:29:55] [INFO ] [Nat]Absence check using 47 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 12:29:57] [INFO ] After 2410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:30:00] [INFO ] After 2999ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:30:02] [INFO ] Deduced a trap composed of 147 places in 1826 ms of which 3 ms to minimize.
[2024-05-25 12:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3294 ms
[2024-05-25 12:30:04] [INFO ] After 6446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-25 12:30:04] [INFO ] After 9406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 498 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 486 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
[2024-05-25 12:30:05] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:30:05] [INFO ] Invariant cache hit.
[2024-05-25 12:30:09] [INFO ] Implicit Places using invariants in 4143 ms returned []
[2024-05-25 12:30:09] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:30:09] [INFO ] Invariant cache hit.
[2024-05-25 12:30:16] [INFO ] Implicit Places using invariants and state equation in 6780 ms returned []
Implicit Place search using SMT with State Equation took 10924 ms to find 0 implicit places.
[2024-05-25 12:30:17] [INFO ] Redundant transitions in 1268 ms returned []
[2024-05-25 12:30:17] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:30:17] [INFO ] Invariant cache hit.
[2024-05-25 12:30:22] [INFO ] Dead Transitions using invariants and state equation in 5051 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17740 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Graph (trivial) has 3042 edges and 2800 vertex of which 25 / 2800 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 11555 edges and 2776 vertex of which 2754 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 24 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 2729 transition count 8037
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 2488 transition count 7556
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 680 rules applied. Total rules applied 1647 place count 2248 transition count 7116
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 598 rules applied. Total rules applied 2245 place count 2048 transition count 6718
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 558 rules applied. Total rules applied 2803 place count 1850 transition count 6358
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 484 rules applied. Total rules applied 3287 place count 1688 transition count 6036
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 448 rules applied. Total rules applied 3735 place count 1528 transition count 5748
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 382 rules applied. Total rules applied 4117 place count 1400 transition count 5494
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4467 place count 1274 transition count 5270
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 292 rules applied. Total rules applied 4759 place count 1176 transition count 5076
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 264 rules applied. Total rules applied 5023 place count 1080 transition count 4908
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 214 rules applied. Total rules applied 5237 place count 1008 transition count 4766
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5427 place count 938 transition count 4646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 148 rules applied. Total rules applied 5575 place count 888 transition count 4548
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5703 place count 840 transition count 4468
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 94 rules applied. Total rules applied 5797 place count 808 transition count 4406
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 78 rules applied. Total rules applied 5875 place count 778 transition count 4358
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 52 rules applied. Total rules applied 5927 place count 760 transition count 4324
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 40 rules applied. Total rules applied 5967 place count 744 transition count 4300
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 22 rules applied. Total rules applied 5989 place count 736 transition count 4286
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 14 rules applied. Total rules applied 6003 place count 730 transition count 4278
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 6008 place count 727 transition count 4276
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 13 Pre rules applied. Total rules applied 6008 place count 727 transition count 4263
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 22 with 26 rules applied. Total rules applied 6034 place count 714 transition count 4263
Discarding 620 places :
Symmetric choice reduction at 22 with 620 rule applications. Total rules 6654 place count 94 transition count 663
Iterating global reduction 22 with 620 rules applied. Total rules applied 7274 place count 94 transition count 663
Ensure Unique test removed 562 transitions
Reduce isomorphic transitions removed 562 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 22 with 574 rules applied. Total rules applied 7848 place count 94 transition count 89
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 23 with 12 rules applied. Total rules applied 7860 place count 82 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 7860 place count 82 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 7862 place count 81 transition count 88
Discarding 20 places :
Symmetric choice reduction at 24 with 20 rule applications. Total rules 7882 place count 61 transition count 59
Iterating global reduction 24 with 20 rules applied. Total rules applied 7902 place count 61 transition count 59
Discarding 9 places :
Symmetric choice reduction at 24 with 9 rule applications. Total rules 7911 place count 52 transition count 50
Iterating global reduction 24 with 9 rules applied. Total rules applied 7920 place count 52 transition count 50
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 24 with 2 rules applied. Total rules applied 7922 place count 51 transition count 49
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 7923 place count 50 transition count 47
Iterating global reduction 24 with 1 rules applied. Total rules applied 7924 place count 50 transition count 47
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 7936 place count 50 transition count 35
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 7948 place count 38 transition count 35
Applied a total of 7948 rules in 2572 ms. Remains 38 /2800 variables (removed 2762) and now considering 35/9766 (removed 9731) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 38 cols
[2024-05-25 12:30:25] [INFO ] Computed 15 invariants in 0 ms
[2024-05-25 12:30:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 12:30:25] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 12:30:25] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:30:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 12:30:25] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 12:30:25] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:30:25] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 12:30:25] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2295 reset in 1115 ms.
Product exploration explored 100000 steps with 2297 reset in 1152 ms.
Built C files in :
/tmp/ltsmin10551001599141159694
[2024-05-25 12:30:27] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:30:28] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10551001599141159694
Running compilation step : cd /tmp/ltsmin10551001599141159694;'/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/ltsmin10551001599141159694;'/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/ltsmin10551001599141159694;'/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 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 534 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:30:31] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:30:31] [INFO ] Computed 989 invariants in 184 ms
[2024-05-25 12:30:35] [INFO ] Implicit Places using invariants in 3705 ms returned []
[2024-05-25 12:30:35] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:30:35] [INFO ] Invariant cache hit.
[2024-05-25 12:30:38] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 7235 ms to find 0 implicit places.
[2024-05-25 12:30:39] [INFO ] Redundant transitions in 847 ms returned []
[2024-05-25 12:30:39] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:30:39] [INFO ] Invariant cache hit.
[2024-05-25 12:30:44] [INFO ] Dead Transitions using invariants and state equation in 4485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13106 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Built C files in :
/tmp/ltsmin8044795165478899869
[2024-05-25 12:30:44] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:30:44] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8044795165478899869
Running compilation step : cd /tmp/ltsmin8044795165478899869;'/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/ltsmin8044795165478899869;'/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/ltsmin8044795165478899869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:30:47] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:30:47] [INFO ] Flatten gal took : 219 ms
[2024-05-25 12:30:47] [INFO ] Time to serialize gal into /tmp/LTL5548484440109713733.gal : 34 ms
[2024-05-25 12:30:47] [INFO ] Time to serialize properties into /tmp/LTL11248808625653533141.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/LTL5548484440109713733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut374213291281444863.hoa' '-atoms' '/tmp/LTL11248808625653533141.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/LTL11248808625653533141.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut374213291281444863.hoa
Detected timeout of ITS tools.
[2024-05-25 12:31:03] [INFO ] Flatten gal took : 210 ms
[2024-05-25 12:31:03] [INFO ] Flatten gal took : 222 ms
[2024-05-25 12:31:03] [INFO ] Time to serialize gal into /tmp/LTL16905551179493895635.gal : 36 ms
[2024-05-25 12:31:03] [INFO ] Time to serialize properties into /tmp/LTL12233451578514828793.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/LTL16905551179493895635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12233451578514828793.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 : !((G("(Node11HasTheLeafSetOfLx5ToReplaceNode12<1)")))
Formula 0 simplified : F!"(Node11HasTheLeafSetOfLx5ToReplaceNode12<1)"
Detected timeout of ITS tools.
[2024-05-25 12:31:18] [INFO ] Flatten gal took : 213 ms
[2024-05-25 12:31:18] [INFO ] Applying decomposition
[2024-05-25 12:31:18] [INFO ] Flatten gal took : 222 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/graph7021384198922166985.txt' '-o' '/tmp/graph7021384198922166985.bin' '-w' '/tmp/graph7021384198922166985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7021384198922166985.bin' '-l' '-1' '-v' '-w' '/tmp/graph7021384198922166985.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:31:19] [INFO ] Decomposing Gal with order
[2024-05-25 12:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:31:20] [INFO ] Removed a total of 6738 redundant transitions.
[2024-05-25 12:31:20] [INFO ] Flatten gal took : 1165 ms
[2024-05-25 12:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 5299 labels/synchronizations in 367 ms.
[2024-05-25 12:31:21] [INFO ] Time to serialize gal into /tmp/LTL17631289259485868155.gal : 62 ms
[2024-05-25 12:31:21] [INFO ] Time to serialize properties into /tmp/LTL15237718867145023151.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/LTL17631289259485868155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15237718867145023151.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 : !((G("(i11.u173.Node11HasTheLeafSetOfLx5ToReplaceNode12<1)")))
Formula 0 simplified : F!"(i11.u173.Node11HasTheLeafSetOfLx5ToReplaceNode12<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17094178165839719239
[2024-05-25 12:31:36] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17094178165839719239
Running compilation step : cd /tmp/ltsmin17094178165839719239;'/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/ltsmin17094178165839719239;'/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/ltsmin17094178165839719239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09 finished in 255316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||((p1||G(!p0))&&F(G(!p1)))||G(p1))))'
Support contains 4 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 10 place count 5020 transition count 8097
Deduced a syphon composed of 312 places in 5 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 634 place count 4708 transition count 8097
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 648 place count 4694 transition count 8053
Iterating global reduction 2 with 14 rules applied. Total rules applied 662 place count 4694 transition count 8053
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 662 place count 4694 transition count 8050
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 668 place count 4691 transition count 8050
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 676 place count 4683 transition count 8002
Iterating global reduction 2 with 8 rules applied. Total rules applied 684 place count 4683 transition count 8002
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 742 place count 4654 transition count 7973
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 747 place count 4649 transition count 7968
Iterating global reduction 2 with 5 rules applied. Total rules applied 752 place count 4649 transition count 7968
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 752 place count 4649 transition count 7965
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 758 place count 4646 transition count 7965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 763 place count 4641 transition count 7935
Iterating global reduction 2 with 5 rules applied. Total rules applied 768 place count 4641 transition count 7935
Applied a total of 768 rules in 2967 ms. Remains 4641 /5025 variables (removed 384) and now considering 7935/8414 (removed 479) transitions.
[2024-05-25 12:31:42] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:31:42] [INFO ] Computed 989 invariants in 174 ms
[2024-05-25 12:31:46] [INFO ] Implicit Places using invariants in 3727 ms returned []
[2024-05-25 12:31:46] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:31:46] [INFO ] Invariant cache hit.
[2024-05-25 12:31:50] [INFO ] Implicit Places using invariants and state equation in 3540 ms returned []
Implicit Place search using SMT with State Equation took 7267 ms to find 0 implicit places.
[2024-05-25 12:31:50] [INFO ] Redundant transitions in 847 ms returned []
[2024-05-25 12:31:50] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:31:50] [INFO ] Invariant cache hit.
[2024-05-25 12:31:55] [INFO ] Dead Transitions using invariants and state equation in 4616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5025 places, 7935/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15708 ms. Remains : 4641/5025 places, 7935/8414 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s270 1) (GEQ s1635 1)), p0:(AND (GEQ s1783 1) (GEQ s1858 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2297 reset in 1160 ms.
Product exploration explored 100000 steps with 2294 reset in 1234 ms.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 5 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22973 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22973 steps, saw 10741 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:32:01] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:32:01] [INFO ] Invariant cache hit.
[2024-05-25 12:32:02] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:32:02] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 278 ms returned sat
[2024-05-25 12:32:06] [INFO ] After 3514ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2024-05-25 12:32:06] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:32:07] [INFO ] After 579ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 12:32:07] [INFO ] After 5223ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 12:32:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 12:32:07] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 238 ms returned sat
[2024-05-25 12:32:12] [INFO ] After 3893ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 12:32:16] [INFO ] After 3939ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 12:32:23] [INFO ] Deduced a trap composed of 596 places in 4236 ms of which 4 ms to minimize.
[2024-05-25 12:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4661 ms
[2024-05-25 12:32:25] [INFO ] After 13187ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 3286 ms.
[2024-05-25 12:32:28] [INFO ] After 21404ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 4641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4641 transition count 10344
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4305 transition count 10344
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 696 place count 4305 transition count 10344
Applied a total of 696 rules in 1801 ms. Remains 4305 /4641 variables (removed 336) and now considering 10344/7935 (removed -2409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1801 ms. Remains : 4305/4641 places, 10344/7935 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22605 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22605 steps, saw 10359 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:32:33] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
// Phase 1: matrix 9459 rows 4305 cols
[2024-05-25 12:32:34] [INFO ] Computed 989 invariants in 216 ms
[2024-05-25 12:32:34] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 12:32:35] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 249 ms returned sat
[2024-05-25 12:32:38] [INFO ] After 4763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:32:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 54 ms returned sat
[2024-05-25 12:32:39] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 251 ms returned sat
[2024-05-25 12:32:46] [INFO ] After 6568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:32:46] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:33:04] [INFO ] After 17441ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:33:04] [INFO ] After 17441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 12:33:04] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 4305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 541 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 564 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
[2024-05-25 12:33:05] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
[2024-05-25 12:33:05] [INFO ] Invariant cache hit.
[2024-05-25 12:33:10] [INFO ] Implicit Places using invariants in 4952 ms returned []
Implicit Place search using SMT only with invariants took 4952 ms to find 0 implicit places.
[2024-05-25 12:33:10] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
[2024-05-25 12:33:10] [INFO ] Invariant cache hit.
[2024-05-25 12:33:15] [INFO ] Dead Transitions using invariants and state equation in 5664 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11182 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Graph (trivial) has 3328 edges and 4305 vertex of which 25 / 4305 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 32012 edges and 4281 vertex of which 4260 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3874 transition count 8616
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3632 transition count 8135
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3391 transition count 7695
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3151 transition count 7297
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2951 transition count 6937
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2753 transition count 6615
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2591 transition count 6327
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2431 transition count 6073
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2303 transition count 5849
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2177 transition count 5655
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2079 transition count 5487
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 237 rules applied. Total rules applied 5406 place count 1983 transition count 5346
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5596 place count 1912 transition count 5227
Ensure Unique test removed 19 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 167 rules applied. Total rules applied 5763 place count 1843 transition count 5129
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 1793 transition count 5049
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 1745 transition count 4987
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 1713 transition count 4939
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 1683 transition count 4905
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 1665 transition count 4881
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 1649 transition count 4867
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 1641 transition count 4859
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 1635 transition count 4856
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 1632 transition count 4855
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6248 place count 1632 transition count 4555
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 23 with 899 rules applied. Total rules applied 7147 place count 1033 transition count 4555
Discarding 311 places :
Symmetric choice reduction at 23 with 311 rule applications. Total rules 7458 place count 722 transition count 4244
Iterating global reduction 23 with 311 rules applied. Total rules applied 7769 place count 722 transition count 4244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7769 place count 722 transition count 4243
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7771 place count 721 transition count 4243
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8310 place count 182 transition count 1009
Iterating global reduction 23 with 539 rules applied. Total rules applied 8849 place count 182 transition count 1009
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9388 place count 182 transition count 470
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9439 place count 156 transition count 445
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9451 place count 156 transition count 433
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9463 place count 144 transition count 433
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9485 place count 122 transition count 301
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 9518 place count 111 transition count 301
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9540 place count 111 transition count 279
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9550 place count 101 transition count 219
Iterating global reduction 26 with 10 rules applied. Total rules applied 9560 place count 101 transition count 219
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9570 place count 91 transition count 209
Iterating global reduction 26 with 10 rules applied. Total rules applied 9580 place count 91 transition count 209
Applied a total of 9580 rules in 5759 ms. Remains 91 /4305 variables (removed 4214) and now considering 209/10344 (removed 10135) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 209 rows 91 cols
[2024-05-25 12:33:21] [INFO ] Computed 31 invariants in 6 ms
[2024-05-25 12:33:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 12:33:21] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 3 ms returned sat
[2024-05-25 12:33:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:33:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 12:33:21] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 8 ms returned sat
[2024-05-25 12:33:21] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:33:21] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-25 12:33:21] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 5 states, 14 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 125 ms :[p0, p0, false]
Support contains 4 out of 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 541 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:33:22] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:33:22] [INFO ] Computed 989 invariants in 176 ms
[2024-05-25 12:33:26] [INFO ] Implicit Places using invariants in 3404 ms returned []
[2024-05-25 12:33:26] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:33:26] [INFO ] Invariant cache hit.
[2024-05-25 12:33:29] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned []
Implicit Place search using SMT with State Equation took 6689 ms to find 0 implicit places.
[2024-05-25 12:33:30] [INFO ] Redundant transitions in 825 ms returned []
[2024-05-25 12:33:30] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:33:30] [INFO ] Invariant cache hit.
[2024-05-25 12:33:34] [INFO ] Dead Transitions using invariants and state equation in 4399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12460 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, false]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 23262 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23262 steps, saw 10868 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:33:38] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:33:38] [INFO ] Invariant cache hit.
[2024-05-25 12:33:38] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 12:33:39] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 267 ms returned sat
[2024-05-25 12:33:42] [INFO ] After 3484ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 12:33:42] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:33:43] [INFO ] After 548ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:33:43] [INFO ] After 5029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:33:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 12:33:44] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 271 ms returned sat
[2024-05-25 12:33:48] [INFO ] After 4017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:33:52] [INFO ] After 3874ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:33:59] [INFO ] Deduced a trap composed of 702 places in 4457 ms of which 4 ms to minimize.
[2024-05-25 12:34:04] [INFO ] Deduced a trap composed of 784 places in 4394 ms of which 5 ms to minimize.
[2024-05-25 12:34:08] [INFO ] Deduced a trap composed of 816 places in 4399 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:34:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:34:08] [INFO ] After 25428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4641 transition count 10344
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4305 transition count 10344
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 696 place count 4305 transition count 10344
Applied a total of 696 rules in 1769 ms. Remains 4305 /4641 variables (removed 336) and now considering 10344/7935 (removed -2409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1770 ms. Remains : 4305/4641 places, 10344/7935 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22166 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22166 steps, saw 10164 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:34:14] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
// Phase 1: matrix 9459 rows 4305 cols
[2024-05-25 12:34:14] [INFO ] Computed 989 invariants in 222 ms
[2024-05-25 12:34:14] [INFO ] [Real]Absence check using 49 positive place invariants in 58 ms returned sat
[2024-05-25 12:34:15] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 260 ms returned sat
[2024-05-25 12:34:19] [INFO ] After 4958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:34:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 56 ms returned sat
[2024-05-25 12:34:20] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 255 ms returned sat
[2024-05-25 12:34:27] [INFO ] After 6782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:34:27] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:34:44] [INFO ] After 17195ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 12:34:44] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 4305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 561 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 561 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 543 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
[2024-05-25 12:34:45] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
[2024-05-25 12:34:45] [INFO ] Invariant cache hit.
[2024-05-25 12:34:50] [INFO ] Implicit Places using invariants in 5083 ms returned []
Implicit Place search using SMT only with invariants took 5084 ms to find 0 implicit places.
[2024-05-25 12:34:50] [INFO ] Flow matrix only has 9459 transitions (discarded 885 similar events)
[2024-05-25 12:34:50] [INFO ] Invariant cache hit.
[2024-05-25 12:34:56] [INFO ] Dead Transitions using invariants and state equation in 5805 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11434 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Graph (trivial) has 3328 edges and 4305 vertex of which 25 / 4305 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 32012 edges and 4281 vertex of which 4260 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3874 transition count 8616
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3632 transition count 8135
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3391 transition count 7695
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3151 transition count 7297
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2951 transition count 6937
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2753 transition count 6615
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2591 transition count 6327
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2431 transition count 6073
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2303 transition count 5849
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2177 transition count 5655
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2079 transition count 5487
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 237 rules applied. Total rules applied 5406 place count 1983 transition count 5346
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5596 place count 1912 transition count 5227
Ensure Unique test removed 19 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 167 rules applied. Total rules applied 5763 place count 1843 transition count 5129
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 1793 transition count 5049
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 1745 transition count 4987
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 1713 transition count 4939
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 1683 transition count 4905
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 1665 transition count 4881
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 1649 transition count 4867
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 1641 transition count 4859
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 1635 transition count 4856
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 1632 transition count 4855
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6248 place count 1632 transition count 4555
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 23 with 899 rules applied. Total rules applied 7147 place count 1033 transition count 4555
Discarding 311 places :
Symmetric choice reduction at 23 with 311 rule applications. Total rules 7458 place count 722 transition count 4244
Iterating global reduction 23 with 311 rules applied. Total rules applied 7769 place count 722 transition count 4244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7769 place count 722 transition count 4243
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7771 place count 721 transition count 4243
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8310 place count 182 transition count 1009
Iterating global reduction 23 with 539 rules applied. Total rules applied 8849 place count 182 transition count 1009
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9388 place count 182 transition count 470
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9439 place count 156 transition count 445
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9451 place count 156 transition count 433
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9463 place count 144 transition count 433
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9485 place count 122 transition count 301
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 9518 place count 111 transition count 301
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9540 place count 111 transition count 279
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9550 place count 101 transition count 219
Iterating global reduction 26 with 10 rules applied. Total rules applied 9560 place count 101 transition count 219
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9570 place count 91 transition count 209
Iterating global reduction 26 with 10 rules applied. Total rules applied 9580 place count 91 transition count 209
Applied a total of 9580 rules in 5701 ms. Remains 91 /4305 variables (removed 4214) and now considering 209/10344 (removed 10135) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 209 rows 91 cols
[2024-05-25 12:35:02] [INFO ] Computed 31 invariants in 5 ms
[2024-05-25 12:35:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 12:35:02] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 12:35:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:35:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 12:35:02] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 12:35:02] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:35:02] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 12:35:02] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 106 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, false]
Product exploration explored 100000 steps with 2295 reset in 1122 ms.
Product exploration explored 100000 steps with 2295 reset in 1156 ms.
Built C files in :
/tmp/ltsmin13149938769228008293
[2024-05-25 12:35:05] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:35:05] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13149938769228008293
Running compilation step : cd /tmp/ltsmin13149938769228008293;'/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/ltsmin13149938769228008293;'/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/ltsmin13149938769228008293;'/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 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 525 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:35:08] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:35:08] [INFO ] Computed 989 invariants in 171 ms
[2024-05-25 12:35:12] [INFO ] Implicit Places using invariants in 3607 ms returned []
[2024-05-25 12:35:12] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:35:12] [INFO ] Invariant cache hit.
[2024-05-25 12:35:15] [INFO ] Implicit Places using invariants and state equation in 3515 ms returned []
Implicit Place search using SMT with State Equation took 7124 ms to find 0 implicit places.
[2024-05-25 12:35:16] [INFO ] Redundant transitions in 829 ms returned []
[2024-05-25 12:35:16] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:35:16] [INFO ] Invariant cache hit.
[2024-05-25 12:35:21] [INFO ] Dead Transitions using invariants and state equation in 4516 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13001 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Built C files in :
/tmp/ltsmin9383514243573442961
[2024-05-25 12:35:21] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:35:21] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9383514243573442961
Running compilation step : cd /tmp/ltsmin9383514243573442961;'/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/ltsmin9383514243573442961;'/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/ltsmin9383514243573442961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:35:24] [INFO ] Flatten gal took : 211 ms
[2024-05-25 12:35:24] [INFO ] Flatten gal took : 218 ms
[2024-05-25 12:35:24] [INFO ] Time to serialize gal into /tmp/LTL2173876189610615926.gal : 35 ms
[2024-05-25 12:35:24] [INFO ] Time to serialize properties into /tmp/LTL13417610812737845226.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/LTL2173876189610615926.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13239689567170255271.hoa' '-atoms' '/tmp/LTL13417610812737845226.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13417610812737845226.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13239689567170255271.hoa
Detected timeout of ITS tools.
[2024-05-25 12:35:40] [INFO ] Flatten gal took : 207 ms
[2024-05-25 12:35:40] [INFO ] Flatten gal took : 228 ms
[2024-05-25 12:35:40] [INFO ] Time to serialize gal into /tmp/LTL5806346618950452184.gal : 35 ms
[2024-05-25 12:35:40] [INFO ] Time to serialize properties into /tmp/LTL9572766331964679689.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/LTL5806346618950452184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9572766331964679689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((G("((Node8HasAskedItsLeafSetToLx5ToReplaceNode7<1)||(LeafSetOfLx5IsSentToNode8<1))"))||(G("((Node0ThinksNode7ShouldBeNodeMaster...522
Formula 0 simplified : G(F!"((Node8HasAskedItsLeafSetToLx5ToReplaceNode7<1)||(LeafSetOfLx5IsSentToNode8<1))" & F!"((Node0ThinksNode7ShouldBeNodeMasterToRep...506
Detected timeout of ITS tools.
[2024-05-25 12:35:55] [INFO ] Flatten gal took : 210 ms
[2024-05-25 12:35:55] [INFO ] Applying decomposition
[2024-05-25 12:35:55] [INFO ] Flatten gal took : 220 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/graph12335910453272339775.txt' '-o' '/tmp/graph12335910453272339775.bin' '-w' '/tmp/graph12335910453272339775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12335910453272339775.bin' '-l' '-1' '-v' '-w' '/tmp/graph12335910453272339775.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:35:56] [INFO ] Decomposing Gal with order
[2024-05-25 12:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:35:57] [INFO ] Removed a total of 6837 redundant transitions.
[2024-05-25 12:35:57] [INFO ] Flatten gal took : 1164 ms
[2024-05-25 12:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4429 labels/synchronizations in 346 ms.
[2024-05-25 12:35:58] [INFO ] Time to serialize gal into /tmp/LTL12268588290021429601.gal : 58 ms
[2024-05-25 12:35:58] [INFO ] Time to serialize properties into /tmp/LTL1929831575282545856.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/LTL12268588290021429601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1929831575282545856.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("((i6.u175.Node8HasAskedItsLeafSetToLx5ToReplaceNode7<1)||(i6.u175.LeafSetOfLx5IsSentToNode8<1))"))||(G("((i2.u22.Node0Thinks...602
Formula 0 simplified : G(F!"((i6.u175.Node8HasAskedItsLeafSetToLx5ToReplaceNode7<1)||(i6.u175.LeafSetOfLx5IsSentToNode8<1))" & F!"((i2.u22.Node0ThinksNode7...586
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4432483405456366730
[2024-05-25 12:36:13] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4432483405456366730
Running compilation step : cd /tmp/ltsmin4432483405456366730;'/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/ltsmin4432483405456366730;'/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/ltsmin4432483405456366730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-10 finished in 276874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 4 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 10 place count 5020 transition count 8098
Deduced a syphon composed of 311 places in 5 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 632 place count 4709 transition count 8098
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 645 place count 4696 transition count 8055
Iterating global reduction 2 with 13 rules applied. Total rules applied 658 place count 4696 transition count 8055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 658 place count 4696 transition count 8054
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 660 place count 4695 transition count 8054
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 667 place count 4688 transition count 8012
Iterating global reduction 2 with 7 rules applied. Total rules applied 674 place count 4688 transition count 8012
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 732 place count 4659 transition count 7983
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 737 place count 4654 transition count 7978
Iterating global reduction 2 with 5 rules applied. Total rules applied 742 place count 4654 transition count 7978
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 742 place count 4654 transition count 7974
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 750 place count 4650 transition count 7974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 755 place count 4645 transition count 7944
Iterating global reduction 2 with 5 rules applied. Total rules applied 760 place count 4645 transition count 7944
Applied a total of 760 rules in 2951 ms. Remains 4645 /5025 variables (removed 380) and now considering 7944/8414 (removed 470) transitions.
[2024-05-25 12:36:19] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4645 cols
[2024-05-25 12:36:19] [INFO ] Computed 989 invariants in 180 ms
[2024-05-25 12:36:23] [INFO ] Implicit Places using invariants in 3493 ms returned []
[2024-05-25 12:36:23] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:36:23] [INFO ] Invariant cache hit.
[2024-05-25 12:36:26] [INFO ] Implicit Places using invariants and state equation in 3555 ms returned []
Implicit Place search using SMT with State Equation took 7048 ms to find 0 implicit places.
[2024-05-25 12:36:27] [INFO ] Redundant transitions in 849 ms returned []
[2024-05-25 12:36:27] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:36:27] [INFO ] Invariant cache hit.
[2024-05-25 12:36:31] [INFO ] Dead Transitions using invariants and state equation in 4354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4645/5025 places, 7944/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15209 ms. Remains : 4645/5025 places, 7944/8414 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2172 1) (GEQ s2199 1)), p0:(AND (GEQ s1994 1) (GEQ s2030 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 43 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 finished in 15361 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&&F(p1))))'
Support contains 3 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 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 0 with 4 rules applied. Total rules applied 4 place count 5025 transition count 8410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5021 transition count 8410
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 8 place count 5021 transition count 8097
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 634 place count 4708 transition count 8097
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 649 place count 4693 transition count 8052
Iterating global reduction 2 with 15 rules applied. Total rules applied 664 place count 4693 transition count 8052
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 664 place count 4693 transition count 8049
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 670 place count 4690 transition count 8049
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 679 place count 4681 transition count 7995
Iterating global reduction 2 with 9 rules applied. Total rules applied 688 place count 4681 transition count 7995
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 746 place count 4652 transition count 7966
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 750 place count 4648 transition count 7962
Iterating global reduction 2 with 4 rules applied. Total rules applied 754 place count 4648 transition count 7962
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 754 place count 4648 transition count 7959
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 760 place count 4645 transition count 7959
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 764 place count 4641 transition count 7935
Iterating global reduction 2 with 4 rules applied. Total rules applied 768 place count 4641 transition count 7935
Applied a total of 768 rules in 2998 ms. Remains 4641 /5025 variables (removed 384) and now considering 7935/8414 (removed 479) transitions.
[2024-05-25 12:36:35] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:36:35] [INFO ] Computed 989 invariants in 182 ms
[2024-05-25 12:36:38] [INFO ] Implicit Places using invariants in 3517 ms returned []
[2024-05-25 12:36:38] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:36:38] [INFO ] Invariant cache hit.
[2024-05-25 12:36:42] [INFO ] Implicit Places using invariants and state equation in 3828 ms returned []
Implicit Place search using SMT with State Equation took 7346 ms to find 0 implicit places.
[2024-05-25 12:36:43] [INFO ] Redundant transitions in 837 ms returned []
[2024-05-25 12:36:43] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:36:43] [INFO ] Invariant cache hit.
[2024-05-25 12:36:47] [INFO ] Dead Transitions using invariants and state equation in 4651 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5025 places, 7935/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15840 ms. Remains : 4641/5025 places, 7935/8414 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s822 1) (LT s1135 1)), p1:(LT s1705 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2249 reset in 1124 ms.
Product exploration explored 100000 steps with 2250 reset in 1154 ms.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:36:50] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:36:50] [INFO ] Invariant cache hit.
[2024-05-25 12:36:51] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:36:51] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 274 ms returned sat
[2024-05-25 12:36:55] [INFO ] After 5010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:36:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:36:56] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 282 ms returned sat
[2024-05-25 12:37:00] [INFO ] After 4140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:37:00] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:37:00] [INFO ] After 195ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 12:37:00] [INFO ] After 5235ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G p0)]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 4641 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 528 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:37:01] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:01] [INFO ] Invariant cache hit.
[2024-05-25 12:37:05] [INFO ] Implicit Places using invariants in 3833 ms returned []
[2024-05-25 12:37:05] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:05] [INFO ] Invariant cache hit.
[2024-05-25 12:37:09] [INFO ] Implicit Places using invariants and state equation in 3808 ms returned []
Implicit Place search using SMT with State Equation took 7645 ms to find 0 implicit places.
[2024-05-25 12:37:10] [INFO ] Redundant transitions in 840 ms returned []
[2024-05-25 12:37:10] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:10] [INFO ] Invariant cache hit.
[2024-05-25 12:37:14] [INFO ] Dead Transitions using invariants and state equation in 4549 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13578 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8291 steps, including 186 resets, run visited all 1 properties in 96 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2248 reset in 1102 ms.
Product exploration explored 100000 steps with 2252 reset in 1153 ms.
Built C files in :
/tmp/ltsmin7611962978473311319
[2024-05-25 12:37:17] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:37:17] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7611962978473311319
Running compilation step : cd /tmp/ltsmin7611962978473311319;'/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/ltsmin7611962978473311319;'/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/ltsmin7611962978473311319;'/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 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 534 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:37:21] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:21] [INFO ] Invariant cache hit.
[2024-05-25 12:37:25] [INFO ] Implicit Places using invariants in 3570 ms returned []
[2024-05-25 12:37:25] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:25] [INFO ] Invariant cache hit.
[2024-05-25 12:37:28] [INFO ] Implicit Places using invariants and state equation in 3811 ms returned []
Implicit Place search using SMT with State Equation took 7382 ms to find 0 implicit places.
[2024-05-25 12:37:29] [INFO ] Redundant transitions in 831 ms returned []
[2024-05-25 12:37:29] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:37:29] [INFO ] Invariant cache hit.
[2024-05-25 12:37:33] [INFO ] Dead Transitions using invariants and state equation in 4233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12989 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Built C files in :
/tmp/ltsmin3760285022643849077
[2024-05-25 12:37:34] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:37:34] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3760285022643849077
Running compilation step : cd /tmp/ltsmin3760285022643849077;'/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/ltsmin3760285022643849077;'/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/ltsmin3760285022643849077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:37:37] [INFO ] Flatten gal took : 213 ms
[2024-05-25 12:37:37] [INFO ] Flatten gal took : 212 ms
[2024-05-25 12:37:37] [INFO ] Time to serialize gal into /tmp/LTL4113060236092561232.gal : 37 ms
[2024-05-25 12:37:37] [INFO ] Time to serialize properties into /tmp/LTL15033244779391692175.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4113060236092561232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15789459956579400341.hoa' '-atoms' '/tmp/LTL15033244779391692175.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15033244779391692175.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15789459956579400341.hoa
Detected timeout of ITS tools.
[2024-05-25 12:37:53] [INFO ] Flatten gal took : 205 ms
[2024-05-25 12:37:53] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:37:53] [INFO ] Time to serialize gal into /tmp/LTL6044872227013382753.gal : 36 ms
[2024-05-25 12:37:53] [INFO ] Time to serialize properties into /tmp/LTL12019891601373055379.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/LTL6044872227013382753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12019891601373055379.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((F("(Node7HasTheLeafSetOfRx1ToReplaceNode13<1)"))&&("((Node2ThinksNode4ShouldBeNodeMasterToReplaceNode14<1)||(Node4NotifyThatHeIs...170
Formula 0 simplified : F(!"((Node2ThinksNode4ShouldBeNodeMasterToReplaceNode14<1)||(Node4NotifyThatHeIsActive<1))" | G!"(Node7HasTheLeafSetOfRx1ToReplaceNo...164
Detected timeout of ITS tools.
[2024-05-25 12:38:08] [INFO ] Flatten gal took : 211 ms
[2024-05-25 12:38:08] [INFO ] Applying decomposition
[2024-05-25 12:38:08] [INFO ] Flatten gal took : 221 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/graph16201538662354598085.txt' '-o' '/tmp/graph16201538662354598085.bin' '-w' '/tmp/graph16201538662354598085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16201538662354598085.bin' '-l' '-1' '-v' '-w' '/tmp/graph16201538662354598085.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:38:09] [INFO ] Decomposing Gal with order
[2024-05-25 12:38:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:38:10] [INFO ] Removed a total of 6796 redundant transitions.
[2024-05-25 12:38:10] [INFO ] Flatten gal took : 1244 ms
[2024-05-25 12:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4707 labels/synchronizations in 345 ms.
[2024-05-25 12:38:12] [INFO ] Time to serialize gal into /tmp/LTL10615034868596088335.gal : 1213 ms
[2024-05-25 12:38:12] [INFO ] Time to serialize properties into /tmp/LTL5934638970697506172.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/LTL10615034868596088335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5934638970697506172.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((F("(i0.u373.Node7HasTheLeafSetOfRx1ToReplaceNode13<1)"))&&("((i11.u64.Node2ThinksNode4ShouldBeNodeMasterToReplaceNode14<1)||(i6....193
Formula 0 simplified : F(!"((i11.u64.Node2ThinksNode4ShouldBeNodeMasterToReplaceNode14<1)||(i6.u93.Node4NotifyThatHeIsActive<1))" | G!"(i0.u373.Node7HasThe...187
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15718692457048698577
[2024-05-25 12:38:27] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15718692457048698577
Running compilation step : cd /tmp/ltsmin15718692457048698577;'/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/ltsmin15718692457048698577;'/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/ltsmin15718692457048698577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12 finished in 118716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 10 place count 5020 transition count 8097
Deduced a syphon composed of 312 places in 4 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 634 place count 4708 transition count 8097
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 648 place count 4694 transition count 8053
Iterating global reduction 2 with 14 rules applied. Total rules applied 662 place count 4694 transition count 8053
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 662 place count 4694 transition count 8050
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 668 place count 4691 transition count 8050
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 676 place count 4683 transition count 8002
Iterating global reduction 2 with 8 rules applied. Total rules applied 684 place count 4683 transition count 8002
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 742 place count 4654 transition count 7973
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 747 place count 4649 transition count 7968
Iterating global reduction 2 with 5 rules applied. Total rules applied 752 place count 4649 transition count 7968
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 752 place count 4649 transition count 7965
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 758 place count 4646 transition count 7965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 763 place count 4641 transition count 7935
Iterating global reduction 2 with 5 rules applied. Total rules applied 768 place count 4641 transition count 7935
Applied a total of 768 rules in 2991 ms. Remains 4641 /5025 variables (removed 384) and now considering 7935/8414 (removed 479) transitions.
[2024-05-25 12:38:33] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:38:33] [INFO ] Computed 989 invariants in 178 ms
[2024-05-25 12:38:37] [INFO ] Implicit Places using invariants in 3622 ms returned []
[2024-05-25 12:38:37] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:38:37] [INFO ] Invariant cache hit.
[2024-05-25 12:38:42] [INFO ] Implicit Places using invariants and state equation in 4606 ms returned []
Implicit Place search using SMT with State Equation took 8229 ms to find 0 implicit places.
[2024-05-25 12:38:42] [INFO ] Redundant transitions in 855 ms returned []
[2024-05-25 12:38:42] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:38:42] [INFO ] Invariant cache hit.
[2024-05-25 12:38:47] [INFO ] Dead Transitions using invariants and state equation in 4794 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5025 places, 7935/8414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16876 ms. Remains : 4641/5025 places, 7935/8414 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1552 1) (LT s1626 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2259 reset in 1108 ms.
Product exploration explored 100000 steps with 2261 reset in 1145 ms.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Finished Best-First random walk after 3391 steps, including 10 resets, run visited all 1 properties in 10 ms. (steps per millisecond=339 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 530 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:38:51] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:38:51] [INFO ] Invariant cache hit.
[2024-05-25 12:38:55] [INFO ] Implicit Places using invariants in 4593 ms returned []
[2024-05-25 12:38:55] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:38:55] [INFO ] Invariant cache hit.
[2024-05-25 12:39:00] [INFO ] Implicit Places using invariants and state equation in 4620 ms returned []
Implicit Place search using SMT with State Equation took 9228 ms to find 0 implicit places.
[2024-05-25 12:39:01] [INFO ] Redundant transitions in 767 ms returned []
[2024-05-25 12:39:01] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:39:01] [INFO ] Invariant cache hit.
[2024-05-25 12:39:05] [INFO ] Dead Transitions using invariants and state equation in 4788 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15320 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Detected a total of 2042/4641 stabilizing places and 2759/7935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24102 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24102 steps, saw 11250 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:39:09] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:39:09] [INFO ] Invariant cache hit.
[2024-05-25 12:39:09] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 12:39:09] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 276 ms returned sat
[2024-05-25 12:39:13] [INFO ] After 3615ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:39:13] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2024-05-25 12:39:14] [INFO ] After 473ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:39:14] [INFO ] After 5001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:39:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:39:14] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 282 ms returned sat
[2024-05-25 12:39:18] [INFO ] After 3696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:39:19] [INFO ] After 735ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:39:24] [INFO ] Deduced a trap composed of 309 places in 4532 ms of which 5 ms to minimize.
[2024-05-25 12:39:29] [INFO ] Deduced a trap composed of 338 places in 4584 ms of which 5 ms to minimize.
[2024-05-25 12:39:34] [INFO ] Deduced a trap composed of 646 places in 4794 ms of which 5 ms to minimize.
[2024-05-25 12:39:39] [INFO ] Deduced a trap composed of 266 places in 4561 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:39:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:39:39] [INFO ] After 25564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 698 place count 4304 transition count 10343
Applied a total of 698 rules in 1807 ms. Remains 4304 /4641 variables (removed 337) and now considering 10343/7935 (removed -2408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1807 ms. Remains : 4304/4641 places, 10343/7935 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22609 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22609 steps, saw 10360 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:39:44] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:39:45] [INFO ] Computed 989 invariants in 223 ms
[2024-05-25 12:39:45] [INFO ] [Real]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 12:39:45] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 245 ms returned sat
[2024-05-25 12:39:45] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:39:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 56 ms returned sat
[2024-05-25 12:39:46] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 253 ms returned sat
[2024-05-25 12:39:51] [INFO ] After 4374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:39:51] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:39:53] [INFO ] After 2021ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:39:59] [INFO ] Deduced a trap composed of 168 places in 5524 ms of which 5 ms to minimize.
[2024-05-25 12:40:05] [INFO ] Deduced a trap composed of 190 places in 5304 ms of which 4 ms to minimize.
[2024-05-25 12:40:11] [INFO ] Deduced a trap composed of 438 places in 5353 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:40:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:40:12] [INFO ] After 26019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 555 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 568 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
[2024-05-25 12:40:13] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:40:13] [INFO ] Invariant cache hit.
[2024-05-25 12:40:21] [INFO ] Implicit Places using invariants in 8837 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1426, 1437, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1461, 1467, 1471, 1473, 1475, 1477, 1479, 1481, 1483, 1485, 1501, 1507, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1529, 1533, 1539, 1547, 1556, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1576, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1611, 1617, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1641, 1645, 1651, 1658, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1707, 1713, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1743, 1748, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1778, 1793, 1799, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1827, 1830, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1873, 1879, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1937, 1952, 1954, 1957, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2015, 2036, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2094, 2109, 2115, 2117, 2118, 2119, 2120, 2121, 2122, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2145, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2189, 2195, 2197, 2198, 2199, 2200, 2201, 2202, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2227, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2275, 2281, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2307, 2311, 2317, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2336, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2356, 2371, 2377, 2379, 2380, 2381, 2382, 2383, 2384, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2401, 2405, 2411, 2419, 2428, 2429, 2430, 2431, 2432, 2433, 2434, 2442, 2448, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2466, 2481, 2487, 2489, 2490, 2491, 2492, 2493, 2494, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2509, 2513, 2519, 2527, 2537, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2564, 2572, 2578, 2582, 2584, 2586, 2588, 2590, 2592, 2594, 2609, 2615, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2625, 2627, 2629, 2631, 2633, 2635, 2639, 2645, 2653, 2663, 2675, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2706, 2716, 2724, 2730, 2734, 2736, 2738, 2740, 2742, 2744, 2759, 2765, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2775, 2777, 2779, 2781, 2783, 2787, 2793, 2801, 2811, 2823, 2837, 2852, 2853, 2854, 2855, 2856, 2857, 2858, 2872, 2884, 2894, 2902, 2908, 2912, 2914, 2916, 2918, 2920, 2935, 2941, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2951, 2953, 2955, 2957, 2961, 2967, 2975, 2985, 2997, 3011, 3027, 3044, 3045, 3046, 3047, 3048, 3049, 3050, 3066, 3080, 3092, 3102, 3110, 3116, 3120, 3122, 3124, 3126, 3141, 3147, 3149, 3150, 3151, 3152, 3153, 3154, 3155, 3157, 3159, 3161, 3165, 3171, 3179, 3189, 3201, 3215, 3231, 3249, 3268, 3269, 3270, 3271, 3272, 3273, 3274, 3292, 3308, 3322, 3334, 3344, 3352, 3358, 3362, 3364, 3366, 3381, 3387, 3389, 3390, 3391, 3392, 3393, 3394, 3395, 3397, 3399, 3403, 3409, 3417, 3427, 3439, 3453, 3469, 3487, 3507, 3528, 3529, 3530, 3531, 3532, 3533, 3534, 3554, 3572, 3588, 3602, 3614, 3624, 3632, 3638, 3642, 3644, 3659, 3661, 3664, 3666, 3667, 3668, 3669, 3670, 3671, 3672, 3674, 3678, 3684, 3692, 3702, 3714, 3728, 3744, 3762, 3782, 3804, 3827, 3828, 3829, 3830, 3831, 3832, 3833, 3855, 3875, 3893, 3909, 3923, 3935, 3945, 3953, 3959, 3963, 3978]
Discarding 925 places :
Implicit Place search using SMT only with invariants took 8853 ms to find 925 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3379/4304 places, 10343/10343 transitions.
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 287 place count 3092 transition count 10056
Iterating global reduction 0 with 287 rules applied. Total rules applied 574 place count 3092 transition count 10056
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 861 place count 2805 transition count 9769
Iterating global reduction 0 with 287 rules applied. Total rules applied 1148 place count 2805 transition count 9769
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 1150 place count 2805 transition count 9767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1152 place count 2803 transition count 9767
Applied a total of 1152 rules in 1436 ms. Remains 2803 /3379 variables (removed 576) and now considering 9767/10343 (removed 576) transitions.
[2024-05-25 12:40:23] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
// Phase 1: matrix 8881 rows 2803 cols
[2024-05-25 12:40:23] [INFO ] Computed 64 invariants in 255 ms
[2024-05-25 12:40:27] [INFO ] Implicit Places using invariants in 4487 ms returned [1405, 1423]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4497 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2801/4304 places, 9767/10343 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2801 transition count 9766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2800 transition count 9766
Applied a total of 2 rules in 1042 ms. Remains 2800 /2801 variables (removed 1) and now considering 9766/9767 (removed 1) transitions.
[2024-05-25 12:40:28] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
// Phase 1: matrix 8880 rows 2800 cols
[2024-05-25 12:40:29] [INFO ] Computed 62 invariants in 137 ms
[2024-05-25 12:40:33] [INFO ] Implicit Places using invariants in 4274 ms returned []
[2024-05-25 12:40:33] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:40:33] [INFO ] Invariant cache hit.
[2024-05-25 12:40:39] [INFO ] Implicit Places using invariants and state equation in 6738 ms returned []
Implicit Place search using SMT with State Equation took 11014 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2800/4304 places, 9766/10343 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 27411 ms. Remains : 2800/4304 places, 9766/10343 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11475 steps, run visited all 1 properties in 1276 ms. (steps per millisecond=8 )
Probabilistic random walk after 11475 steps, saw 5085 distinct states, run finished after 1276 ms. (steps per millisecond=8 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2259 reset in 1138 ms.
Product exploration explored 100000 steps with 2260 reset in 1184 ms.
Built C files in :
/tmp/ltsmin2029477236502092730
[2024-05-25 12:40:44] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:40:44] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2029477236502092730
Running compilation step : cd /tmp/ltsmin2029477236502092730;'/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/ltsmin2029477236502092730;'/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/ltsmin2029477236502092730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 4641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4641/4641 places, 7935/7935 transitions.
Applied a total of 0 rules in 567 ms. Remains 4641 /4641 variables (removed 0) and now considering 7935/7935 (removed 0) transitions.
[2024-05-25 12:40:47] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:40:48] [INFO ] Computed 989 invariants in 179 ms
[2024-05-25 12:40:51] [INFO ] Implicit Places using invariants in 3734 ms returned []
[2024-05-25 12:40:51] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:40:51] [INFO ] Invariant cache hit.
[2024-05-25 12:40:56] [INFO ] Implicit Places using invariants and state equation in 4745 ms returned []
Implicit Place search using SMT with State Equation took 8480 ms to find 0 implicit places.
[2024-05-25 12:40:57] [INFO ] Redundant transitions in 868 ms returned []
[2024-05-25 12:40:57] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:40:57] [INFO ] Invariant cache hit.
[2024-05-25 12:41:02] [INFO ] Dead Transitions using invariants and state equation in 4985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14908 ms. Remains : 4641/4641 places, 7935/7935 transitions.
Built C files in :
/tmp/ltsmin1317481798185142958
[2024-05-25 12:41:02] [INFO ] Too many transitions (7935) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:41:02] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1317481798185142958
Running compilation step : cd /tmp/ltsmin1317481798185142958;'/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/ltsmin1317481798185142958;'/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/ltsmin1317481798185142958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:41:05] [INFO ] Flatten gal took : 219 ms
[2024-05-25 12:41:05] [INFO ] Flatten gal took : 225 ms
[2024-05-25 12:41:05] [INFO ] Time to serialize gal into /tmp/LTL1873328115497361633.gal : 38 ms
[2024-05-25 12:41:05] [INFO ] Time to serialize properties into /tmp/LTL14689970528071978972.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/LTL1873328115497361633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16633610350334325101.hoa' '-atoms' '/tmp/LTL14689970528071978972.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14689970528071978972.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16633610350334325101.hoa
Detected timeout of ITS tools.
[2024-05-25 12:41:21] [INFO ] Flatten gal took : 230 ms
[2024-05-25 12:41:21] [INFO ] Flatten gal took : 221 ms
[2024-05-25 12:41:21] [INFO ] Time to serialize gal into /tmp/LTL12593857328537881488.gal : 36 ms
[2024-05-25 12:41:21] [INFO ] Time to serialize properties into /tmp/LTL12591051862838370342.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/LTL12593857328537881488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12591051862838370342.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 : !((F(G("((Node6HasAskedItsLeafSetToLx2ToReplaceNode11<1)||(LeafSetOfLx2IsSentToNode6<1))"))))
Formula 0 simplified : GF!"((Node6HasAskedItsLeafSetToLx2ToReplaceNode11<1)||(LeafSetOfLx2IsSentToNode6<1))"
Detected timeout of ITS tools.
[2024-05-25 12:41:36] [INFO ] Flatten gal took : 239 ms
[2024-05-25 12:41:36] [INFO ] Applying decomposition
[2024-05-25 12:41:37] [INFO ] Flatten gal took : 216 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/graph11526839054956168743.txt' '-o' '/tmp/graph11526839054956168743.bin' '-w' '/tmp/graph11526839054956168743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11526839054956168743.bin' '-l' '-1' '-v' '-w' '/tmp/graph11526839054956168743.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:41:37] [INFO ] Decomposing Gal with order
[2024-05-25 12:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:41:38] [INFO ] Removed a total of 6550 redundant transitions.
[2024-05-25 12:41:39] [INFO ] Flatten gal took : 1176 ms
[2024-05-25 12:41:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4586 labels/synchronizations in 320 ms.
[2024-05-25 12:41:39] [INFO ] Time to serialize gal into /tmp/LTL7800684117088104787.gal : 47 ms
[2024-05-25 12:41:39] [INFO ] Time to serialize properties into /tmp/LTL8260192357459081321.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/LTL7800684117088104787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8260192357459081321.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i9.u143.Node6HasAskedItsLeafSetToLx2ToReplaceNode11<1)||(i9.u143.LeafSetOfLx2IsSentToNode6<1))"))))
Formula 0 simplified : GF!"((i9.u143.Node6HasAskedItsLeafSetToLx2ToReplaceNode11<1)||(i9.u143.LeafSetOfLx2IsSentToNode6<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17876107094120154036
[2024-05-25 12:41:54] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17876107094120154036
Running compilation step : cd /tmp/ltsmin17876107094120154036;'/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/ltsmin17876107094120154036;'/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/ltsmin17876107094120154036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13 finished in 207000 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)&&X(G(p1))))'
Support contains 3 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5007 transition count 8371
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5007 transition count 8371
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 4994 transition count 8313
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 4994 transition count 8313
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 4990 transition count 8289
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 4990 transition count 8289
Applied a total of 70 rules in 1716 ms. Remains 4990 /5025 variables (removed 35) and now considering 8289/8414 (removed 125) transitions.
[2024-05-25 12:41:59] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
// Phase 1: matrix 7689 rows 4990 cols
[2024-05-25 12:41:59] [INFO ] Computed 989 invariants in 173 ms
[2024-05-25 12:42:03] [INFO ] Implicit Places using invariants in 3795 ms returned []
[2024-05-25 12:42:03] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:42:03] [INFO ] Invariant cache hit.
[2024-05-25 12:42:08] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 8633 ms to find 0 implicit places.
[2024-05-25 12:42:08] [INFO ] Flow matrix only has 7689 transitions (discarded 600 similar events)
[2024-05-25 12:42:08] [INFO ] Invariant cache hit.
[2024-05-25 12:42:13] [INFO ] Dead Transitions using invariants and state equation in 5601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4990/5025 places, 8289/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15952 ms. Remains : 4990/5025 places, 8289/8414 transitions.
Stuttering acceptance computed with spot in 442 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), 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 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s9 1) (LT s4788 1)), p0:(LT s4619 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 93500 steps with 1511 reset in 878 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-14 finished in 17347 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))) U X(p1)))'
Support contains 4 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5006 transition count 8365
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5006 transition count 8365
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 4993 transition count 8312
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 4993 transition count 8312
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 4988 transition count 8282
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 4988 transition count 8282
Applied a total of 74 rules in 1752 ms. Remains 4988 /5025 variables (removed 37) and now considering 8282/8414 (removed 132) transitions.
[2024-05-25 12:42:16] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
// Phase 1: matrix 7682 rows 4988 cols
[2024-05-25 12:42:17] [INFO ] Computed 989 invariants in 167 ms
[2024-05-25 12:42:20] [INFO ] Implicit Places using invariants in 3704 ms returned []
[2024-05-25 12:42:20] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
[2024-05-25 12:42:20] [INFO ] Invariant cache hit.
[2024-05-25 12:42:25] [INFO ] Implicit Places using invariants and state equation in 4954 ms returned []
Implicit Place search using SMT with State Equation took 8659 ms to find 0 implicit places.
[2024-05-25 12:42:25] [INFO ] Flow matrix only has 7682 transitions (discarded 600 similar events)
[2024-05-25 12:42:25] [INFO ] Invariant cache hit.
[2024-05-25 12:42:30] [INFO ] Dead Transitions using invariants and state equation in 5319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4988/5025 places, 8282/8414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15731 ms. Remains : 4988/5025 places, 8282/8414 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s2038 1) (GEQ s2196 1)), p1:(AND (GEQ s1521 1) (GEQ s1573 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15 finished in 15936 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))||G((p1&&X(G((G(p3)||p2)))))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00
Stuttering acceptance computed with spot in 340 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 5 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 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 0 with 4 rules applied. Total rules applied 4 place count 5025 transition count 8410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5021 transition count 8410
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 8 place count 5021 transition count 8097
Deduced a syphon composed of 313 places in 5 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 634 place count 4708 transition count 8097
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 648 place count 4694 transition count 8058
Iterating global reduction 2 with 14 rules applied. Total rules applied 662 place count 4694 transition count 8058
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 662 place count 4694 transition count 8055
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 668 place count 4691 transition count 8055
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 677 place count 4682 transition count 8001
Iterating global reduction 2 with 9 rules applied. Total rules applied 686 place count 4682 transition count 8001
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 744 place count 4653 transition count 7972
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 748 place count 4649 transition count 7968
Iterating global reduction 2 with 4 rules applied. Total rules applied 752 place count 4649 transition count 7968
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 752 place count 4649 transition count 7965
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 758 place count 4646 transition count 7965
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 762 place count 4642 transition count 7941
Iterating global reduction 2 with 4 rules applied. Total rules applied 766 place count 4642 transition count 7941
Applied a total of 766 rules in 3014 ms. Remains 4642 /5025 variables (removed 383) and now considering 7941/8414 (removed 473) transitions.
[2024-05-25 12:42:34] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
// Phase 1: matrix 7341 rows 4642 cols
[2024-05-25 12:42:34] [INFO ] Computed 989 invariants in 183 ms
[2024-05-25 12:42:39] [INFO ] Implicit Places using invariants in 5077 ms returned []
[2024-05-25 12:42:39] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:42:39] [INFO ] Invariant cache hit.
[2024-05-25 12:42:43] [INFO ] Implicit Places using invariants and state equation in 3544 ms returned []
Implicit Place search using SMT with State Equation took 8622 ms to find 0 implicit places.
[2024-05-25 12:42:43] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:42:43] [INFO ] Invariant cache hit.
[2024-05-25 12:42:47] [INFO ] Dead Transitions using invariants and state equation in 4600 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4642/5025 places, 7941/8414 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16237 ms. Remains : 4642/5025 places, 7941/8414 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 8}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3))), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(OR (LT s1717 1) (LT s2369 1)), p0:(LT s953 1), p2:(OR (LT s1717 1) (LT s2369 1)), p3:(AND (GEQ s1535 1) (GEQ s4424 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2260 reset in 1244 ms.
Product exploration explored 100000 steps with 2261 reset in 1272 ms.
Computed a total of 2043 stabilizing places and 2765 stable transitions
Computed a total of 2043 stabilizing places and 2765 stable transitions
Detected a total of 2043/4642 stabilizing places and 2765/7941 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-25 12:42:51] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:42:51] [INFO ] Invariant cache hit.
[2024-05-25 12:42:52] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 12:42:52] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2024-05-25 12:42:53] [INFO ] After 1342ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2024-05-25 12:42:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 12:42:54] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2024-05-25 12:43:00] [INFO ] After 5764ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2024-05-25 12:43:00] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:43:03] [INFO ] After 2753ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :5 sat :6
[2024-05-25 12:43:09] [INFO ] Deduced a trap composed of 651 places in 4578 ms of which 6 ms to minimize.
[2024-05-25 12:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5949 ms
[2024-05-25 12:43:11] [INFO ] After 11202ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 2527 ms.
[2024-05-25 12:43:14] [INFO ] After 21111ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 4642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4642/4642 places, 7941/7941 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4642 transition count 10344
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4305 transition count 10344
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4305 transition count 10344
Applied a total of 699 rules in 1829 ms. Remains 4305 /4642 variables (removed 337) and now considering 10344/7941 (removed -2403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1829 ms. Remains : 4305/4642 places, 10344/7941 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 21219 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21219 steps, saw 9749 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 12:43:19] [INFO ] Flow matrix only has 9458 transitions (discarded 886 similar events)
// Phase 1: matrix 9458 rows 4305 cols
[2024-05-25 12:43:20] [INFO ] Computed 989 invariants in 227 ms
[2024-05-25 12:43:20] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:43:21] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 273 ms returned sat
[2024-05-25 12:43:26] [INFO ] After 6174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 12:43:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 12:43:27] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 233 ms returned sat
[2024-05-25 12:43:35] [INFO ] After 7845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 12:43:35] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:43:51] [INFO ] After 15826ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 12:43:51] [INFO ] After 15826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 12:43:51] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 4305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 569 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 4305/4305 places, 10344/10344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4305/4305 places, 10344/10344 transitions.
Applied a total of 0 rules in 543 ms. Remains 4305 /4305 variables (removed 0) and now considering 10344/10344 (removed 0) transitions.
[2024-05-25 12:43:52] [INFO ] Flow matrix only has 9458 transitions (discarded 886 similar events)
[2024-05-25 12:43:52] [INFO ] Invariant cache hit.
[2024-05-25 12:44:01] [INFO ] Implicit Places using invariants in 8713 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 850, 851, 852, 853, 855, 857, 859, 863, 869, 879, 889, 901, 915, 931, 948, 964, 965, 966, 967, 968, 969, 970, 984, 996, 1006, 1014, 1020, 1024, 1026, 1028, 1030, 1032, 1047, 1053, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1063, 1065, 1067, 1069, 1073, 1079, 1087, 1097, 1109, 1123, 1138, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1170, 1180, 1188, 1194, 1198, 1200, 1202, 1204, 1206, 1208, 1223, 1229, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1257, 1265, 1275, 1287, 1300, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1328, 1336, 1342, 1346, 1348, 1350, 1352, 1354, 1356, 1358, 1373, 1379, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1389, 1391, 1393, 1395, 1397, 1399, 1403, 1409, 1418, 1428, 1439, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1463, 1469, 1473, 1475, 1477, 1479, 1481, 1483, 1485, 1487, 1502, 1508, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1518, 1520, 1522, 1524, 1526, 1528, 1530, 1534, 1540, 1548, 1557, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1577, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1612, 1618, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1646, 1652, 1659, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1675, 1677, 1679, 1681, 1683, 1687, 1689, 1691, 1693, 1708, 1714, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1744, 1749, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1761, 1763, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1794, 1800, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1831, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1874, 1880, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1938, 1953, 1955, 1958, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1988, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998, 2000, 2002, 2004, 2006, 2008, 2010, 2012, 2014, 2016, 2031, 2037, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2061, 2063, 2065, 2067, 2069, 2070, 2071, 2072, 2073, 2074, 2075, 2077, 2079, 2081, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2110, 2116, 2118, 2119, 2120, 2121, 2122, 2123, 2124, 2126, 2128, 2130, 2132, 2134, 2136, 2138, 2140, 2142, 2144, 2146, 2149, 2150, 2151, 2152, 2153, 2154, 2155, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2171, 2173, 2175, 2190, 2196, 2198, 2199, 2200, 2201, 2202, 2203, 2204, 2206, 2208, 2210, 2212, 2214, 2216, 2218, 2220, 2222, 2224, 2228, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2243, 2245, 2247, 2249, 2251, 2253, 2255, 2257, 2259, 2261, 2276, 2282, 2284, 2285, 2286, 2287, 2288, 2289, 2290, 2292, 2294, 2296, 2298, 2300, 2302, 2304, 2306, 2308, 2312, 2318, 2325, 2326, 2327, 2328, 2329, 2330, 2331, 2337, 2341, 2343, 2345, 2347, 2349, 2351, 2353, 2355, 2357, 2372, 2378, 2380, 2381, 2382, 2383, 2384, 2385, 2386, 2388, 2390, 2392, 2394, 2396, 2398, 2400, 2402, 2406, 2412, 2420, 2429, 2430, 2431, 2432, 2433, 2434, 2435, 2443, 2449, 2453, 2455, 2457, 2459, 2461, 2463, 2465, 2467, 2482, 2488, 2490, 2491, 2492, 2493, 2494, 2495, 2496, 2498, 2500, 2502, 2504, 2506, 2508, 2510, 2514, 2520, 2528, 2538, 2549, 2550, 2551, 2552, 2553, 2554, 2555, 2565, 2573, 2579, 2583, 2585, 2587, 2589, 2591, 2593, 2595, 2610, 2616, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2626, 2628, 2630, 2632, 2634, 2636, 2640, 2646, 2654, 2664, 2676, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2707, 2717, 2725, 2731, 2735, 2737, 2739, 2741, 2743, 2745, 2760, 2766, 2768, 2769, 2770, 2771, 2772, 2773, 2774, 2776, 2778, 2780, 2782, 2784, 2788, 2794, 2802, 2812, 2824, 2838, 2853, 2854, 2855, 2856, 2857, 2858, 2859, 2873, 2885, 2895, 2903, 2909, 2913, 2915, 2917, 2919, 2921, 2942, 2944, 2945, 2946, 2947, 2948, 2949, 2950, 2952, 2954, 2956, 2958, 2962, 2968, 2976, 2986, 2998, 3012, 3028, 3045, 3046, 3047, 3048, 3049, 3050, 3051, 3067, 3081, 3093, 3103, 3111, 3117, 3121, 3123, 3125, 3127, 3142, 3148, 3150, 3151, 3152, 3153, 3154, 3155, 3156, 3158, 3160, 3162, 3166, 3172, 3180, 3190, 3202, 3216, 3232, 3250, 3269, 3270, 3271, 3272, 3273, 3274, 3275, 3293, 3309, 3323, 3335, 3345, 3353, 3359, 3363, 3365, 3367, 3382, 3388, 3390, 3391, 3392, 3393, 3394, 3395, 3396, 3398, 3400, 3404, 3410, 3418, 3428, 3440, 3454, 3470, 3488, 3508, 3529, 3530, 3531, 3532, 3533, 3534, 3535, 3555, 3573, 3589, 3603, 3615, 3625, 3633, 3639, 3643, 3645, 3660, 3662, 3665, 3667, 3668, 3669, 3670, 3671, 3672, 3673, 3675, 3679, 3685, 3693, 3703, 3715, 3729, 3745, 3763, 3783, 3805, 3828, 3829, 3830, 3831, 3832, 3833, 3834, 3856, 3876, 3894, 3910, 3924, 3936, 3946, 3954, 3960, 3964, 3979]
Discarding 925 places :
Implicit Place search using SMT only with invariants took 8729 ms to find 925 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3380/4305 places, 10344/10344 transitions.
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 287 place count 3093 transition count 10057
Iterating global reduction 0 with 287 rules applied. Total rules applied 574 place count 3093 transition count 10057
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 861 place count 2806 transition count 9770
Iterating global reduction 0 with 287 rules applied. Total rules applied 1148 place count 2806 transition count 9770
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1151 place count 2806 transition count 9767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1154 place count 2803 transition count 9767
Applied a total of 1154 rules in 1488 ms. Remains 2803 /3380 variables (removed 577) and now considering 9767/10344 (removed 577) transitions.
[2024-05-25 12:44:02] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
// Phase 1: matrix 8881 rows 2803 cols
[2024-05-25 12:44:02] [INFO ] Computed 64 invariants in 168 ms
[2024-05-25 12:44:07] [INFO ] Implicit Places using invariants in 4472 ms returned [1274, 1919]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4479 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2801/4305 places, 9767/10344 transitions.
Applied a total of 0 rules in 490 ms. Remains 2801 /2801 variables (removed 0) and now considering 9767/9767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 15730 ms. Remains : 2801/4305 places, 9767/10344 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:44:08] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
// Phase 1: matrix 8881 rows 2801 cols
[2024-05-25 12:44:08] [INFO ] Computed 62 invariants in 118 ms
[2024-05-25 12:44:08] [INFO ] [Real]Absence check using 47 positive place invariants in 38 ms returned sat
[2024-05-25 12:44:08] [INFO ] [Real]Absence check using 47 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 12:44:12] [INFO ] After 3723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:44:12] [INFO ] [Nat]Absence check using 47 positive place invariants in 40 ms returned sat
[2024-05-25 12:44:12] [INFO ] [Nat]Absence check using 47 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-25 12:44:16] [INFO ] After 3262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:44:16] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:44:23] [INFO ] After 6944ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:44:25] [INFO ] Deduced a trap composed of 310 places in 1907 ms of which 3 ms to minimize.
[2024-05-25 12:44:27] [INFO ] Deduced a trap composed of 295 places in 1955 ms of which 3 ms to minimize.
[2024-05-25 12:44:30] [INFO ] Deduced a trap composed of 289 places in 2144 ms of which 3 ms to minimize.
[2024-05-25 12:44:32] [INFO ] Deduced a trap composed of 298 places in 2196 ms of which 3 ms to minimize.
[2024-05-25 12:44:35] [INFO ] Deduced a trap composed of 318 places in 2195 ms of which 3 ms to minimize.
[2024-05-25 12:44:38] [INFO ] Deduced a trap composed of 290 places in 2150 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:44:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:44:38] [INFO ] After 26408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 2801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2801/2801 places, 9767/9767 transitions.
Applied a total of 0 rules in 508 ms. Remains 2801 /2801 variables (removed 0) and now considering 9767/9767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 2801/2801 places, 9767/9767 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 p1 (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND p3 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))))), (F (AND p0 p3 p1)), (F (NOT (AND p0 p1 p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)))), (F (AND p3 p1))]
Knowledge based reduction with 9 factoid took 426 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 4642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4642/4642 places, 7941/7941 transitions.
Applied a total of 0 rules in 440 ms. Remains 4642 /4642 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
[2024-05-25 12:44:40] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
// Phase 1: matrix 7341 rows 4642 cols
[2024-05-25 12:44:40] [INFO ] Computed 989 invariants in 185 ms
[2024-05-25 12:44:45] [INFO ] Implicit Places using invariants in 4894 ms returned []
[2024-05-25 12:44:45] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:44:45] [INFO ] Invariant cache hit.
[2024-05-25 12:44:49] [INFO ] Implicit Places using invariants and state equation in 3423 ms returned []
Implicit Place search using SMT with State Equation took 8317 ms to find 0 implicit places.
[2024-05-25 12:44:49] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:44:49] [INFO ] Invariant cache hit.
[2024-05-25 12:44:53] [INFO ] Dead Transitions using invariants and state equation in 4453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13212 ms. Remains : 4642/4642 places, 7941/7941 transitions.
Computed a total of 2043 stabilizing places and 2765 stable transitions
Computed a total of 2043 stabilizing places and 2765 stable transitions
Detected a total of 2043/4642 stabilizing places and 2765/7941 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 23476 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23476 steps, saw 10954 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:44:57] [INFO ] Flow matrix only has 7341 transitions (discarded 600 similar events)
[2024-05-25 12:44:57] [INFO ] Invariant cache hit.
[2024-05-25 12:44:58] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:44:58] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 282 ms returned sat
[2024-05-25 12:44:58] [INFO ] After 1176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 12:44:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 12:44:59] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2024-05-25 12:45:04] [INFO ] After 4711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 12:45:04] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:45:07] [INFO ] After 2612ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 12:45:12] [INFO ] Deduced a trap composed of 775 places in 4622 ms of which 4 ms to minimize.
[2024-05-25 12:45:16] [INFO ] Deduced a trap composed of 516 places in 4422 ms of which 5 ms to minimize.
[2024-05-25 12:45:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10058 ms
[2024-05-25 12:45:22] [INFO ] Deduced a trap composed of 430 places in 4417 ms of which 4 ms to minimize.
[2024-05-25 12:45:27] [INFO ] Deduced a trap composed of 470 places in 4406 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:45:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:45:27] [INFO ] After 28733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 4642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4642/4642 places, 7941/7941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4641 transition count 7935
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4641 transition count 7935
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 339 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 676 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 701 place count 4304 transition count 10343
Applied a total of 701 rules in 2182 ms. Remains 4304 /4642 variables (removed 338) and now considering 10343/7941 (removed -2402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2182 ms. Remains : 4304/4642 places, 10343/7941 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:45:30] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:45:30] [INFO ] Computed 989 invariants in 223 ms
[2024-05-25 12:45:30] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 12:45:31] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 266 ms returned sat
[2024-05-25 12:45:37] [INFO ] After 6835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:45:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 12:45:37] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 254 ms returned sat
[2024-05-25 12:45:44] [INFO ] After 6027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:45:44] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:45:47] [INFO ] After 3560ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:45:52] [INFO ] Deduced a trap composed of 537 places in 4653 ms of which 4 ms to minimize.
[2024-05-25 12:45:57] [INFO ] Deduced a trap composed of 358 places in 4892 ms of which 5 ms to minimize.
[2024-05-25 12:45:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10364 ms
[2024-05-25 12:45:58] [INFO ] After 14567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 577 ms.
[2024-05-25 12:45:59] [INFO ] After 22136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4304 transition count 10342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4303 transition count 10342
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4303 transition count 10341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4302 transition count 10341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4301 transition count 10340
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4301 transition count 10340
Applied a total of 6 rules in 1384 ms. Remains 4301 /4304 variables (removed 3) and now considering 10340/10343 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1384 ms. Remains : 4301/4304 places, 10340/10343 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21751 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21751 steps, saw 9972 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:46:04] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 12:46:04] [INFO ] Computed 989 invariants in 230 ms
[2024-05-25 12:46:05] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 12:46:05] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 254 ms returned sat
[2024-05-25 12:46:05] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:46:05] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 12:46:06] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 253 ms returned sat
[2024-05-25 12:46:10] [INFO ] After 4208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:46:10] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:46:15] [INFO ] After 4552ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:46:15] [INFO ] After 5444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 561 ms.
[2024-05-25 12:46:16] [INFO ] After 11139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 544 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 563 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 12:46:17] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 12:46:17] [INFO ] Invariant cache hit.
[2024-05-25 12:46:26] [INFO ] Implicit Places using invariants in 9263 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2511, 2517, 2525, 2535, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2562, 2570, 2576, 2580, 2582, 2584, 2586, 2588, 2590, 2592, 2607, 2613, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2637, 2643, 2651, 2661, 2673, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2704, 2714, 2722, 2728, 2732, 2734, 2736, 2738, 2740, 2742, 2757, 2763, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2773, 2775, 2777, 2779, 2781, 2785, 2791, 2799, 2809, 2821, 2835, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2870, 2882, 2892, 2900, 2906, 2910, 2912, 2914, 2916, 2918, 2933, 2939, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2949, 2951, 2953, 2955, 2959, 2965, 2973, 2983, 2995, 3009, 3025, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3064, 3078, 3090, 3100, 3108, 3114, 3118, 3120, 3122, 3124, 3139, 3145, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3155, 3157, 3159, 3163, 3169, 3177, 3187, 3199, 3213, 3229, 3247, 3266, 3267, 3268, 3269, 3270, 3271, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360, 3362, 3364, 3379, 3385, 3387, 3388, 3389, 3390, 3391, 3392, 3393, 3395, 3397, 3401, 3407, 3415, 3425, 3437, 3451, 3467, 3485, 3505, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3552, 3570, 3586, 3600, 3612, 3622, 3630, 3636, 3640, 3642, 3657, 3659, 3662, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3672, 3676, 3682, 3690, 3700, 3712, 3726, 3742, 3760, 3780, 3802, 3825, 3826, 3827, 3828, 3829, 3830, 3831, 3853, 3873, 3891, 3907, 3921, 3933, 3943, 3951, 3957, 3961, 3976]
Discarding 926 places :
Implicit Place search using SMT only with invariants took 9277 ms to find 926 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3375/4301 places, 10340/10340 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3087 transition count 10052
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3087 transition count 10052
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 2799 transition count 9764
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 2799 transition count 9764
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 2799 transition count 9761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 2796 transition count 9761
Applied a total of 1158 rules in 1449 ms. Remains 2796 /3375 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2024-05-25 12:46:28] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2796 cols
[2024-05-25 12:46:28] [INFO ] Computed 63 invariants in 169 ms
[2024-05-25 12:46:32] [INFO ] Implicit Places using invariants in 4425 ms returned [1373, 1517]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4436 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 505 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16231 ms. Remains : 2794/4301 places, 9761/10340 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25577 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25577 steps, saw 10895 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:46:36] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 12:46:36] [INFO ] Computed 61 invariants in 127 ms
[2024-05-25 12:46:37] [INFO ] [Real]Absence check using 47 positive place invariants in 39 ms returned sat
[2024-05-25 12:46:37] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 17 ms returned sat
[2024-05-25 12:46:41] [INFO ] After 4040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 12:46:41] [INFO ] [Nat]Absence check using 47 positive place invariants in 42 ms returned sat
[2024-05-25 12:46:41] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-25 12:46:45] [INFO ] After 3606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:46:45] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:46:47] [INFO ] After 2374ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 12:46:48] [INFO ] After 3099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 455 ms.
[2024-05-25 12:46:48] [INFO ] After 7657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 502 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 504 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-25 12:46:49] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:46:49] [INFO ] Invariant cache hit.
[2024-05-25 12:46:53] [INFO ] Implicit Places using invariants in 4156 ms returned []
[2024-05-25 12:46:53] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:46:53] [INFO ] Invariant cache hit.
[2024-05-25 12:47:00] [INFO ] Implicit Places using invariants and state equation in 6623 ms returned []
Implicit Place search using SMT with State Equation took 10781 ms to find 0 implicit places.
[2024-05-25 12:47:01] [INFO ] Redundant transitions in 1268 ms returned []
[2024-05-25 12:47:01] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 12:47:01] [INFO ] Invariant cache hit.
[2024-05-25 12:47:06] [INFO ] Dead Transitions using invariants and state equation in 5078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17637 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1 p2))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 234 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 2260 reset in 1140 ms.
Product exploration explored 100000 steps with 2260 reset in 1167 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 265 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 4642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4642/4642 places, 7941/7941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4641 transition count 7935
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4641 transition count 7935
Applied a total of 2 rules in 974 ms. Remains 4641 /4642 variables (removed 1) and now considering 7935/7941 (removed 6) transitions.
[2024-05-25 12:47:12] [INFO ] Redundant transitions in 852 ms returned []
[2024-05-25 12:47:12] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2024-05-25 12:47:12] [INFO ] Computed 989 invariants in 182 ms
[2024-05-25 12:47:17] [INFO ] Dead Transitions using invariants and state equation in 4822 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/4642 places, 7935/7941 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6661 ms. Remains : 4641/4642 places, 7935/7941 transitions.
Built C files in :
/tmp/ltsmin5561239471925962797
[2024-05-25 12:47:17] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5561239471925962797
Running compilation step : cd /tmp/ltsmin5561239471925962797;'/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/ltsmin5561239471925962797;'/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/ltsmin5561239471925962797;'/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 4642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4642/4642 places, 7941/7941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4641 transition count 7935
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4641 transition count 7935
Applied a total of 2 rules in 797 ms. Remains 4641 /4642 variables (removed 1) and now considering 7935/7941 (removed 6) transitions.
[2024-05-25 12:47:20] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:47:20] [INFO ] Invariant cache hit.
[2024-05-25 12:47:25] [INFO ] Implicit Places using invariants in 4860 ms returned []
[2024-05-25 12:47:25] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:47:25] [INFO ] Invariant cache hit.
[2024-05-25 12:47:30] [INFO ] Implicit Places using invariants and state equation in 5006 ms returned []
Implicit Place search using SMT with State Equation took 9868 ms to find 0 implicit places.
[2024-05-25 12:47:30] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
[2024-05-25 12:47:30] [INFO ] Invariant cache hit.
[2024-05-25 12:47:35] [INFO ] Dead Transitions using invariants and state equation in 4849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4641/4642 places, 7935/7941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15515 ms. Remains : 4641/4642 places, 7935/7941 transitions.
Built C files in :
/tmp/ltsmin8998974379277095000
[2024-05-25 12:47:35] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8998974379277095000
Running compilation step : cd /tmp/ltsmin8998974379277095000;'/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/ltsmin8998974379277095000;'/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/ltsmin8998974379277095000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:47:39] [INFO ] Flatten gal took : 208 ms
[2024-05-25 12:47:39] [INFO ] Flatten gal took : 217 ms
[2024-05-25 12:47:39] [INFO ] Time to serialize gal into /tmp/LTL756811093826687328.gal : 36 ms
[2024-05-25 12:47:39] [INFO ] Time to serialize properties into /tmp/LTL16939463093473076383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL756811093826687328.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16714115925262733537.hoa' '-atoms' '/tmp/LTL16939463093473076383.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/LTL16939463093473076383.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16714115925262733537.hoa
Detected timeout of ITS tools.
[2024-05-25 12:47:54] [INFO ] Flatten gal took : 205 ms
[2024-05-25 12:47:54] [INFO ] Flatten gal took : 210 ms
[2024-05-25 12:47:54] [INFO ] Time to serialize gal into /tmp/LTL16901508363668548939.gal : 33 ms
[2024-05-25 12:47:54] [INFO ] Time to serialize properties into /tmp/LTL12412676722570680971.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/LTL16901508363668548939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12412676722570680971.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(G("(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15Notif...369
Formula 0 simplified : XX(XF!"(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15NotifyThatHe...351
Detected timeout of ITS tools.
[2024-05-25 12:48:10] [INFO ] Flatten gal took : 209 ms
[2024-05-25 12:48:10] [INFO ] Applying decomposition
[2024-05-25 12:48:10] [INFO ] Flatten gal took : 212 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/graph8915903237967246089.txt' '-o' '/tmp/graph8915903237967246089.bin' '-w' '/tmp/graph8915903237967246089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8915903237967246089.bin' '-l' '-1' '-v' '-w' '/tmp/graph8915903237967246089.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:48:10] [INFO ] Decomposing Gal with order
[2024-05-25 12:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:48:12] [INFO ] Removed a total of 6613 redundant transitions.
[2024-05-25 12:48:12] [INFO ] Flatten gal took : 1116 ms
[2024-05-25 12:48:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4589 labels/synchronizations in 318 ms.
[2024-05-25 12:48:12] [INFO ] Time to serialize gal into /tmp/LTL13595007766617850566.gal : 58 ms
[2024-05-25 12:48:12] [INFO ] Time to serialize properties into /tmp/LTL16581674602681897473.ltl : 4 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/LTL13595007766617850566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16581674602681897473.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(G("(i25.u376.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((i13.u160.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode1...431
Formula 0 simplified : XX(XF!"(i25.u376.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((i13.u160.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(...413
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17405979119920348957
[2024-05-25 12:48:28] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17405979119920348957
Running compilation step : cd /tmp/ltsmin17405979119920348957;'/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/ltsmin17405979119920348957;'/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/ltsmin17405979119920348957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 finished in 360014 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)))'
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 G(p2)))))) U G(!p2)))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02
Stuttering acceptance computed with spot in 373 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
Support contains 8 out of 5025 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5025/5025 places, 8414/8414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5025 transition count 8409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5020 transition count 8409
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 10 place count 5020 transition count 8098
Deduced a syphon composed of 311 places in 5 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 632 place count 4709 transition count 8098
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 645 place count 4696 transition count 8055
Iterating global reduction 2 with 13 rules applied. Total rules applied 658 place count 4696 transition count 8055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 658 place count 4696 transition count 8053
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 662 place count 4694 transition count 8053
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 669 place count 4687 transition count 8011
Iterating global reduction 2 with 7 rules applied. Total rules applied 676 place count 4687 transition count 8011
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 734 place count 4658 transition count 7982
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 739 place count 4653 transition count 7977
Iterating global reduction 2 with 5 rules applied. Total rules applied 744 place count 4653 transition count 7977
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 744 place count 4653 transition count 7974
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 750 place count 4650 transition count 7974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 755 place count 4645 transition count 7944
Iterating global reduction 2 with 5 rules applied. Total rules applied 760 place count 4645 transition count 7944
Applied a total of 760 rules in 2864 ms. Remains 4645 /5025 variables (removed 380) and now considering 7944/8414 (removed 470) transitions.
[2024-05-25 12:48:34] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4645 cols
[2024-05-25 12:48:34] [INFO ] Computed 989 invariants in 179 ms
[2024-05-25 12:48:38] [INFO ] Implicit Places using invariants in 3549 ms returned []
[2024-05-25 12:48:38] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:48:38] [INFO ] Invariant cache hit.
[2024-05-25 12:48:42] [INFO ] Implicit Places using invariants and state equation in 4467 ms returned []
Implicit Place search using SMT with State Equation took 8017 ms to find 0 implicit places.
[2024-05-25 12:48:42] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:48:42] [INFO ] Invariant cache hit.
[2024-05-25 12:48:47] [INFO ] Dead Transitions using invariants and state equation in 5027 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4645/5025 places, 7944/8414 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15909 ms. Remains : 4645/5025 places, 7944/8414 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p2, acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s113 1) (GEQ s114 1) (GEQ s2040 1)), p0:(AND (GEQ s1191 1) (GEQ s1327 1)), p1:(AND (GEQ s3835 1) (GEQ s3971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24964 reset in 2309 ms.
Product exploration explored 100000 steps with 24787 reset in 2345 ms.
Computed a total of 2046 stabilizing places and 2768 stable transitions
Computed a total of 2046 stabilizing places and 2768 stable transitions
Detected a total of 2046/4645 stabilizing places and 2768/7944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 307 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 615 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 12:48:54] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:48:54] [INFO ] Invariant cache hit.
[2024-05-25 12:48:55] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 12:48:55] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2024-05-25 12:49:00] [INFO ] After 6287ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:6
[2024-05-25 12:49:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 12:49:01] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 267 ms returned sat
[2024-05-25 12:49:12] [INFO ] After 10987ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2024-05-25 12:49:12] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:49:20] [INFO ] After 7373ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :6 sat :4
[2024-05-25 12:49:25] [INFO ] After 12703ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 12:49:25] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 4645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4645/4645 places, 7944/7944 transitions.
Free-agglomeration rule (complex) applied 285 times.
Iterating global reduction 0 with 285 rules applied. Total rules applied 285 place count 4645 transition count 7659
Reduce places removed 285 places and 0 transitions.
Iterating post reduction 0 with 285 rules applied. Total rules applied 570 place count 4360 transition count 7659
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 618 place count 4360 transition count 7659
Applied a total of 618 rules in 1451 ms. Remains 4360 /4645 variables (removed 285) and now considering 7659/7944 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451 ms. Remains : 4360/4645 places, 7659/7944 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 24410 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24410 steps, saw 11379 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:49:30] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
// Phase 1: matrix 6774 rows 4360 cols
[2024-05-25 12:49:30] [INFO ] Computed 989 invariants in 161 ms
[2024-05-25 12:49:31] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2024-05-25 12:49:31] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 245 ms returned sat
[2024-05-25 12:49:36] [INFO ] After 4714ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 12:49:36] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:49:37] [INFO ] After 770ms SMT Verify possible using 2862 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 12:49:37] [INFO ] After 6640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 12:49:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 12:49:38] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 251 ms returned sat
[2024-05-25 12:49:46] [INFO ] After 8369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 12:49:59] [INFO ] After 12618ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 12:50:05] [INFO ] Deduced a trap composed of 435 places in 4129 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:50:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:50:05] [INFO ] After 28305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 4360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4360/4360 places, 7659/7659 transitions.
Applied a total of 0 rules in 410 ms. Remains 4360 /4360 variables (removed 0) and now considering 7659/7659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 4360/4360 places, 7659/7659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4360/4360 places, 7659/7659 transitions.
Applied a total of 0 rules in 410 ms. Remains 4360 /4360 variables (removed 0) and now considering 7659/7659 (removed 0) transitions.
[2024-05-25 12:50:06] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:50:06] [INFO ] Invariant cache hit.
[2024-05-25 12:50:09] [INFO ] Implicit Places using invariants in 3222 ms returned []
[2024-05-25 12:50:09] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:50:09] [INFO ] Invariant cache hit.
[2024-05-25 12:50:12] [INFO ] Implicit Places using invariants and state equation in 3011 ms returned []
Implicit Place search using SMT with State Equation took 6235 ms to find 0 implicit places.
[2024-05-25 12:50:13] [INFO ] Redundant transitions in 759 ms returned []
[2024-05-25 12:50:13] [INFO ] Flow matrix only has 6774 transitions (discarded 885 similar events)
[2024-05-25 12:50:13] [INFO ] Invariant cache hit.
[2024-05-25 12:50:17] [INFO ] Dead Transitions using invariants and state equation in 4092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11504 ms. Remains : 4360/4360 places, 7659/7659 transitions.
Graph (trivial) has 2704 edges and 4360 vertex of which 25 / 4360 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 12289 edges and 4336 vertex of which 4314 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3657.t4022 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 242 rules applied. Total rules applied 244 place count 3928 transition count 5932
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 720 rules applied. Total rules applied 964 place count 3687 transition count 5453
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1642 place count 3447 transition count 5015
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2277 place count 3208 transition count 4619
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 557 rules applied. Total rules applied 2834 place count 3009 transition count 4261
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3351 place count 2812 transition count 3941
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 447 rules applied. Total rules applied 3798 place count 2651 transition count 3655
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4209 place count 2492 transition count 3403
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4558 place count 2365 transition count 3181
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4875 place count 2240 transition count 2989
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5138 place count 2143 transition count 2823
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5373 place count 2048 transition count 2683
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5562 place count 1977 transition count 2565
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5727 place count 1908 transition count 2469
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 127 rules applied. Total rules applied 5854 place count 1859 transition count 2391
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 5961 place count 1812 transition count 2331
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 16 with 77 rules applied. Total rules applied 6038 place count 1781 transition count 2285
Ensure Unique test removed 12 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 17 with 61 rules applied. Total rules applied 6099 place count 1752 transition count 2253
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 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 18 with 40 rules applied. Total rules applied 6139 place count 1735 transition count 2230
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 29 rules applied. Total rules applied 6168 place count 1720 transition count 2216
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6184 place count 1712 transition count 2208
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 6192 place count 1706 transition count 2206
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6194 place count 1704 transition count 2206
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 300 Pre rules applied. Total rules applied 6194 place count 1704 transition count 1906
Deduced a syphon composed of 300 places in 1 ms
Ensure Unique test removed 298 places
Reduce places removed 598 places and 0 transitions.
Iterating global reduction 23 with 898 rules applied. Total rules applied 7092 place count 1106 transition count 1906
Discarding 311 places :
Symmetric choice reduction at 23 with 311 rule applications. Total rules 7403 place count 795 transition count 1595
Iterating global reduction 23 with 311 rules applied. Total rules applied 7714 place count 795 transition count 1595
Discarding 46 places :
Symmetric choice reduction at 23 with 46 rule applications. Total rules 7760 place count 749 transition count 1319
Iterating global reduction 23 with 46 rules applied. Total rules applied 7806 place count 749 transition count 1319
Discarding 527 places :
Symmetric choice reduction at 23 with 527 rule applications. Total rules 8333 place count 222 transition count 792
Iterating global reduction 23 with 527 rules applied. Total rules applied 8860 place count 222 transition count 792
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 23 with 527 rules applied. Total rules applied 9387 place count 222 transition count 265
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 24 with 48 rules applied. Total rules applied 9435 place count 198 transition count 241
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 24 with 18 rules applied. Total rules applied 9453 place count 198 transition count 223
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 24 with 17 rules applied. Total rules applied 9470 place count 198 transition count 206
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 25 with 18 rules applied. Total rules applied 9488 place count 181 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 9489 place count 180 transition count 205
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 9490 place count 180 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 9491 place count 179 transition count 204
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 28 with 10 rules applied. Total rules applied 9501 place count 179 transition count 194
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 28 with 10 rules applied. Total rules applied 9511 place count 169 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 9512 place count 169 transition count 194
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 29 with 3 rules applied. Total rules applied 9515 place count 169 transition count 194
Applied a total of 9515 rules in 2941 ms. Remains 169 /4360 variables (removed 4191) and now considering 194/7659 (removed 7465) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 194 rows 169 cols
[2024-05-25 12:50:20] [INFO ] Computed 43 invariants in 4 ms
[2024-05-25 12:50:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 12:50:20] [INFO ] [Real]Absence check using 4 positive and 39 generalized place invariants in 12 ms returned sat
[2024-05-25 12:50:20] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-25 12:50:20] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-25 12:50:20] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:1
[2024-05-25 12:50:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:50:20] [INFO ] [Nat]Absence check using 4 positive and 39 generalized place invariants in 7 ms returned sat
[2024-05-25 12:50:20] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 12:50:20] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-25 12:50:20] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 18 factoid took 1832 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 216 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 4645 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4645/4645 places, 7944/7944 transitions.
Applied a total of 0 rules in 394 ms. Remains 4645 /4645 variables (removed 0) and now considering 7944/7944 (removed 0) transitions.
[2024-05-25 12:50:23] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4645 cols
[2024-05-25 12:50:23] [INFO ] Computed 989 invariants in 177 ms
[2024-05-25 12:50:27] [INFO ] Implicit Places using invariants in 3609 ms returned []
[2024-05-25 12:50:27] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:50:27] [INFO ] Invariant cache hit.
[2024-05-25 12:50:31] [INFO ] Implicit Places using invariants and state equation in 4755 ms returned []
Implicit Place search using SMT with State Equation took 8366 ms to find 0 implicit places.
[2024-05-25 12:50:31] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:50:31] [INFO ] Invariant cache hit.
[2024-05-25 12:50:36] [INFO ] Dead Transitions using invariants and state equation in 4909 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13671 ms. Remains : 4645/4645 places, 7944/7944 transitions.
Computed a total of 2046 stabilizing places and 2768 stable transitions
Computed a total of 2046 stabilizing places and 2768 stable transitions
Detected a total of 2046/4645 stabilizing places and 2768/7944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), true, (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:50:37] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
[2024-05-25 12:50:37] [INFO ] Invariant cache hit.
[2024-05-25 12:50:38] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2024-05-25 12:50:38] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 268 ms returned sat
[2024-05-25 12:50:41] [INFO ] After 4428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:50:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 12:50:42] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 265 ms returned sat
[2024-05-25 12:50:46] [INFO ] After 3408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:50:46] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2024-05-25 12:50:46] [INFO ] After 608ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:50:51] [INFO ] Deduced a trap composed of 324 places in 4576 ms of which 5 ms to minimize.
[2024-05-25 12:50:56] [INFO ] Deduced a trap composed of 418 places in 4491 ms of which 5 ms to minimize.
[2024-05-25 12:50:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9962 ms
[2024-05-25 12:50:56] [INFO ] After 10743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 285 ms.
[2024-05-25 12:50:57] [INFO ] After 15294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4645/4645 places, 7944/7944 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4645 transition count 7943
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4644 transition count 7943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4643 transition count 7942
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4643 transition count 7942
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4643 transition count 7941
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4642 transition count 7941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4641 transition count 7935
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4641 transition count 7935
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 345 place count 4641 transition count 10343
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 682 place count 4304 transition count 10343
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 706 place count 4304 transition count 10343
Applied a total of 706 rules in 2671 ms. Remains 4304 /4645 variables (removed 341) and now considering 10343/7944 (removed -2399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2671 ms. Remains : 4304/4645 places, 10343/7944 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22957 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22957 steps, saw 10515 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:51:03] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
// Phase 1: matrix 9457 rows 4304 cols
[2024-05-25 12:51:03] [INFO ] Computed 989 invariants in 247 ms
[2024-05-25 12:51:04] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:51:04] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 270 ms returned sat
[2024-05-25 12:51:08] [INFO ] After 4468ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:51:09] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:51:10] [INFO ] After 1170ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:51:10] [INFO ] After 6583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:51:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 12:51:10] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 254 ms returned sat
[2024-05-25 12:51:15] [INFO ] After 4194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:51:16] [INFO ] After 1724ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:51:21] [INFO ] Deduced a trap composed of 239 places in 4682 ms of which 4 ms to minimize.
[2024-05-25 12:51:26] [INFO ] Deduced a trap composed of 316 places in 4419 ms of which 4 ms to minimize.
[2024-05-25 12:51:34] [INFO ] Deduced a trap composed of 327 places in 4687 ms of which 4 ms to minimize.
[2024-05-25 12:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 18200 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 12:51:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:51:35] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 4304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 559 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 4304/4304 places, 10343/10343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4304/4304 places, 10343/10343 transitions.
Applied a total of 0 rules in 537 ms. Remains 4304 /4304 variables (removed 0) and now considering 10343/10343 (removed 0) transitions.
[2024-05-25 12:51:36] [INFO ] Flow matrix only has 9457 transitions (discarded 886 similar events)
[2024-05-25 12:51:36] [INFO ] Invariant cache hit.
[2024-05-25 12:51:44] [INFO ] Implicit Places using invariants in 8632 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1096, 1108, 1122, 1137, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1169, 1179, 1187, 1193, 1197, 1199, 1201, 1203, 1205, 1207, 1223, 1229, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1257, 1265, 1275, 1287, 1300, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1328, 1336, 1342, 1346, 1348, 1350, 1352, 1354, 1356, 1358, 1373, 1379, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1389, 1391, 1393, 1395, 1397, 1399, 1403, 1409, 1417, 1427, 1438, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1462, 1468, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1486, 1501, 1507, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1529, 1533, 1539, 1547, 1556, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1576, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1611, 1617, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1641, 1645, 1651, 1658, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1707, 1713, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1743, 1748, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1778, 1793, 1799, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1827, 1830, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1873, 1879, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1937, 1952, 1954, 1957, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2015, 2036, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2094, 2109, 2115, 2117, 2118, 2119, 2120, 2121, 2122, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2145, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2189, 2195, 2197, 2198, 2199, 2200, 2201, 2202, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2227, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2275, 2281, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2307, 2311, 2317, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2336, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2356, 2371, 2377, 2379, 2380, 2381, 2382, 2383, 2384, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2401, 2405, 2411, 2419, 2428, 2429, 2430, 2431, 2432, 2433, 2434, 2442, 2448, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2466, 2481, 2487, 2489, 2490, 2491, 2492, 2493, 2494, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2509, 2513, 2519, 2527, 2537, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2564, 2572, 2578, 2582, 2584, 2586, 2588, 2590, 2592, 2594, 2609, 2615, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2625, 2627, 2629, 2631, 2633, 2635, 2639, 2645, 2653, 2663, 2675, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2706, 2716, 2724, 2730, 2734, 2736, 2738, 2740, 2742, 2744, 2759, 2765, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2775, 2777, 2779, 2781, 2783, 2787, 2793, 2801, 2811, 2823, 2837, 2852, 2853, 2854, 2855, 2856, 2857, 2858, 2872, 2884, 2894, 2902, 2908, 2912, 2914, 2916, 2918, 2920, 2935, 2941, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2951, 2953, 2955, 2957, 2961, 2967, 2975, 2985, 2997, 3011, 3027, 3044, 3045, 3046, 3047, 3048, 3049, 3050, 3066, 3080, 3092, 3102, 3110, 3116, 3120, 3122, 3124, 3126, 3141, 3147, 3149, 3150, 3151, 3152, 3153, 3154, 3155, 3157, 3159, 3161, 3165, 3171, 3179, 3189, 3201, 3215, 3231, 3249, 3268, 3269, 3270, 3271, 3272, 3273, 3274, 3292, 3308, 3322, 3334, 3344, 3352, 3358, 3362, 3364, 3366, 3381, 3387, 3389, 3390, 3391, 3392, 3393, 3394, 3395, 3397, 3399, 3403, 3409, 3417, 3427, 3439, 3453, 3469, 3487, 3507, 3528, 3529, 3530, 3531, 3532, 3533, 3534, 3554, 3572, 3588, 3602, 3614, 3624, 3632, 3638, 3642, 3644, 3659, 3661, 3664, 3666, 3667, 3668, 3669, 3670, 3671, 3672, 3674, 3678, 3684, 3692, 3702, 3714, 3728, 3744, 3762, 3782, 3804, 3827, 3828, 3829, 3830, 3831, 3832, 3833, 3855, 3875, 3893, 3909, 3923, 3935, 3945, 3953, 3959, 3963, 3978]
Discarding 925 places :
Implicit Place search using SMT only with invariants took 8648 ms to find 925 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3379/4304 places, 10343/10343 transitions.
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 287 place count 3092 transition count 10056
Iterating global reduction 0 with 287 rules applied. Total rules applied 574 place count 3092 transition count 10056
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 861 place count 2805 transition count 9769
Iterating global reduction 0 with 287 rules applied. Total rules applied 1148 place count 2805 transition count 9769
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 1150 place count 2805 transition count 9767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1152 place count 2803 transition count 9767
Applied a total of 1152 rules in 1408 ms. Remains 2803 /3379 variables (removed 576) and now considering 9767/10343 (removed 576) transitions.
[2024-05-25 12:51:46] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
// Phase 1: matrix 8881 rows 2803 cols
[2024-05-25 12:51:46] [INFO ] Computed 64 invariants in 273 ms
[2024-05-25 12:51:50] [INFO ] Implicit Places using invariants in 4422 ms returned [1405, 1423]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4430 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2801/4304 places, 9767/10343 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2801 transition count 9766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2800 transition count 9766
Applied a total of 2 rules in 985 ms. Remains 2800 /2801 variables (removed 1) and now considering 9766/9767 (removed 1) transitions.
[2024-05-25 12:51:51] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
// Phase 1: matrix 8880 rows 2800 cols
[2024-05-25 12:51:51] [INFO ] Computed 62 invariants in 138 ms
[2024-05-25 12:51:55] [INFO ] Implicit Places using invariants in 4153 ms returned []
[2024-05-25 12:51:55] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:51:55] [INFO ] Invariant cache hit.
[2024-05-25 12:52:02] [INFO ] Implicit Places using invariants and state equation in 6314 ms returned []
Implicit Place search using SMT with State Equation took 10468 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2800/4304 places, 9766/10343 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 26477 ms. Remains : 2800/4304 places, 9766/10343 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26867 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26867 steps, saw 11421 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:52:05] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:52:05] [INFO ] Invariant cache hit.
[2024-05-25 12:52:05] [INFO ] [Real]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-05-25 12:52:05] [INFO ] [Real]Absence check using 47 positive and 15 generalized place invariants in 25 ms returned sat
[2024-05-25 12:52:08] [INFO ] After 2788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:52:08] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-05-25 12:52:08] [INFO ] [Nat]Absence check using 47 positive and 15 generalized place invariants in 24 ms returned sat
[2024-05-25 12:52:11] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:52:11] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 12:52:13] [INFO ] After 2220ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:52:15] [INFO ] Deduced a trap composed of 227 places in 1930 ms of which 3 ms to minimize.
[2024-05-25 12:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3150 ms
[2024-05-25 12:52:16] [INFO ] After 5549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-05-25 12:52:17] [INFO ] After 8699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 484 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 482 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
[2024-05-25 12:52:18] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:52:18] [INFO ] Invariant cache hit.
[2024-05-25 12:52:22] [INFO ] Implicit Places using invariants in 4011 ms returned []
[2024-05-25 12:52:22] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:52:22] [INFO ] Invariant cache hit.
[2024-05-25 12:52:28] [INFO ] Implicit Places using invariants and state equation in 6200 ms returned []
Implicit Place search using SMT with State Equation took 10212 ms to find 0 implicit places.
[2024-05-25 12:52:29] [INFO ] Redundant transitions in 1220 ms returned []
[2024-05-25 12:52:29] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-25 12:52:29] [INFO ] Invariant cache hit.
[2024-05-25 12:52:34] [INFO ] Dead Transitions using invariants and state equation in 4849 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16773 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), true, (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 197 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 202 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Product exploration explored 100000 steps with 24879 reset in 2242 ms.
Product exploration explored 100000 steps with 24940 reset in 2294 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 223 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 4645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4645/4645 places, 7944/7944 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4645 transition count 7945
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4645 transition count 7945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 4644 transition count 7943
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 4644 transition count 7943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 4643 transition count 7937
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 4643 transition count 7937
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 5 rules in 1396 ms. Remains 4643 /4645 variables (removed 2) and now considering 7937/7944 (removed 7) transitions.
[2024-05-25 12:52:42] [INFO ] Redundant transitions in 847 ms returned []
[2024-05-25 12:52:42] [INFO ] Flow matrix only has 7337 transitions (discarded 600 similar events)
// Phase 1: matrix 7337 rows 4643 cols
[2024-05-25 12:52:42] [INFO ] Computed 989 invariants in 173 ms
[2024-05-25 12:52:46] [INFO ] Dead Transitions using invariants and state equation in 4569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4643/4645 places, 7937/7944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6823 ms. Remains : 4643/4645 places, 7937/7944 transitions.
Built C files in :
/tmp/ltsmin14148023465226191460
[2024-05-25 12:52:47] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14148023465226191460
Running compilation step : cd /tmp/ltsmin14148023465226191460;'/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/ltsmin14148023465226191460;'/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/ltsmin14148023465226191460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 4645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4645/4645 places, 7944/7944 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4644 transition count 7943
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4644 transition count 7943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4643 transition count 7937
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4643 transition count 7937
Applied a total of 4 rules in 1157 ms. Remains 4643 /4645 variables (removed 2) and now considering 7937/7944 (removed 7) transitions.
[2024-05-25 12:52:51] [INFO ] Flow matrix only has 7337 transitions (discarded 600 similar events)
// Phase 1: matrix 7337 rows 4643 cols
[2024-05-25 12:52:51] [INFO ] Computed 989 invariants in 173 ms
[2024-05-25 12:52:54] [INFO ] Implicit Places using invariants in 3338 ms returned []
[2024-05-25 12:52:54] [INFO ] Flow matrix only has 7337 transitions (discarded 600 similar events)
[2024-05-25 12:52:54] [INFO ] Invariant cache hit.
[2024-05-25 12:52:57] [INFO ] Implicit Places using invariants and state equation in 3238 ms returned []
Implicit Place search using SMT with State Equation took 6577 ms to find 0 implicit places.
[2024-05-25 12:52:57] [INFO ] Flow matrix only has 7337 transitions (discarded 600 similar events)
[2024-05-25 12:52:57] [INFO ] Invariant cache hit.
[2024-05-25 12:53:02] [INFO ] Dead Transitions using invariants and state equation in 4370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4643/4645 places, 7937/7944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12104 ms. Remains : 4643/4645 places, 7937/7944 transitions.
Built C files in :
/tmp/ltsmin11297035207286203028
[2024-05-25 12:53:02] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11297035207286203028
Running compilation step : cd /tmp/ltsmin11297035207286203028;'/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/ltsmin11297035207286203028;'/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/ltsmin11297035207286203028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 12:53:05] [INFO ] Flatten gal took : 201 ms
[2024-05-25 12:53:05] [INFO ] Flatten gal took : 205 ms
[2024-05-25 12:53:05] [INFO ] Time to serialize gal into /tmp/LTL12313878451587539877.gal : 31 ms
[2024-05-25 12:53:05] [INFO ] Time to serialize properties into /tmp/LTL3978069806967244952.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/LTL12313878451587539877.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7684999833149865071.hoa' '-atoms' '/tmp/LTL3978069806967244952.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/LTL3978069806967244952.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7684999833149865071.hoa
Detected timeout of ITS tools.
[2024-05-25 12:53:21] [INFO ] Flatten gal took : 196 ms
[2024-05-25 12:53:21] [INFO ] Flatten gal took : 203 ms
[2024-05-25 12:53:21] [INFO ] Time to serialize gal into /tmp/LTL206750136897426611.gal : 33 ms
[2024-05-25 12:53:21] [INFO ] Time to serialize properties into /tmp/LTL7450734571130811335.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL206750136897426611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7450734571130811335.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...274
Read 1 LTL properties
Checking formula 0 : !(((X(X(G((!("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))"))||(("((Node23HasAskedItsLeafSetToRx4...534
Formula 0 simplified : XXF("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))" & (!"((Node23HasAskedItsLeafSetToRx4ToReplac...514
Detected timeout of ITS tools.
[2024-05-25 12:53:36] [INFO ] Flatten gal took : 227 ms
[2024-05-25 12:53:36] [INFO ] Applying decomposition
[2024-05-25 12:53:36] [INFO ] Flatten gal took : 201 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/graph9767202062606114833.txt' '-o' '/tmp/graph9767202062606114833.bin' '-w' '/tmp/graph9767202062606114833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9767202062606114833.bin' '-l' '-1' '-v' '-w' '/tmp/graph9767202062606114833.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:53:37] [INFO ] Decomposing Gal with order
[2024-05-25 12:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:53:38] [INFO ] Removed a total of 6800 redundant transitions.
[2024-05-25 12:53:38] [INFO ] Flatten gal took : 1168 ms
[2024-05-25 12:53:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4893 labels/synchronizations in 348 ms.
[2024-05-25 12:53:39] [INFO ] Time to serialize gal into /tmp/LTL488202439256696787.gal : 51 ms
[2024-05-25 12:53:39] [INFO ] Time to serialize properties into /tmp/LTL4290337789895014618.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL488202439256696787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4290337789895014618.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(G((!("((i23.u421.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i23.u391.LeafSetOfLx5IsSentToNode4>=1))"))||(("((i24.u19.Nod...627
Formula 0 simplified : XXF("((i23.u421.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i23.u391.LeafSetOfLx5IsSentToNode4>=1))" & (!"((i24.u19.Node23HasAs...607
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1662190159954933043
[2024-05-25 12:53:54] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1662190159954933043
Running compilation step : cd /tmp/ltsmin1662190159954933043;'/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/ltsmin1662190159954933043;'/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/ltsmin1662190159954933043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 finished in 326466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||((p1||G(!p0))&&F(G(!p1)))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-25 12:53:58] [INFO ] Flatten gal took : 216 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10711518082882266049
[2024-05-25 12:53:58] [INFO ] Too many transitions (8414) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:53:58] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10711518082882266049
Running compilation step : cd /tmp/ltsmin10711518082882266049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 12:53:58] [INFO ] Applying decomposition
[2024-05-25 12:53:58] [INFO ] Flatten gal took : 231 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/graph3620675224007800164.txt' '-o' '/tmp/graph3620675224007800164.bin' '-w' '/tmp/graph3620675224007800164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3620675224007800164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3620675224007800164.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:53:59] [INFO ] Decomposing Gal with order
[2024-05-25 12:53:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:54:00] [INFO ] Removed a total of 6536 redundant transitions.
[2024-05-25 12:54:00] [INFO ] Flatten gal took : 716 ms
[2024-05-25 12:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 3481 labels/synchronizations in 244 ms.
[2024-05-25 12:54:00] [INFO ] Time to serialize gal into /tmp/LTLFireability6801998394858291206.gal : 58 ms
[2024-05-25 12:54:00] [INFO ] Time to serialize properties into /tmp/LTLFireability9912232984948658941.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/LTLFireability6801998394858291206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9912232984948658941.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 8 LTL properties
Checking formula 0 : !((X(X((X(G("(i1.u668.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((i23.u204.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14...434
Formula 0 simplified : XX(XF!"(i1.u668.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((i23.u204.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(i...416
Compilation finished in 43671 ms.
Running link step : cd /tmp/ltsmin10711518082882266049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin10711518082882266049;'/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([]((LTLAPp0==true)))||[](((LTLAPp1==true)&&X([](([]((LTLAPp3==true))||(LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin10711518082882266049;'/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([]((LTLAPp0==true)))||[](((LTLAPp1==true)&&X([](([]((LTLAPp3==true))||(LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10711518082882266049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3784944 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16010376 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S24C06, 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-171654372000058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C06.tgz
mv MultiCrashLeafsetExtension-PT-S24C06 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 ;