About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.928 | 3600000.00 | 9509220.00 | 233662.10 | F?T?FFFFFFFTFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821300740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r132-tall-165271821300740
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 15K Apr 29 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 9 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 9 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M May 10 09:34 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 1652848618819
Running Version 202205111006
[2022-05-18 04:36:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 04:36:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 04:37:00] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2022-05-18 04:37:00] [INFO ] Transformed 12464 places.
[2022-05-18 04:37:00] [INFO ] Transformed 18463 transitions.
[2022-05-18 04:37:00] [INFO ] Parsed PT model containing 12464 places and 18463 transitions in 877 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 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 3581 places :
Symmetric choice reduction at 1 with 3581 rule applications. Total rules 3621 place count 8843 transition count 14882
Iterating global reduction 1 with 3581 rules applied. Total rules applied 7202 place count 8843 transition count 14882
Discarding 3289 places :
Symmetric choice reduction at 1 with 3289 rule applications. Total rules 10491 place count 5554 transition count 11593
Iterating global reduction 1 with 3289 rules applied. Total rules applied 13780 place count 5554 transition count 11593
Discarding 533 places :
Symmetric choice reduction at 1 with 533 rule applications. Total rules 14313 place count 5021 transition count 8395
Iterating global reduction 1 with 533 rules applied. Total rules applied 14846 place count 5021 transition count 8395
Applied a total of 14846 rules in 3809 ms. Remains 5021 /12464 variables (removed 7443) and now considering 8395/18463 (removed 10068) transitions.
[2022-05-18 04:37:05] [INFO ] Flow matrix only has 7795 transitions (discarded 600 similar events)
// Phase 1: matrix 7795 rows 5021 cols
[2022-05-18 04:37:05] [INFO ] Computed 989 place invariants in 580 ms
[2022-05-18 04:37:09] [INFO ] Implicit Places using invariants in 4038 ms returned []
[2022-05-18 04:37:09] [INFO ] Flow matrix only has 7795 transitions (discarded 600 similar events)
// Phase 1: matrix 7795 rows 5021 cols
[2022-05-18 04:37:09] [INFO ] Computed 989 place invariants in 196 ms
[2022-05-18 04:37:12] [INFO ] Implicit Places using invariants and state equation in 3618 ms returned []
Implicit Place search using SMT with State Equation took 7690 ms to find 0 implicit places.
[2022-05-18 04:37:12] [INFO ] Flow matrix only has 7795 transitions (discarded 600 similar events)
// Phase 1: matrix 7795 rows 5021 cols
[2022-05-18 04:37:12] [INFO ] Computed 989 place invariants in 183 ms
[2022-05-18 04:37:17] [INFO ] Dead Transitions using invariants and state equation in 4777 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5021/12464 places, 8395/18463 transitions.
Finished structural reductions, in 1 iterations. Remains : 5021/12464 places, 8395/18463 transitions.
Support contains 59 out of 5021 places after structural reductions.
[2022-05-18 04:37:18] [INFO ] Flatten gal took : 474 ms
[2022-05-18 04:37:18] [INFO ] Flatten gal took : 328 ms
[2022-05-18 04:37:19] [INFO ] Input system was already deterministic with 8395 transitions.
Support contains 58 out of 5021 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 34) seen :11
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) 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 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2022-05-18 04:37:19] [INFO ] Flow matrix only has 7795 transitions (discarded 600 similar events)
// Phase 1: matrix 7795 rows 5021 cols
[2022-05-18 04:37:20] [INFO ] Computed 989 place invariants in 213 ms
[2022-05-18 04:37:22] [INFO ] [Real]Absence check using 47 positive place invariants in 54 ms returned sat
[2022-05-18 04:37:22] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 270 ms returned sat
[2022-05-18 04:37:33] [INFO ] After 9191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:16
[2022-05-18 04:37:33] [INFO ] State equation strengthened by 2937 read => feed constraints.
[2022-05-18 04:37:35] [INFO ] After 2262ms SMT Verify possible using 2937 Read/Feed constraints in real domain returned unsat :1 sat :0 real:20
[2022-05-18 04:37:35] [INFO ] After 15411ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2022-05-18 04:37:37] [INFO ] [Nat]Absence check using 47 positive place invariants in 53 ms returned sat
[2022-05-18 04:37:37] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 291 ms returned sat
[2022-05-18 04:37:48] [INFO ] After 9467ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2022-05-18 04:38:00] [INFO ] After 11947ms SMT Verify possible using 2937 Read/Feed constraints in natural domain returned unsat :2 sat :18
[2022-05-18 04:38:00] [INFO ] After 11951ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 04:38:00] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :18
Fused 21 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 31 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5021/5021 places, 8395/8395 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 5021 transition count 8391
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5017 transition count 8391
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 8 place count 5017 transition count 8081
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 628 place count 4707 transition count 8081
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 633 place count 4702 transition count 8071
Iterating global reduction 2 with 5 rules applied. Total rules applied 638 place count 4702 transition count 8071
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 638 place count 4702 transition count 8069
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 642 place count 4700 transition count 8069
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 646 place count 4696 transition count 8045
Iterating global reduction 2 with 4 rules applied. Total rules applied 650 place count 4696 transition count 8045
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 708 place count 4667 transition count 8016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 711 place count 4664 transition count 8013
Iterating global reduction 2 with 3 rules applied. Total rules applied 714 place count 4664 transition count 8013
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 714 place count 4664 transition count 8011
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 718 place count 4662 transition count 8011
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 721 place count 4659 transition count 7993
Iterating global reduction 2 with 3 rules applied. Total rules applied 724 place count 4659 transition count 7993
Free-agglomeration rule (complex) applied 328 times.
Iterating global reduction 2 with 328 rules applied. Total rules applied 1052 place count 4659 transition count 10370
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 2 with 328 rules applied. Total rules applied 1380 place count 4331 transition count 10370
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 1479 place count 4331 transition count 10370
Applied a total of 1479 rules in 4244 ms. Remains 4331 /5021 variables (removed 690) and now considering 10370/8395 (removed -1975) transitions.
Finished structural reductions, in 1 iterations. Remains : 4331/5021 places, 10370/8395 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 703 ms. (steps per millisecond=14 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2022-05-18 04:38:06] [INFO ] Flow matrix only has 9496 transitions (discarded 874 similar events)
// Phase 1: matrix 9496 rows 4331 cols
[2022-05-18 04:38:06] [INFO ] Computed 989 place invariants in 223 ms
[2022-05-18 04:38:07] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 04:38:07] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 246 ms returned sat
[2022-05-18 04:38:18] [INFO ] After 8998ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:16
[2022-05-18 04:38:18] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:38:19] [INFO ] After 1181ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-18 04:38:19] [INFO ] After 13055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-18 04:38:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 04:38:20] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 237 ms returned sat
[2022-05-18 04:38:31] [INFO ] After 9087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-18 04:38:44] [INFO ] After 13168ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-18 04:38:44] [INFO ] After 13169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-18 04:38:44] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 28 out of 4331 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4331/4331 places, 10370/10370 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 4331 transition count 10369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4330 transition count 10369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4330 transition count 10368
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 4 place count 4329 transition count 10368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4328 transition count 10367
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4328 transition count 10367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4328 transition count 10366
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 8 place count 4327 transition count 10366
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 4327 transition count 10365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 4326 transition count 10365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 4325 transition count 10364
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 4325 transition count 10364
Applied a total of 12 rules in 1651 ms. Remains 4325 /4331 variables (removed 6) and now considering 10364/10370 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 4325/4331 places, 10364/10370 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-18 04:38:47] [INFO ] Flow matrix only has 9490 transitions (discarded 874 similar events)
// Phase 1: matrix 9490 rows 4325 cols
[2022-05-18 04:38:48] [INFO ] Computed 989 place invariants in 214 ms
[2022-05-18 04:38:49] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2022-05-18 04:38:49] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 251 ms returned sat
[2022-05-18 04:38:58] [INFO ] After 8098ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2022-05-18 04:38:58] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:38:59] [INFO ] After 881ms SMT Verify possible using 5602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-18 04:38:59] [INFO ] After 11393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-18 04:39:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2022-05-18 04:39:00] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 245 ms returned sat
[2022-05-18 04:39:11] [INFO ] After 9430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-18 04:39:24] [INFO ] After 13346ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 04:39:24] [INFO ] After 13347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 04:39:24] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 23 out of 4325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4325/4325 places, 10364/10364 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 4325 transition count 10363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4324 transition count 10363
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 4324 transition count 10360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 4321 transition count 10360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 4320 transition count 10359
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 4320 transition count 10359
Applied a total of 10 rules in 1354 ms. Remains 4320 /4325 variables (removed 5) and now considering 10359/10364 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 4320/4325 places, 10359/10364 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2397 stabilizing places and 3194 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(G(p0))||G((G(p1)&&p2))||p3)))))'
Support contains 6 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5021/5021 places, 8395/8395 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 5021 transition count 8390
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5016 transition count 8390
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 10 place count 5016 transition count 8080
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 630 place count 4706 transition count 8080
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 638 place count 4698 transition count 8047
Iterating global reduction 2 with 8 rules applied. Total rules applied 646 place count 4698 transition count 8047
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 646 place count 4698 transition count 8045
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 650 place count 4696 transition count 8045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 653 place count 4693 transition count 8027
Iterating global reduction 2 with 3 rules applied. Total rules applied 656 place count 4693 transition count 8027
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 716 place count 4663 transition count 7997
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 721 place count 4658 transition count 7992
Iterating global reduction 2 with 5 rules applied. Total rules applied 726 place count 4658 transition count 7992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 726 place count 4658 transition count 7989
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 732 place count 4655 transition count 7989
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 737 place count 4650 transition count 7959
Iterating global reduction 2 with 5 rules applied. Total rules applied 742 place count 4650 transition count 7959
Applied a total of 742 rules in 2782 ms. Remains 4650 /5021 variables (removed 371) and now considering 7959/8395 (removed 436) transitions.
[2022-05-18 04:39:29] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4650 cols
[2022-05-18 04:39:29] [INFO ] Computed 989 place invariants in 166 ms
[2022-05-18 04:39:33] [INFO ] Implicit Places using invariants in 4292 ms returned [1959]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4300 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4649/5021 places, 7959/8395 transitions.
Applied a total of 0 rules in 496 ms. Remains 4649 /4649 variables (removed 0) and now considering 7959/7959 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4649/5021 places, 7959/8395 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1294 1), p3:(AND (GEQ s12 1) (GEQ s339 1)), p2:(GEQ s2187 1), p1:(AND (GEQ s1891 1) (GEQ s4430 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2216 reset in 1232 ms.
Product exploration explored 100000 steps with 2218 reset in 1167 ms.
Computed a total of 2050 stabilizing places and 2783 stable transitions
Computed a total of 2050 stabilizing places and 2783 stable transitions
Detected a total of 2050/4649 stabilizing places and 2783/7959 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 p1 (NOT p3)))), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p3))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 583 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:39:37] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4649 cols
[2022-05-18 04:39:38] [INFO ] Computed 988 place invariants in 167 ms
[2022-05-18 04:39:38] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2022-05-18 04:39:38] [INFO ] [Real]Absence check using 49 positive and 939 generalized place invariants in 271 ms returned sat
[2022-05-18 04:39:38] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-18 04:39:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2022-05-18 04:39:39] [INFO ] [Nat]Absence check using 49 positive and 939 generalized place invariants in 266 ms returned sat
[2022-05-18 04:39:44] [INFO ] After 4174ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-18 04:39:44] [INFO ] State equation strengthened by 2872 read => feed constraints.
[2022-05-18 04:39:45] [INFO ] After 1004ms SMT Verify possible using 2872 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-18 04:39:45] [INFO ] After 1402ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2022-05-18 04:39:45] [INFO ] After 6749ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 4649 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4649/4649 places, 7959/7959 transitions.
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 0 with 339 rules applied. Total rules applied 339 place count 4649 transition count 10350
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 0 with 339 rules applied. Total rules applied 678 place count 4310 transition count 10350
Partial Free-agglomeration rule applied 74 times.
Drop transitions removed 74 transitions
Iterating global reduction 1 with 74 rules applied. Total rules applied 752 place count 4310 transition count 10350
Applied a total of 752 rules in 1653 ms. Remains 4310 /4649 variables (removed 339) and now considering 10350/7959 (removed -2391) transitions.
Finished structural reductions, in 1 iterations. Remains : 4310/4649 places, 10350/7959 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 339 ms. (steps per millisecond=29 ) 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
Finished probabilistic random walk after 954 steps, run visited all 1 properties in 114 ms. (steps per millisecond=8 )
Probabilistic random walk after 954 steps, saw 563 distinct states, run finished after 114 ms. (steps per millisecond=8 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 p1 (NOT p3)))), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p3))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p3) p1 p2 (NOT p0)))), (G (NOT (AND (NOT p3) p1 p2 p0)))]
False Knowledge obtained : [(F (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)))), (F (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 15 factoid took 700 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Support contains 6 out of 4649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4649/4649 places, 7959/7959 transitions.
Applied a total of 0 rules in 475 ms. Remains 4649 /4649 variables (removed 0) and now considering 7959/7959 (removed 0) transitions.
[2022-05-18 04:39:49] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4649 cols
[2022-05-18 04:39:49] [INFO ] Computed 988 place invariants in 175 ms
[2022-05-18 04:39:54] [INFO ] Implicit Places using invariants in 5029 ms returned []
[2022-05-18 04:39:54] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4649 cols
[2022-05-18 04:39:54] [INFO ] Computed 988 place invariants in 171 ms
[2022-05-18 04:39:59] [INFO ] Implicit Places using invariants and state equation in 4732 ms returned []
Implicit Place search using SMT with State Equation took 9768 ms to find 0 implicit places.
[2022-05-18 04:39:59] [INFO ] Redundant transitions in 883 ms returned []
[2022-05-18 04:39:59] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4649 cols
[2022-05-18 04:40:00] [INFO ] Computed 988 place invariants in 189 ms
[2022-05-18 04:40:04] [INFO ] Dead Transitions using invariants and state equation in 4940 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4649/4649 places, 7959/7959 transitions.
Computed a total of 2050 stabilizing places and 2783 stable transitions
Computed a total of 2050 stabilizing places and 2783 stable transitions
Detected a total of 2050/4649 stabilizing places and 2783/7959 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (OR (NOT p1) (NOT p2) p3)), (X (AND p0 (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (NOT p1) (NOT p2) p3))), (X (X (AND p0 (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 493 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 58 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) 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 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 54 ms. (steps per millisecond=185 ) 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
Interrupted probabilistic random walk after 23007 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 23007 steps, saw 10766 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :2
Running SMT prover for 2 properties.
[2022-05-18 04:40:09] [INFO ] Flow matrix only has 7359 transitions (discarded 600 similar events)
// Phase 1: matrix 7359 rows 4649 cols
[2022-05-18 04:40:09] [INFO ] Computed 988 place invariants in 177 ms
[2022-05-18 04:40:09] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2022-05-18 04:40:10] [INFO ] [Real]Absence check using 49 positive and 939 generalized place invariants in 278 ms returned sat
[2022-05-18 04:40:13] [INFO ] After 4720ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 04:40:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 04:40:14] [INFO ] [Nat]Absence check using 49 positive and 939 generalized place invariants in 269 ms returned sat
[2022-05-18 04:40:18] [INFO ] After 3995ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-18 04:40:18] [INFO ] State equation strengthened by 2872 read => feed constraints.
[2022-05-18 04:40:19] [INFO ] After 743ms SMT Verify possible using 2872 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-18 04:40:24] [INFO ] Deduced a trap composed of 283 places in 4557 ms of which 8 ms to minimize.
[2022-05-18 04:40:29] [INFO ] Deduced a trap composed of 363 places in 4339 ms of which 5 ms to minimize.
[2022-05-18 04:40:34] [INFO ] Deduced a trap composed of 436 places in 4488 ms of which 15 ms to minimize.
[2022-05-18 04:40:39] [INFO ] Deduced a trap composed of 433 places in 4667 ms of which 6 ms to minimize.
[2022-05-18 04:40:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 04:40:39] [INFO ] After 25194ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 4649 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4649/4649 places, 7959/7959 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 4649 transition count 7958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4648 transition count 7958
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 4647 transition count 7957
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4647 transition count 7957
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 4647 transition count 7956
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 6 place count 4646 transition count 7956
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 4645 transition count 7950
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 4645 transition count 7950
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 2 with 338 rules applied. Total rules applied 346 place count 4645 transition count 10347
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 2 with 338 rules applied. Total rules applied 684 place count 4307 transition count 10347
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 733 place count 4307 transition count 10347
Applied a total of 733 rules in 2449 ms. Remains 4307 /4649 variables (removed 342) and now considering 10347/7959 (removed -2388) transitions.
Finished structural reductions, in 1 iterations. Remains : 4307/4649 places, 10347/7959 transitions.
Finished random walk after 3713 steps, including 99 resets, run visited all 1 properties in 131 ms. (steps per millisecond=28 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (OR (NOT p1) (NOT p2) p3)), (X (AND p0 (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (NOT p1) (NOT p2) p3))), (X (X (AND p0 (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 683 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 2214 reset in 1155 ms.
Product exploration explored 100000 steps with 2216 reset in 1142 ms.
Built C files in :
/tmp/ltsmin16966341156332035349
[2022-05-18 04:40:44] [INFO ] Too many transitions (7959) to apply POR reductions. Disabling POR matrices.
[2022-05-18 04:40:45] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16966341156332035349
Running compilation step : cd /tmp/ltsmin16966341156332035349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16966341156332035349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16966341156332035349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 4649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4649/4649 places, 7959/7959 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 4649 transition count 7958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4648 transition count 7958
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 4646 transition count 7951
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4646 transition count 7951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4646 transition count 7950
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 8 place count 4645 transition count 7950
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 4644 transition count 7944
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 4644 transition count 7944
Applied a total of 10 rules in 1261 ms. Remains 4644 /4649 variables (removed 5) and now considering 7944/7959 (removed 15) transitions.
[2022-05-18 04:40:49] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4644 cols
[2022-05-18 04:40:49] [INFO ] Computed 988 place invariants in 172 ms
[2022-05-18 04:40:52] [INFO ] Implicit Places using invariants in 3596 ms returned []
[2022-05-18 04:40:52] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4644 cols
[2022-05-18 04:40:53] [INFO ] Computed 988 place invariants in 168 ms
[2022-05-18 04:40:56] [INFO ] Implicit Places using invariants and state equation in 3634 ms returned []
Implicit Place search using SMT with State Equation took 7241 ms to find 0 implicit places.
[2022-05-18 04:40:57] [INFO ] Redundant transitions in 666 ms returned []
[2022-05-18 04:40:57] [INFO ] Flow matrix only has 7344 transitions (discarded 600 similar events)
// Phase 1: matrix 7344 rows 4644 cols
[2022-05-18 04:40:57] [INFO ] Computed 988 place invariants in 168 ms
[2022-05-18 04:41:02] [INFO ] Dead Transitions using invariants and state equation in 5054 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4644/4649 places, 7944/7959 transitions.
Finished structural reductions, in 1 iterations. Remains : 4644/4649 places, 7944/7959 transitions.
Built C files in :
/tmp/ltsmin1063494112358489669
[2022-05-18 04:41:02] [INFO ] Too many transitions (7944) to apply POR reductions. Disabling POR matrices.
[2022-05-18 04:41:02] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1063494112358489669
Running compilation step : cd /tmp/ltsmin1063494112358489669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1063494112358489669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1063494112358489669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 04:41:06] [INFO ] Flatten gal took : 420 ms
[2022-05-18 04:41:07] [INFO ] Flatten gal took : 608 ms
[2022-05-18 04:41:07] [INFO ] Time to serialize gal into /tmp/LTL18209627268274257360.gal : 63 ms
[2022-05-18 04:41:07] [INFO ] Time to serialize properties into /tmp/LTL6456996575153549754.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18209627268274257360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6456996575153549754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1820962...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X(((F(G("(Node4HasTheLeafSetOfRx5ToReplaceNode16<1)")))||(G((G("((Node9ManageTheCrashOfNode6>=1)&&(Lx3IsAtTheLeftExtremityOfThe...315
Formula 0 simplified : !GFX("((Node0HasAskedItsLeafSetToLx1ToReplaceNode1>=1)&&(LeafSetOfLx1IsSentToNode0>=1))" | FG"(Node4HasTheLeafSetOfRx5ToReplaceNode1...294
Detected timeout of ITS tools.
[2022-05-18 04:41:22] [INFO ] Flatten gal took : 264 ms
[2022-05-18 04:41:22] [INFO ] Applying decomposition
[2022-05-18 04:41:22] [INFO ] Flatten gal took : 271 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1474361380085644561.txt' '-o' '/tmp/graph1474361380085644561.bin' '-w' '/tmp/graph1474361380085644561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1474361380085644561.bin' '-l' '-1' '-v' '-w' '/tmp/graph1474361380085644561.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:41:24] [INFO ] Decomposing Gal with order
[2022-05-18 04:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:41:26] [INFO ] Removed a total of 6833 redundant transitions.
[2022-05-18 04:41:26] [INFO ] Flatten gal took : 1786 ms
[2022-05-18 04:41:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4664 labels/synchronizations in 466 ms.
[2022-05-18 04:41:27] [INFO ] Time to serialize gal into /tmp/LTL4370495947965929239.gal : 52 ms
[2022-05-18 04:41:27] [INFO ] Time to serialize properties into /tmp/LTL15208231696565896635.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4370495947965929239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15208231696565896635.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4370495...246
Read 1 LTL properties
Checking formula 0 : !((G(F(X(((F(G("(i25.u437.Node4HasTheLeafSetOfRx5ToReplaceNode16<1)")))||(G((G("((i25.u405.Node9ManageTheCrashOfNode6>=1)&&(i25.u405.L...365
Formula 0 simplified : !GFX("((i6.u4.Node0HasAskedItsLeafSetToLx1ToReplaceNode1>=1)&&(i6.u386.LeafSetOfLx1IsSentToNode0>=1))" | FG"(i25.u437.Node4HasTheLea...344
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9628873819683257758
[2022-05-18 04:41:42] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9628873819683257758
Running compilation step : cd /tmp/ltsmin9628873819683257758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9628873819683257758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9628873819683257758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01 finished in 139406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&G(X(G(F(X(p1)))))))))'
Support contains 5 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5005 transition count 8354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5005 transition count 8354
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 4994 transition count 8323
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 4994 transition count 8323
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 4987 transition count 8281
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 4987 transition count 8281
Applied a total of 68 rules in 1450 ms. Remains 4987 /5021 variables (removed 34) and now considering 8281/8395 (removed 114) transitions.
[2022-05-18 04:41:48] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:41:48] [INFO ] Computed 989 place invariants in 164 ms
[2022-05-18 04:41:51] [INFO ] Implicit Places using invariants in 3716 ms returned []
[2022-05-18 04:41:51] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:41:52] [INFO ] Computed 989 place invariants in 169 ms
[2022-05-18 04:41:55] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned []
Implicit Place search using SMT with State Equation took 7649 ms to find 0 implicit places.
[2022-05-18 04:41:55] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:41:56] [INFO ] Computed 989 place invariants in 179 ms
[2022-05-18 04:42:00] [INFO ] Dead Transitions using invariants and state equation in 4627 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4987/5021 places, 8281/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4987/5021 places, 8281/8395 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1760 1) (LT s4812 1)), p1:(OR (LT s2930 1) (LT s2933 1) (LT s3472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1621 reset in 991 ms.
Product exploration explored 100000 steps with 1619 reset in 996 ms.
Computed a total of 2363 stabilizing places and 3080 stable transitions
Computed a total of 2363 stabilizing places and 3080 stable transitions
Detected a total of 2363/4987 stabilizing places and 3080/8281 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21762 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21762 steps, saw 10340 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:42:06] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:42:06] [INFO ] Computed 989 place invariants in 166 ms
[2022-05-18 04:42:07] [INFO ] [Real]Absence check using 47 positive place invariants in 37 ms returned sat
[2022-05-18 04:42:07] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 323 ms returned sat
[2022-05-18 04:42:11] [INFO ] After 3734ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-18 04:42:11] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:42:11] [INFO ] After 435ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:42:11] [INFO ] After 5228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:42:12] [INFO ] [Nat]Absence check using 47 positive place invariants in 38 ms returned sat
[2022-05-18 04:42:12] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 329 ms returned sat
[2022-05-18 04:42:18] [INFO ] After 5828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:42:25] [INFO ] After 6078ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:42:31] [INFO ] Deduced a trap composed of 810 places in 4922 ms of which 5 ms to minimize.
[2022-05-18 04:42:36] [INFO ] Deduced a trap composed of 760 places in 5148 ms of which 5 ms to minimize.
[2022-05-18 04:42:42] [INFO ] Deduced a trap composed of 2 places in 5605 ms of which 4 ms to minimize.
[2022-05-18 04:42:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 04:42:42] [INFO ] After 30644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 4987 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4987/4987 places, 8281/8281 transitions.
Performed 324 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 324 Pre rules applied. Total rules applied 0 place count 4987 transition count 7957
Deduced a syphon composed of 324 places in 5 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 0 with 648 rules applied. Total rules applied 648 place count 4663 transition count 7957
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 696 place count 4639 transition count 7933
Free-agglomeration rule (complex) applied 324 times.
Iterating global reduction 0 with 324 rules applied. Total rules applied 1020 place count 4639 transition count 10354
Reduce places removed 324 places and 0 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 1344 place count 4315 transition count 10354
Applied a total of 1344 rules in 1576 ms. Remains 4315 /4987 variables (removed 672) and now considering 10354/8281 (removed -2073) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4987 places, 10354/8281 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21385 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21385 steps, saw 9818 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:42:47] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:42:48] [INFO ] Computed 989 place invariants in 217 ms
[2022-05-18 04:42:48] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 04:42:48] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 249 ms returned sat
[2022-05-18 04:42:53] [INFO ] After 5603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:42:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 04:42:54] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 258 ms returned sat
[2022-05-18 04:43:01] [INFO ] After 7208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:43:02] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:43:18] [INFO ] After 16729ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 04:43:18] [INFO ] After 16730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 04:43:18] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 4315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 544 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 545 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
[2022-05-18 04:43:19] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:43:20] [INFO ] Computed 989 place invariants in 217 ms
[2022-05-18 04:43:23] [INFO ] Implicit Places using invariants in 3910 ms returned []
Implicit Place search using SMT only with invariants took 3912 ms to find 0 implicit places.
[2022-05-18 04:43:23] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:43:23] [INFO ] Computed 989 place invariants in 218 ms
[2022-05-18 04:43:31] [INFO ] Dead Transitions using invariants and state equation in 7602 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Graph (trivial) has 3288 edges and 4315 vertex of which 24 / 4315 are part of one of the 1 SCC in 4 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 32046 edges and 4292 vertex of which 4270 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 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3644.t3984 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 3886 transition count 8679
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 3664 transition count 8260
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3454 transition count 7898
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3258 transition count 7594
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3105 transition count 7340
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 2967 transition count 7136
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 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 6 with 265 rules applied. Total rules applied 2952 place count 2864 transition count 6974
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 2776 transition count 6854
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 2715 transition count 6768
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 2669 transition count 6715
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 2642 transition count 6689
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 2629 transition count 6677
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 2617 transition count 6677
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 300 Pre rules applied. Total rules applied 3496 place count 2617 transition count 6377
Deduced a syphon composed of 300 places in 2 ms
Ensure Unique test removed 300 places
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 13 with 900 rules applied. Total rules applied 4396 place count 2017 transition count 6377
Discarding 311 places :
Symmetric choice reduction at 13 with 311 rule applications. Total rules 4707 place count 1706 transition count 6066
Iterating global reduction 13 with 311 rules applied. Total rules applied 5018 place count 1706 transition count 6066
Discarding 399 places :
Symmetric choice reduction at 13 with 399 rule applications. Total rules 5417 place count 1307 transition count 3672
Iterating global reduction 13 with 399 rules applied. Total rules applied 5816 place count 1307 transition count 3672
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 13 with 387 rules applied. Total rules applied 6203 place count 1307 transition count 3285
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 837
Deduced a syphon composed of 837 places in 0 ms
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 14 with 1674 rules applied. Total rules applied 7877 place count 470 transition count 2448
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 8712 place count 470 transition count 1613
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 15 with 165 rules applied. Total rules applied 8877 place count 470 transition count 1448
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9030 place count 317 transition count 1448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9030 place count 317 transition count 1447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9032 place count 316 transition count 1447
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9184 place count 164 transition count 535
Iterating global reduction 16 with 152 rules applied. Total rules applied 9336 place count 164 transition count 535
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 16 with 140 rules applied. Total rules applied 9476 place count 164 transition count 395
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 9488 place count 164 transition count 383
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 9494 place count 164 transition count 377
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 9500 place count 158 transition count 377
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 9511 place count 147 transition count 311
Ensure Unique test removed 1 places
Iterating global reduction 18 with 12 rules applied. Total rules applied 9523 place count 146 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 9524 place count 146 transition count 310
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 9534 place count 146 transition count 300
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 19 with 144 rules applied. Total rules applied 9678 place count 146 transition count 300
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 9689 place count 135 transition count 234
Iterating global reduction 19 with 11 rules applied. Total rules applied 9700 place count 135 transition count 234
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 9711 place count 135 transition count 223
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 9713 place count 135 transition count 223
Applied a total of 9713 rules in 8610 ms. Remains 135 /4315 variables (removed 4180) and now considering 223/10354 (removed 10131) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 223 rows 135 cols
[2022-05-18 04:43:40] [INFO ] Computed 39 place invariants in 7 ms
[2022-05-18 04:43:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-18 04:43:40] [INFO ] [Real]Absence check using 4 positive and 35 generalized place invariants in 4 ms returned sat
[2022-05-18 04:43:40] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:43:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 04:43:40] [INFO ] [Nat]Absence check using 4 positive and 35 generalized place invariants in 5 ms returned sat
[2022-05-18 04:43:40] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:43:40] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-18 04:43:40] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:43:40] [INFO ] Flatten gal took : 11 ms
[2022-05-18 04:43:40] [INFO ] Flatten gal took : 10 ms
[2022-05-18 04:43:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3098895837528126518.gal : 1 ms
[2022-05-18 04:43:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2971969025426683308.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17011639933357275208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3098895837528126518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2971969025426683308.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2971969025426683308.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :23 after 43
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :43 after 154
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :154 after 200
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :200 after 436
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :436 after 2919
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2919 after 10345
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10345 after 27766
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27766 after 49558
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :49558 after 120808
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :120808 after 145860
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :145860 after 384705
Detected timeout of ITS tools.
[2022-05-18 04:43:55] [INFO ] Flatten gal took : 11 ms
[2022-05-18 04:43:55] [INFO ] Applying decomposition
[2022-05-18 04:43:55] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2865032039001779987.txt' '-o' '/tmp/graph2865032039001779987.bin' '-w' '/tmp/graph2865032039001779987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2865032039001779987.bin' '-l' '-1' '-v' '-w' '/tmp/graph2865032039001779987.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:43:55] [INFO ] Decomposing Gal with order
[2022-05-18 04:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:43:55] [INFO ] Removed a total of 507 redundant transitions.
[2022-05-18 04:43:55] [INFO ] Flatten gal took : 24 ms
[2022-05-18 04:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-18 04:43:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality123893336500915491.gal : 2 ms
[2022-05-18 04:43:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13527628433423156463.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17011639933357275208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality123893336500915491.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13527628433423156463.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality13527628433423156463.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 230
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :230 after 318
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :318 after 366
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :366 after 1460
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1460 after 318295
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15391992575413512045
[2022-05-18 04:44:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15391992575413512045
Running compilation step : cd /tmp/ltsmin15391992575413512045;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin15391992575413512045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15391992575413512045;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 396 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin15391992575413512045;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 2456 ms.
Found Violation
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 4987 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4987/4987 places, 8281/8281 transitions.
Applied a total of 0 rules in 357 ms. Remains 4987 /4987 variables (removed 0) and now considering 8281/8281 (removed 0) transitions.
[2022-05-18 04:44:14] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:44:15] [INFO ] Computed 989 place invariants in 341 ms
[2022-05-18 04:44:18] [INFO ] Implicit Places using invariants in 3876 ms returned []
[2022-05-18 04:44:18] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:44:18] [INFO ] Computed 989 place invariants in 189 ms
[2022-05-18 04:44:22] [INFO ] Implicit Places using invariants and state equation in 3523 ms returned []
Implicit Place search using SMT with State Equation took 7407 ms to find 0 implicit places.
[2022-05-18 04:44:22] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:44:22] [INFO ] Computed 989 place invariants in 197 ms
[2022-05-18 04:44:26] [INFO ] Dead Transitions using invariants and state equation in 4724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4987/4987 places, 8281/8281 transitions.
Computed a total of 2363 stabilizing places and 3080 stable transitions
Computed a total of 2363 stabilizing places and 3080 stable transitions
Detected a total of 2363/4987 stabilizing places and 3080/8281 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21463 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21463 steps, saw 10204 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:44:30] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:44:30] [INFO ] Computed 989 place invariants in 206 ms
[2022-05-18 04:44:31] [INFO ] [Real]Absence check using 47 positive place invariants in 39 ms returned sat
[2022-05-18 04:44:31] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 328 ms returned sat
[2022-05-18 04:44:35] [INFO ] After 3713ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-18 04:44:35] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:44:36] [INFO ] After 465ms SMT Verify possible using 2857 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:44:36] [INFO ] After 5248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:44:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 39 ms returned sat
[2022-05-18 04:44:37] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 333 ms returned sat
[2022-05-18 04:44:42] [INFO ] After 4763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:44:48] [INFO ] After 6320ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:44:54] [INFO ] Deduced a trap composed of 810 places in 5132 ms of which 5 ms to minimize.
[2022-05-18 04:45:00] [INFO ] Deduced a trap composed of 760 places in 5035 ms of which 5 ms to minimize.
[2022-05-18 04:45:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10926 ms
[2022-05-18 04:45:01] [INFO ] After 19072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 04:45:01] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 4987 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4987/4987 places, 8281/8281 transitions.
Performed 324 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 324 Pre rules applied. Total rules applied 0 place count 4987 transition count 7957
Deduced a syphon composed of 324 places in 5 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 0 with 648 rules applied. Total rules applied 648 place count 4663 transition count 7957
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 696 place count 4639 transition count 7933
Free-agglomeration rule (complex) applied 324 times.
Iterating global reduction 0 with 324 rules applied. Total rules applied 1020 place count 4639 transition count 10354
Reduce places removed 324 places and 0 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 1344 place count 4315 transition count 10354
Applied a total of 1344 rules in 1623 ms. Remains 4315 /4987 variables (removed 672) and now considering 10354/8281 (removed -2073) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4987 places, 10354/8281 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21506 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21506 steps, saw 9869 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:45:06] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:45:06] [INFO ] Computed 989 place invariants in 250 ms
[2022-05-18 04:45:07] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-18 04:45:07] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 242 ms returned sat
[2022-05-18 04:45:12] [INFO ] After 5305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:45:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 04:45:13] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 259 ms returned sat
[2022-05-18 04:45:20] [INFO ] After 7046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:45:20] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:45:37] [INFO ] After 16904ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 04:45:37] [INFO ] After 16905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-18 04:45:37] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 4315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 518 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 546 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
[2022-05-18 04:45:38] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:45:38] [INFO ] Computed 989 place invariants in 269 ms
[2022-05-18 04:45:42] [INFO ] Implicit Places using invariants in 4110 ms returned []
Implicit Place search using SMT only with invariants took 4111 ms to find 0 implicit places.
[2022-05-18 04:45:42] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:45:42] [INFO ] Computed 989 place invariants in 243 ms
[2022-05-18 04:45:49] [INFO ] Dead Transitions using invariants and state equation in 7383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Graph (trivial) has 3288 edges and 4315 vertex of which 24 / 4315 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 32046 edges and 4292 vertex of which 4270 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 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3644.t3984 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 3886 transition count 8679
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 3664 transition count 8260
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3454 transition count 7898
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3258 transition count 7594
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3105 transition count 7340
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 2967 transition count 7136
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 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 6 with 265 rules applied. Total rules applied 2952 place count 2864 transition count 6974
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 2776 transition count 6854
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 2715 transition count 6768
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 2669 transition count 6715
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 2642 transition count 6689
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 2629 transition count 6677
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 2617 transition count 6677
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 300 Pre rules applied. Total rules applied 3496 place count 2617 transition count 6377
Deduced a syphon composed of 300 places in 2 ms
Ensure Unique test removed 300 places
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 13 with 900 rules applied. Total rules applied 4396 place count 2017 transition count 6377
Discarding 311 places :
Symmetric choice reduction at 13 with 311 rule applications. Total rules 4707 place count 1706 transition count 6066
Iterating global reduction 13 with 311 rules applied. Total rules applied 5018 place count 1706 transition count 6066
Discarding 399 places :
Symmetric choice reduction at 13 with 399 rule applications. Total rules 5417 place count 1307 transition count 3672
Iterating global reduction 13 with 399 rules applied. Total rules applied 5816 place count 1307 transition count 3672
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 13 with 387 rules applied. Total rules applied 6203 place count 1307 transition count 3285
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 837
Deduced a syphon composed of 837 places in 1 ms
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 14 with 1674 rules applied. Total rules applied 7877 place count 470 transition count 2448
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 8712 place count 470 transition count 1613
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 15 with 165 rules applied. Total rules applied 8877 place count 470 transition count 1448
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9030 place count 317 transition count 1448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9030 place count 317 transition count 1447
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9032 place count 316 transition count 1447
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9184 place count 164 transition count 535
Iterating global reduction 16 with 152 rules applied. Total rules applied 9336 place count 164 transition count 535
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 16 with 140 rules applied. Total rules applied 9476 place count 164 transition count 395
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 9488 place count 164 transition count 383
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 9494 place count 164 transition count 377
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 9500 place count 158 transition count 377
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 9511 place count 147 transition count 311
Ensure Unique test removed 1 places
Iterating global reduction 18 with 12 rules applied. Total rules applied 9523 place count 146 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 9524 place count 146 transition count 310
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 9534 place count 146 transition count 300
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 19 with 144 rules applied. Total rules applied 9678 place count 146 transition count 300
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 9689 place count 135 transition count 234
Iterating global reduction 19 with 11 rules applied. Total rules applied 9700 place count 135 transition count 234
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 9711 place count 135 transition count 223
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 9713 place count 135 transition count 223
Applied a total of 9713 rules in 8581 ms. Remains 135 /4315 variables (removed 4180) and now considering 223/10354 (removed 10131) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 223 rows 135 cols
[2022-05-18 04:45:58] [INFO ] Computed 39 place invariants in 6 ms
[2022-05-18 04:45:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 04:45:58] [INFO ] [Real]Absence check using 4 positive and 35 generalized place invariants in 19 ms returned sat
[2022-05-18 04:45:58] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:45:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 04:45:58] [INFO ] [Nat]Absence check using 4 positive and 35 generalized place invariants in 5 ms returned sat
[2022-05-18 04:45:58] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:45:58] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-18 04:45:58] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:45:58] [INFO ] Flatten gal took : 10 ms
[2022-05-18 04:45:58] [INFO ] Flatten gal took : 11 ms
[2022-05-18 04:45:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4132247260386600445.gal : 2 ms
[2022-05-18 04:45:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1091267399272779190.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9924285860284347094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4132247260386600445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1091267399272779190.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1091267399272779190.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :23 after 43
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :43 after 154
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :154 after 200
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :200 after 436
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :436 after 2919
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2919 after 10345
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10345 after 27766
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27766 after 49558
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :49558 after 120808
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :120808 after 145860
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :145860 after 384705
Detected timeout of ITS tools.
[2022-05-18 04:46:13] [INFO ] Flatten gal took : 16 ms
[2022-05-18 04:46:13] [INFO ] Applying decomposition
[2022-05-18 04:46:13] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9372497293482907065.txt' '-o' '/tmp/graph9372497293482907065.bin' '-w' '/tmp/graph9372497293482907065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9372497293482907065.bin' '-l' '-1' '-v' '-w' '/tmp/graph9372497293482907065.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:46:13] [INFO ] Decomposing Gal with order
[2022-05-18 04:46:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:46:13] [INFO ] Removed a total of 505 redundant transitions.
[2022-05-18 04:46:13] [INFO ] Flatten gal took : 26 ms
[2022-05-18 04:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-18 04:46:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5669211032385435042.gal : 2 ms
[2022-05-18 04:46:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1270218596489799550.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9924285860284347094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5669211032385435042.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1270218596489799550.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality1270218596489799550.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 224
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :224 after 1103
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1103 after 3975
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3975 after 11237
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11237 after 26895
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :26895 after 49031
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :49031 after 310534
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8225576362062604612
[2022-05-18 04:46:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8225576362062604612
Running compilation step : cd /tmp/ltsmin8225576362062604612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 398 ms.
Running link step : cd /tmp/ltsmin8225576362062604612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8225576362062604612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 486 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin8225576362062604612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 579 ms.
Found Violation
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 2312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 1617 reset in 934 ms.
Product exploration explored 100000 steps with 1616 reset in 947 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 4987 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4987/4987 places, 8281/8281 transitions.
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 312 Pre rules applied. Total rules applied 0 place count 4987 transition count 8281
Deduced a syphon composed of 312 places in 5 ms
Iterating global reduction 0 with 312 rules applied. Total rules applied 312 place count 4987 transition count 8281
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 336 places in 6 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 336 place count 4987 transition count 8281
Deduced a syphon composed of 336 places in 5 ms
Applied a total of 336 rules in 1792 ms. Remains 4987 /4987 variables (removed 0) and now considering 8281/8281 (removed 0) transitions.
[2022-05-18 04:46:38] [INFO ] Redundant transitions in 886 ms returned []
[2022-05-18 04:46:38] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:46:38] [INFO ] Computed 989 place invariants in 214 ms
[2022-05-18 04:46:43] [INFO ] Dead Transitions using invariants and state equation in 5002 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4987/4987 places, 8281/8281 transitions.
Finished structural reductions, in 1 iterations. Remains : 4987/4987 places, 8281/8281 transitions.
Product exploration explored 100000 steps with 2018 reset in 2220 ms.
Product exploration explored 100000 steps with 2018 reset in 2208 ms.
Built C files in :
/tmp/ltsmin735144541790692428
[2022-05-18 04:46:47] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin735144541790692428
Running compilation step : cd /tmp/ltsmin735144541790692428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin735144541790692428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin735144541790692428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 4987 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4987/4987 places, 8281/8281 transitions.
Applied a total of 0 rules in 441 ms. Remains 4987 /4987 variables (removed 0) and now considering 8281/8281 (removed 0) transitions.
[2022-05-18 04:46:51] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:46:51] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:46:54] [INFO ] Implicit Places using invariants in 3585 ms returned []
[2022-05-18 04:46:54] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:46:54] [INFO ] Computed 989 place invariants in 194 ms
[2022-05-18 04:46:58] [INFO ] Implicit Places using invariants and state equation in 3844 ms returned []
Implicit Place search using SMT with State Equation took 7438 ms to find 0 implicit places.
[2022-05-18 04:46:58] [INFO ] Flow matrix only has 7681 transitions (discarded 600 similar events)
// Phase 1: matrix 7681 rows 4987 cols
[2022-05-18 04:46:58] [INFO ] Computed 989 place invariants in 191 ms
[2022-05-18 04:47:03] [INFO ] Dead Transitions using invariants and state equation in 4997 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4987/4987 places, 8281/8281 transitions.
Built C files in :
/tmp/ltsmin4691296744059262751
[2022-05-18 04:47:03] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4691296744059262751
Running compilation step : cd /tmp/ltsmin4691296744059262751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4691296744059262751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4691296744059262751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 04:47:07] [INFO ] Flatten gal took : 248 ms
[2022-05-18 04:47:07] [INFO ] Flatten gal took : 260 ms
[2022-05-18 04:47:07] [INFO ] Time to serialize gal into /tmp/LTL4666956618251497735.gal : 26 ms
[2022-05-18 04:47:07] [INFO ] Time to serialize properties into /tmp/LTL4131558837796172523.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4666956618251497735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4131558837796172523.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4666956...266
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node7ManageTheCrashOfNode5<1)||(Lx5IsAtTheLeftExtremityOfTheLeafSet<1))"))&&(G(X(G(F(X("(((Node18IsActive<1)||(Node18IsTh...216
Formula 0 simplified : !XG(X"((Node7ManageTheCrashOfNode5<1)||(Lx5IsAtTheLeftExtremityOfTheLeafSet<1))" & GXGFX"(((Node18IsActive<1)||(Node18IsTheNodeMaste...197
Detected timeout of ITS tools.
[2022-05-18 04:47:22] [INFO ] Flatten gal took : 258 ms
[2022-05-18 04:47:22] [INFO ] Applying decomposition
[2022-05-18 04:47:22] [INFO ] Flatten gal took : 305 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6210890497094353631.txt' '-o' '/tmp/graph6210890497094353631.bin' '-w' '/tmp/graph6210890497094353631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6210890497094353631.bin' '-l' '-1' '-v' '-w' '/tmp/graph6210890497094353631.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:47:23] [INFO ] Decomposing Gal with order
[2022-05-18 04:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:47:24] [INFO ] Removed a total of 6107 redundant transitions.
[2022-05-18 04:47:24] [INFO ] Flatten gal took : 928 ms
[2022-05-18 04:47:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4132 labels/synchronizations in 416 ms.
[2022-05-18 04:47:25] [INFO ] Time to serialize gal into /tmp/LTL4044248340507635071.gal : 100 ms
[2022-05-18 04:47:25] [INFO ] Time to serialize properties into /tmp/LTL6037521416164566869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4044248340507635071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6037521416164566869.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4044248...245
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i1.u208.Node7ManageTheCrashOfNode5<1)||(i6.u8.Lx5IsAtTheLeftExtremityOfTheLeafSet<1))"))&&(G(X(G(F(X("(((i0.u0.Node18IsAc...248
Formula 0 simplified : !XG(X"((i1.u208.Node7ManageTheCrashOfNode5<1)||(i6.u8.Lx5IsAtTheLeftExtremityOfTheLeafSet<1))" & GXGFX"(((i0.u0.Node18IsActive<1)||(...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15779322535367757899
[2022-05-18 04:47:40] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15779322535367757899
Running compilation step : cd /tmp/ltsmin15779322535367757899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15779322535367757899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15779322535367757899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 finished in 358048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(false U (!p0 U X((X(p1)||!p0))))))'
Support contains 4 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5006 transition count 8360
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5006 transition count 8360
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 4995 transition count 8329
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 4995 transition count 8329
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 4988 transition count 8287
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 4988 transition count 8287
Applied a total of 66 rules in 1776 ms. Remains 4988 /5021 variables (removed 33) and now considering 8287/8395 (removed 108) transitions.
[2022-05-18 04:47:45] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:47:45] [INFO ] Computed 989 place invariants in 189 ms
[2022-05-18 04:47:49] [INFO ] Implicit Places using invariants in 3853 ms returned []
[2022-05-18 04:47:49] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:47:49] [INFO ] Computed 989 place invariants in 185 ms
[2022-05-18 04:47:53] [INFO ] Implicit Places using invariants and state equation in 3841 ms returned []
Implicit Place search using SMT with State Equation took 7697 ms to find 0 implicit places.
[2022-05-18 04:47:53] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:47:53] [INFO ] Computed 989 place invariants in 194 ms
[2022-05-18 04:47:58] [INFO ] Dead Transitions using invariants and state equation in 5131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4988/5021 places, 8287/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4988/5021 places, 8287/8395 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2955 1) (GEQ s4732 1)), p1:(AND (GEQ s4078 1) (GEQ s4759 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 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 14793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(p0)))||F(p1))))'
Support contains 3 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5005 transition count 8349
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5005 transition count 8349
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 4995 transition count 8319
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 4995 transition count 8319
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 4989 transition count 8283
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 4989 transition count 8283
Applied a total of 64 rules in 1435 ms. Remains 4989 /5021 variables (removed 32) and now considering 8283/8395 (removed 112) transitions.
[2022-05-18 04:47:59] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:48:00] [INFO ] Computed 989 place invariants in 189 ms
[2022-05-18 04:48:03] [INFO ] Implicit Places using invariants in 3901 ms returned []
[2022-05-18 04:48:03] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:48:04] [INFO ] Computed 989 place invariants in 190 ms
[2022-05-18 04:48:07] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 7701 ms to find 0 implicit places.
[2022-05-18 04:48:07] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:48:07] [INFO ] Computed 989 place invariants in 272 ms
[2022-05-18 04:48:12] [INFO ] Dead Transitions using invariants and state equation in 4949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4989/5021 places, 8283/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4989/5021 places, 8283/8395 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s302 1) (GEQ s3265 1)), p0:(GEQ s634 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-05 finished in 14273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(((F(p1)&&p0) U p2))&&F(p2)) U p1)))'
Support contains 2 out of 5021 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 : 5021/5021 places, 8395/8395 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 5021 transition count 8388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5014 transition count 8388
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 14 place count 5014 transition count 8077
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 636 place count 4703 transition count 8077
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 647 place count 4692 transition count 8036
Iterating global reduction 2 with 11 rules applied. Total rules applied 658 place count 4692 transition count 8036
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 658 place count 4692 transition count 8033
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 664 place count 4689 transition count 8033
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 669 place count 4684 transition count 8003
Iterating global reduction 2 with 5 rules applied. Total rules applied 674 place count 4684 transition count 8003
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 734 place count 4654 transition count 7973
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 740 place count 4648 transition count 7967
Iterating global reduction 2 with 6 rules applied. Total rules applied 746 place count 4648 transition count 7967
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 746 place count 4648 transition count 7962
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 756 place count 4643 transition count 7962
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 762 place count 4637 transition count 7926
Iterating global reduction 2 with 6 rules applied. Total rules applied 768 place count 4637 transition count 7926
Applied a total of 768 rules in 2532 ms. Remains 4637 /5021 variables (removed 384) and now considering 7926/8395 (removed 469) transitions.
[2022-05-18 04:48:15] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:48:15] [INFO ] Computed 989 place invariants in 212 ms
[2022-05-18 04:48:20] [INFO ] Implicit Places using invariants in 4815 ms returned []
[2022-05-18 04:48:20] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:48:20] [INFO ] Computed 989 place invariants in 197 ms
[2022-05-18 04:48:24] [INFO ] Implicit Places using invariants and state equation in 4826 ms returned []
Implicit Place search using SMT with State Equation took 9647 ms to find 0 implicit places.
[2022-05-18 04:48:25] [INFO ] Redundant transitions in 800 ms returned []
[2022-05-18 04:48:25] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:48:26] [INFO ] Computed 989 place invariants in 204 ms
[2022-05-18 04:48:30] [INFO ] Dead Transitions using invariants and state equation in 4900 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4637/5021 places, 7926/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4637/5021 places, 7926/8395 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s173 1) (GEQ s1135 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 44 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-06 finished in 17973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5006 transition count 8350
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5006 transition count 8350
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 4997 transition count 8326
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 4997 transition count 8326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 4991 transition count 8290
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 4991 transition count 8290
Applied a total of 60 rules in 1374 ms. Remains 4991 /5021 variables (removed 30) and now considering 8290/8395 (removed 105) transitions.
[2022-05-18 04:48:32] [INFO ] Flow matrix only has 7690 transitions (discarded 600 similar events)
// Phase 1: matrix 7690 rows 4991 cols
[2022-05-18 04:48:32] [INFO ] Computed 989 place invariants in 211 ms
[2022-05-18 04:48:37] [INFO ] Implicit Places using invariants in 4946 ms returned []
[2022-05-18 04:48:37] [INFO ] Flow matrix only has 7690 transitions (discarded 600 similar events)
// Phase 1: matrix 7690 rows 4991 cols
[2022-05-18 04:48:37] [INFO ] Computed 989 place invariants in 190 ms
[2022-05-18 04:48:42] [INFO ] Implicit Places using invariants and state equation in 5154 ms returned []
Implicit Place search using SMT with State Equation took 10102 ms to find 0 implicit places.
[2022-05-18 04:48:42] [INFO ] Flow matrix only has 7690 transitions (discarded 600 similar events)
// Phase 1: matrix 7690 rows 4991 cols
[2022-05-18 04:48:42] [INFO ] Computed 989 place invariants in 192 ms
[2022-05-18 04:48:47] [INFO ] Dead Transitions using invariants and state equation in 5213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4991/5021 places, 8290/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4991/5021 places, 8290/8395 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3679 1) (OR (LT s4048 1) (LT s4273 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 64 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07 finished in 16847 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G(p1)))'
Support contains 4 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 5021 transition count 8388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5014 transition count 8388
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 14 place count 5014 transition count 8078
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 634 place count 4704 transition count 8078
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 644 place count 4694 transition count 8038
Iterating global reduction 2 with 10 rules applied. Total rules applied 654 place count 4694 transition count 8038
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 654 place count 4694 transition count 8036
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 658 place count 4692 transition count 8036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 662 place count 4688 transition count 8012
Iterating global reduction 2 with 4 rules applied. Total rules applied 666 place count 4688 transition count 8012
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 726 place count 4658 transition count 7982
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 732 place count 4652 transition count 7976
Iterating global reduction 2 with 6 rules applied. Total rules applied 738 place count 4652 transition count 7976
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 738 place count 4652 transition count 7971
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 748 place count 4647 transition count 7971
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 754 place count 4641 transition count 7935
Iterating global reduction 2 with 6 rules applied. Total rules applied 760 place count 4641 transition count 7935
Applied a total of 760 rules in 2355 ms. Remains 4641 /5021 variables (removed 380) and now considering 7935/8395 (removed 460) transitions.
[2022-05-18 04:48:49] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:48:50] [INFO ] Computed 989 place invariants in 204 ms
[2022-05-18 04:48:54] [INFO ] Implicit Places using invariants in 4125 ms returned []
[2022-05-18 04:48:54] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:48:54] [INFO ] Computed 989 place invariants in 198 ms
[2022-05-18 04:48:57] [INFO ] Implicit Places using invariants and state equation in 3655 ms returned []
Implicit Place search using SMT with State Equation took 7782 ms to find 0 implicit places.
[2022-05-18 04:48:58] [INFO ] Redundant transitions in 817 ms returned []
[2022-05-18 04:48:58] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:48:58] [INFO ] Computed 989 place invariants in 196 ms
[2022-05-18 04:49:03] [INFO ] Dead Transitions using invariants and state equation in 4542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5021 places, 7935/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4641/5021 places, 7935/8395 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1330 1) (GEQ s3373 1)), p0:(OR (AND (GEQ s1330 1) (GEQ s3373 1)) (AND (GEQ s2342 1) (GEQ s2357 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33355 reset in 3181 ms.
Product exploration explored 100000 steps with 33398 reset in 3182 ms.
Computed a total of 2042 stabilizing places and 2759 stable transitions
Computed a total of 2042 stabilizing places and 2759 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 454 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (AND p0 p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:49:10] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:49:10] [INFO ] Computed 989 place invariants in 218 ms
[2022-05-18 04:49:11] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 04:49:11] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 255 ms returned sat
[2022-05-18 04:49:16] [INFO ] After 5312ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-18 04:49:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 04:49:17] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 256 ms returned sat
[2022-05-18 04:49:21] [INFO ] After 4571ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-18 04:49:21] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:49:22] [INFO ] After 1139ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :3 sat :0
[2022-05-18 04:49:22] [INFO ] After 6706ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT p1)), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 15 factoid took 257 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-09 finished in 35571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||(F(!p2)&&p1))) U (p3 U p2))))'
Support contains 5 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5005 transition count 8349
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5005 transition count 8349
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 4995 transition count 8319
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 4995 transition count 8319
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 4989 transition count 8283
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 4989 transition count 8283
Applied a total of 64 rules in 1331 ms. Remains 4989 /5021 variables (removed 32) and now considering 8283/8395 (removed 112) transitions.
[2022-05-18 04:49:24] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:49:24] [INFO ] Computed 989 place invariants in 203 ms
[2022-05-18 04:49:28] [INFO ] Implicit Places using invariants in 4032 ms returned []
[2022-05-18 04:49:28] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:49:28] [INFO ] Computed 989 place invariants in 182 ms
[2022-05-18 04:49:32] [INFO ] Implicit Places using invariants and state equation in 4037 ms returned []
Implicit Place search using SMT with State Equation took 8071 ms to find 0 implicit places.
[2022-05-18 04:49:32] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:49:32] [INFO ] Computed 989 place invariants in 193 ms
[2022-05-18 04:49:37] [INFO ] Dead Transitions using invariants and state equation in 5055 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4989/5021 places, 8283/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4989/5021 places, 8283/8395 transitions.
Stuttering acceptance computed with spot in 562 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p2 (NOT p0)), true, (AND (NOT p0) (NOT p2)), p2, (NOT p2)]
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 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s1580 1) (GEQ s3470 1)), p3:(AND (GEQ s733 1) (GEQ s3088 1)), p1:(AND (GEQ s1580 1) (GEQ s3470 1)), p0:(LT s2353 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20391 reset in 2702 ms.
Product exploration explored 100000 steps with 20477 reset in 2715 ms.
Computed a total of 2365 stabilizing places and 3082 stable transitions
Computed a total of 2365 stabilizing places and 3082 stable transitions
Detected a total of 2365/4989 stabilizing places and 3082/8283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) p0), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 12 factoid took 740 ms. Reduced automaton from 10 states, 16 edges and 4 AP to 10 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p2 (NOT p0)), true, (AND (NOT p0) (NOT p2)), p2, (NOT p2)]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) 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 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-18 04:49:45] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:49:45] [INFO ] Computed 989 place invariants in 203 ms
[2022-05-18 04:49:46] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 04:49:46] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 283 ms returned sat
[2022-05-18 04:49:46] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-18 04:49:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2022-05-18 04:49:47] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 279 ms returned sat
[2022-05-18 04:49:53] [INFO ] After 5855ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-18 04:49:53] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:49:55] [INFO ] After 1749ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :4 sat :0
[2022-05-18 04:49:55] [INFO ] After 8715ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) p0), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p3 (NOT p1)))), (G (NOT (AND (NOT p2) p3))), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0) p3)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (F (AND p2 p1)), (F p1), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0) (NOT p3)))]
Knowledge based reduction with 16 factoid took 1038 ms. Reduced automaton from 10 states, 16 edges and 4 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
[2022-05-18 04:49:56] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:49:56] [INFO ] Computed 989 place invariants in 188 ms
Could not prove EG (NOT p2)
Support contains 3 out of 4989 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4989/4989 places, 8283/8283 transitions.
Applied a total of 0 rules in 332 ms. Remains 4989 /4989 variables (removed 0) and now considering 8283/8283 (removed 0) transitions.
[2022-05-18 04:50:12] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:50:12] [INFO ] Computed 989 place invariants in 187 ms
[2022-05-18 04:50:16] [INFO ] Implicit Places using invariants in 4015 ms returned []
[2022-05-18 04:50:16] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:50:16] [INFO ] Computed 989 place invariants in 188 ms
[2022-05-18 04:50:20] [INFO ] Implicit Places using invariants and state equation in 4020 ms returned []
Implicit Place search using SMT with State Equation took 8036 ms to find 0 implicit places.
[2022-05-18 04:50:20] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:50:20] [INFO ] Computed 989 place invariants in 184 ms
[2022-05-18 04:50:25] [INFO ] Dead Transitions using invariants and state equation in 4974 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4989/4989 places, 8283/8283 transitions.
Computed a total of 2365 stabilizing places and 3082 stable transitions
Computed a total of 2365 stabilizing places and 3082 stable transitions
Detected a total of 2365/4989 stabilizing places and 3082/8283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 6 factoid took 615 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Finished random walk after 5347 steps, including 86 resets, run visited all 3 properties in 54 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 4083 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
[2022-05-18 04:50:30] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:50:30] [INFO ] Computed 989 place invariants in 220 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Product exploration explored 100000 steps with 20550 reset in 2664 ms.
Product exploration explored 100000 steps with 20517 reset in 2653 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Support contains 3 out of 4989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4989/4989 places, 8283/8283 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 4989 transition count 8284
Deduced a syphon composed of 311 places in 6 ms
Iterating global reduction 0 with 311 rules applied. Total rules applied 311 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 337 place count 4989 transition count 8284
Deduced a syphon composed of 337 places in 5 ms
Applied a total of 337 rules in 1339 ms. Remains 4989 /4989 variables (removed 0) and now considering 8284/8283 (removed -1) transitions.
[2022-05-18 04:50:53] [INFO ] Redundant transitions in 892 ms returned []
[2022-05-18 04:50:53] [INFO ] Flow matrix only has 7684 transitions (discarded 600 similar events)
// Phase 1: matrix 7684 rows 4989 cols
[2022-05-18 04:50:54] [INFO ] Computed 989 place invariants in 212 ms
[2022-05-18 04:50:58] [INFO ] Dead Transitions using invariants and state equation in 4624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4989/4989 places, 8284/8283 transitions.
Finished structural reductions, in 1 iterations. Remains : 4989/4989 places, 8284/8283 transitions.
Product exploration timeout after 72980 steps with 14989 reset in 10001 ms.
Product exploration timeout after 73200 steps with 14979 reset in 10001 ms.
Built C files in :
/tmp/ltsmin1180382987347526421
[2022-05-18 04:51:18] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1180382987347526421
Running compilation step : cd /tmp/ltsmin1180382987347526421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1180382987347526421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1180382987347526421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 4989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4989/4989 places, 8283/8283 transitions.
Applied a total of 0 rules in 357 ms. Remains 4989 /4989 variables (removed 0) and now considering 8283/8283 (removed 0) transitions.
[2022-05-18 04:51:22] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:51:22] [INFO ] Computed 989 place invariants in 191 ms
[2022-05-18 04:51:25] [INFO ] Implicit Places using invariants in 3977 ms returned []
[2022-05-18 04:51:25] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:51:26] [INFO ] Computed 989 place invariants in 198 ms
[2022-05-18 04:51:30] [INFO ] Implicit Places using invariants and state equation in 4107 ms returned []
Implicit Place search using SMT with State Equation took 8086 ms to find 0 implicit places.
[2022-05-18 04:51:30] [INFO ] Flow matrix only has 7683 transitions (discarded 600 similar events)
// Phase 1: matrix 7683 rows 4989 cols
[2022-05-18 04:51:30] [INFO ] Computed 989 place invariants in 182 ms
[2022-05-18 04:51:35] [INFO ] Dead Transitions using invariants and state equation in 5064 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4989/4989 places, 8283/8283 transitions.
Built C files in :
/tmp/ltsmin3631993909702809119
[2022-05-18 04:51:35] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3631993909702809119
Running compilation step : cd /tmp/ltsmin3631993909702809119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3631993909702809119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3631993909702809119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 04:51:38] [INFO ] Flatten gal took : 298 ms
[2022-05-18 04:51:39] [INFO ] Flatten gal took : 335 ms
[2022-05-18 04:51:39] [INFO ] Time to serialize gal into /tmp/LTL15521767046271539243.gal : 71 ms
[2022-05-18 04:51:39] [INFO ] Time to serialize properties into /tmp/LTL15898782131552025466.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15521767046271539243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15898782131552025466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1552176...268
Read 1 LTL properties
Checking formula 0 : !((X((X((X("(Node12HasTheLeafSetOfRx2ToReplaceNode23<1)"))||(((F(!("((Node5DontAnswerToAnyNode>=1)&&(Node21IsActive>=1))")))&&("(Node5...373
Formula 0 simplified : !X(X(X"(Node12HasTheLeafSetOfRx2ToReplaceNode23<1)" | ("(Node5DontAnswerToAnyNode>=1)" & "(Node21IsActive>=1)" & F!"((Node5DontAnswe...356
Detected timeout of ITS tools.
[2022-05-18 04:51:54] [INFO ] Flatten gal took : 305 ms
[2022-05-18 04:51:54] [INFO ] Applying decomposition
[2022-05-18 04:51:54] [INFO ] Flatten gal took : 267 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3288667863042897905.txt' '-o' '/tmp/graph3288667863042897905.bin' '-w' '/tmp/graph3288667863042897905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3288667863042897905.bin' '-l' '-1' '-v' '-w' '/tmp/graph3288667863042897905.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:51:55] [INFO ] Decomposing Gal with order
[2022-05-18 04:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:51:56] [INFO ] Removed a total of 6181 redundant transitions.
[2022-05-18 04:51:56] [INFO ] Flatten gal took : 956 ms
[2022-05-18 04:51:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 3976 labels/synchronizations in 389 ms.
[2022-05-18 04:51:57] [INFO ] Time to serialize gal into /tmp/LTL12365481263110901809.gal : 79 ms
[2022-05-18 04:51:57] [INFO ] Time to serialize properties into /tmp/LTL13170701407824062299.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12365481263110901809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13170701407824062299.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1236548...247
Read 1 LTL properties
Checking formula 0 : !((X((X((X("(i9.u249.Node12HasTheLeafSetOfRx2ToReplaceNode23<1)"))||(((F(!("((i0.u0.Node5DontAnswerToAnyNode>=1)&&(i0.u0.Node21IsActiv...440
Formula 0 simplified : !X(X(X"(i9.u249.Node12HasTheLeafSetOfRx2ToReplaceNode23<1)" | ("(i0.u0.Node5DontAnswerToAnyNode>=1)" & "(i0.u0.Node21IsActive>=1)" &...423
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18331345262614445420
[2022-05-18 04:52:12] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18331345262614445420
Running compilation step : cd /tmp/ltsmin18331345262614445420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin18331345262614445420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin18331345262614445420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-10 finished in 172393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(F(p0)) U p1))'
Support contains 4 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 5021 transition count 8388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5014 transition count 8388
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 14 place count 5014 transition count 8077
Deduced a syphon composed of 311 places in 6 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 636 place count 4703 transition count 8077
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 647 place count 4692 transition count 8036
Iterating global reduction 2 with 11 rules applied. Total rules applied 658 place count 4692 transition count 8036
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 658 place count 4692 transition count 8033
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 664 place count 4689 transition count 8033
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 669 place count 4684 transition count 8003
Iterating global reduction 2 with 5 rules applied. Total rules applied 674 place count 4684 transition count 8003
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 734 place count 4654 transition count 7973
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 740 place count 4648 transition count 7967
Iterating global reduction 2 with 6 rules applied. Total rules applied 746 place count 4648 transition count 7967
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 746 place count 4648 transition count 7962
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 756 place count 4643 transition count 7962
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 762 place count 4637 transition count 7926
Iterating global reduction 2 with 6 rules applied. Total rules applied 768 place count 4637 transition count 7926
Applied a total of 768 rules in 2608 ms. Remains 4637 /5021 variables (removed 384) and now considering 7926/8395 (removed 469) transitions.
[2022-05-18 04:52:18] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:52:18] [INFO ] Computed 989 place invariants in 215 ms
[2022-05-18 04:52:23] [INFO ] Implicit Places using invariants in 4850 ms returned []
[2022-05-18 04:52:23] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:52:23] [INFO ] Computed 989 place invariants in 218 ms
[2022-05-18 04:52:27] [INFO ] Implicit Places using invariants and state equation in 4755 ms returned []
Implicit Place search using SMT with State Equation took 9609 ms to find 0 implicit places.
[2022-05-18 04:52:28] [INFO ] Redundant transitions in 814 ms returned []
[2022-05-18 04:52:28] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:52:28] [INFO ] Computed 989 place invariants in 218 ms
[2022-05-18 04:52:33] [INFO ] Dead Transitions using invariants and state equation in 4943 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4637/5021 places, 7926/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4637/5021 places, 7926/8395 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, p1, p0, (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s1013 1) (GEQ s1860 1)), p0:(AND (GEQ s2990 1) (GEQ s3741 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, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2296 reset in 1220 ms.
Product exploration explored 100000 steps with 2296 reset in 1215 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 263 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (AND p0 p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22227 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22227 steps, saw 10396 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 04:52:40] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:52:40] [INFO ] Computed 989 place invariants in 205 ms
[2022-05-18 04:52:41] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 04:52:41] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2022-05-18 04:52:45] [INFO ] After 3822ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2022-05-18 04:52:45] [INFO ] State equation strengthened by 2852 read => feed constraints.
[2022-05-18 04:52:45] [INFO ] After 186ms SMT Verify possible using 2852 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-18 04:52:45] [INFO ] After 5145ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-18 04:52:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 04:52:46] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 274 ms returned sat
[2022-05-18 04:52:51] [INFO ] After 5348ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-18 04:52:53] [INFO ] After 1347ms SMT Verify possible using 2852 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-05-18 04:52:58] [INFO ] Deduced a trap composed of 825 places in 4558 ms of which 4 ms to minimize.
[2022-05-18 04:53:02] [INFO ] Deduced a trap composed of 657 places in 4503 ms of which 4 ms to minimize.
[2022-05-18 04:53:07] [INFO ] Deduced a trap composed of 628 places in 4728 ms of which 5 ms to minimize.
[2022-05-18 04:53:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14741 ms
[2022-05-18 04:53:08] [INFO ] After 16621ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 666 ms.
[2022-05-18 04:53:09] [INFO ] After 23676ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 4637 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1129 ms. Remains 4301 /4637 variables (removed 336) and now considering 10340/7926 (removed -2414) transitions.
Finished structural reductions, in 1 iterations. Remains : 4301/4637 places, 10340/7926 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) 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 22472 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22472 steps, saw 10296 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 04:53:13] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2022-05-18 04:53:14] [INFO ] Computed 989 place invariants in 242 ms
[2022-05-18 04:53:14] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-18 04:53:14] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 250 ms returned sat
[2022-05-18 04:53:15] [INFO ] After 930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 04:53:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2022-05-18 04:53:15] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 259 ms returned sat
[2022-05-18 04:53:20] [INFO ] After 4517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 04:53:20] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:53:22] [INFO ] After 1796ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 04:53:27] [INFO ] Deduced a trap composed of 452 places in 4744 ms of which 4 ms to minimize.
[2022-05-18 04:53:33] [INFO ] Deduced a trap composed of 219 places in 5143 ms of which 4 ms to minimize.
[2022-05-18 04:53:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10689 ms
[2022-05-18 04:53:33] [INFO ] After 13236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 573 ms.
[2022-05-18 04:53:34] [INFO ] After 19321ms 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 4 out of 4301 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 528 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 519 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2022-05-18 04:53:35] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2022-05-18 04:53:35] [INFO ] Computed 989 place invariants in 246 ms
[2022-05-18 04:53:44] [INFO ] Implicit Places using invariants in 9228 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 9250 ms to find 926 implicit places.
Starting structural reductions in SAFETY 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 1276 ms. Remains 2796 /3375 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2022-05-18 04:53:46] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2796 cols
[2022-05-18 04:53:46] [INFO ] Computed 63 place invariants in 217 ms
[2022-05-18 04:53:50] [INFO ] Implicit Places using invariants in 4340 ms returned [1373, 1517]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4350 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 468 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 2794/4301 places, 9761/10340 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25953 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25953 steps, saw 11045 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 04:53:54] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2022-05-18 04:53:54] [INFO ] Computed 61 place invariants in 164 ms
[2022-05-18 04:53:54] [INFO ] [Real]Absence check using 47 positive place invariants in 40 ms returned sat
[2022-05-18 04:53:54] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 7 ms returned sat
[2022-05-18 04:53:55] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 04:53:55] [INFO ] [Nat]Absence check using 47 positive place invariants in 36 ms returned sat
[2022-05-18 04:53:55] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 8 ms returned sat
[2022-05-18 04:54:00] [INFO ] After 4674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 04:54:00] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:54:04] [INFO ] After 4408ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 04:54:06] [INFO ] Deduced a trap composed of 308 places in 2092 ms of which 3 ms to minimize.
[2022-05-18 04:54:09] [INFO ] Deduced a trap composed of 102 places in 2189 ms of which 3 ms to minimize.
[2022-05-18 04:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4891 ms
[2022-05-18 04:54:10] [INFO ] After 9975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 449 ms.
[2022-05-18 04:54:10] [INFO ] After 15568ms 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 4 out of 2794 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 471 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 470 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2022-05-18 04:54:11] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2022-05-18 04:54:11] [INFO ] Computed 61 place invariants in 149 ms
[2022-05-18 04:54:15] [INFO ] Implicit Places using invariants in 4271 ms returned []
[2022-05-18 04:54:15] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2022-05-18 04:54:15] [INFO ] Computed 61 place invariants in 167 ms
[2022-05-18 04:54:22] [INFO ] Implicit Places using invariants and state equation in 6588 ms returned []
Implicit Place search using SMT with State Equation took 10862 ms to find 0 implicit places.
[2022-05-18 04:54:23] [INFO ] Redundant transitions in 1207 ms returned []
[2022-05-18 04:54:23] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2022-05-18 04:54:23] [INFO ] Computed 61 place invariants in 141 ms
[2022-05-18 04:54:28] [INFO ] Dead Transitions using invariants and state equation in 5140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2794/2794 places, 9761/9761 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (G (NOT p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT p0))
Knowledge based reduction with 11 factoid took 241 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-11 finished in 133419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||p1) U p0) U G((G(!p3)&&p2))))'
Support contains 4 out of 5021 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 : 5021/5021 places, 8395/8395 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 0 with 6 rules applied. Total rules applied 6 place count 5021 transition count 8389
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5015 transition count 8389
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 12 place count 5015 transition count 8078
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 634 place count 4704 transition count 8078
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 645 place count 4693 transition count 8037
Iterating global reduction 2 with 11 rules applied. Total rules applied 656 place count 4693 transition count 8037
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 656 place count 4693 transition count 8034
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 662 place count 4690 transition count 8034
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 667 place count 4685 transition count 8004
Iterating global reduction 2 with 5 rules applied. Total rules applied 672 place count 4685 transition count 8004
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 732 place count 4655 transition count 7974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 737 place count 4650 transition count 7969
Iterating global reduction 2 with 5 rules applied. Total rules applied 742 place count 4650 transition count 7969
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 4650 transition count 7965
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 750 place count 4646 transition count 7965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 755 place count 4641 transition count 7935
Iterating global reduction 2 with 5 rules applied. Total rules applied 760 place count 4641 transition count 7935
Applied a total of 760 rules in 2365 ms. Remains 4641 /5021 variables (removed 380) and now considering 7935/8395 (removed 460) transitions.
[2022-05-18 04:54:31] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:54:31] [INFO ] Computed 989 place invariants in 198 ms
[2022-05-18 04:54:36] [INFO ] Implicit Places using invariants in 5099 ms returned []
[2022-05-18 04:54:36] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:54:36] [INFO ] Computed 989 place invariants in 215 ms
[2022-05-18 04:54:41] [INFO ] Implicit Places using invariants and state equation in 4911 ms returned []
Implicit Place search using SMT with State Equation took 10019 ms to find 0 implicit places.
[2022-05-18 04:54:42] [INFO ] Redundant transitions in 649 ms returned []
[2022-05-18 04:54:42] [INFO ] Flow matrix only has 7335 transitions (discarded 600 similar events)
// Phase 1: matrix 7335 rows 4641 cols
[2022-05-18 04:54:42] [INFO ] Computed 989 place invariants in 210 ms
[2022-05-18 04:54:47] [INFO ] Dead Transitions using invariants and state equation in 5133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4641/5021 places, 7935/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4641/5021 places, 7935/8395 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) p3), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p3)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s339 1) (GEQ s4397 1)), p3:(AND (GEQ s1328 1) (GEQ s3585 1)), p0:(AND (GEQ s339 1) (GEQ s4397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-12 finished in 18592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((G(p1)&&p0))||X(p2)))))'
Support contains 4 out of 5021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5006 transition count 8360
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5006 transition count 8360
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 4995 transition count 8329
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 4995 transition count 8329
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 4988 transition count 8287
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 4988 transition count 8287
Applied a total of 66 rules in 1355 ms. Remains 4988 /5021 variables (removed 33) and now considering 8287/8395 (removed 108) transitions.
[2022-05-18 04:54:48] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:54:49] [INFO ] Computed 989 place invariants in 202 ms
[2022-05-18 04:54:52] [INFO ] Implicit Places using invariants in 3704 ms returned []
[2022-05-18 04:54:52] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:54:52] [INFO ] Computed 989 place invariants in 184 ms
[2022-05-18 04:54:56] [INFO ] Implicit Places using invariants and state equation in 3512 ms returned []
Implicit Place search using SMT with State Equation took 7217 ms to find 0 implicit places.
[2022-05-18 04:54:56] [INFO ] Flow matrix only has 7687 transitions (discarded 600 similar events)
// Phase 1: matrix 7687 rows 4988 cols
[2022-05-18 04:54:56] [INFO ] Computed 989 place invariants in 192 ms
[2022-05-18 04:55:01] [INFO ] Dead Transitions using invariants and state equation in 5091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4988/5021 places, 8287/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4988/5021 places, 8287/8395 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(AND (GEQ s2530 1) (GEQ s4948 1)), p1:(OR (LT s3233 1) (LT s4867 1)), p0:(AND (GEQ s3233 1) (GEQ s4867 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-13 finished in 13885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(F(G(p0)))))))'
Support contains 4 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 5021 transition count 8388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5014 transition count 8388
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 14 place count 5014 transition count 8077
Deduced a syphon composed of 311 places in 6 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 636 place count 4703 transition count 8077
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 647 place count 4692 transition count 8036
Iterating global reduction 2 with 11 rules applied. Total rules applied 658 place count 4692 transition count 8036
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 658 place count 4692 transition count 8033
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 664 place count 4689 transition count 8033
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 669 place count 4684 transition count 8003
Iterating global reduction 2 with 5 rules applied. Total rules applied 674 place count 4684 transition count 8003
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 734 place count 4654 transition count 7973
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 740 place count 4648 transition count 7967
Iterating global reduction 2 with 6 rules applied. Total rules applied 746 place count 4648 transition count 7967
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 746 place count 4648 transition count 7962
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 756 place count 4643 transition count 7962
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 762 place count 4637 transition count 7926
Iterating global reduction 2 with 6 rules applied. Total rules applied 768 place count 4637 transition count 7926
Applied a total of 768 rules in 2414 ms. Remains 4637 /5021 variables (removed 384) and now considering 7926/8395 (removed 469) transitions.
[2022-05-18 04:55:03] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:04] [INFO ] Computed 989 place invariants in 203 ms
[2022-05-18 04:55:08] [INFO ] Implicit Places using invariants in 4844 ms returned []
[2022-05-18 04:55:08] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:08] [INFO ] Computed 989 place invariants in 206 ms
[2022-05-18 04:55:13] [INFO ] Implicit Places using invariants and state equation in 4808 ms returned []
Implicit Place search using SMT with State Equation took 9654 ms to find 0 implicit places.
[2022-05-18 04:55:14] [INFO ] Redundant transitions in 617 ms returned []
[2022-05-18 04:55:14] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:14] [INFO ] Computed 989 place invariants in 215 ms
[2022-05-18 04:55:19] [INFO ] Dead Transitions using invariants and state equation in 5084 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4637/5021 places, 7926/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4637/5021 places, 7926/8395 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15 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 s2 1) (LT s1326 1) (LT s2703 1) (LT s2704 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 2296 reset in 1349 ms.
Product exploration explored 100000 steps with 2296 reset in 1190 ms.
Computed a total of 2038 stabilizing places and 2750 stable transitions
Computed a total of 2038 stabilizing places and 2750 stable transitions
Detected a total of 2038/4637 stabilizing places and 2750/7926 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 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 8479 steps, including 194 resets, run visited all 1 properties in 97 ms. (steps per millisecond=87 )
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 196 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 4 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 486 ms. Remains 4637 /4637 variables (removed 0) and now considering 7926/7926 (removed 0) transitions.
[2022-05-18 04:55:22] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:23] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:55:27] [INFO ] Implicit Places using invariants in 4793 ms returned []
[2022-05-18 04:55:27] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:27] [INFO ] Computed 989 place invariants in 202 ms
[2022-05-18 04:55:32] [INFO ] Implicit Places using invariants and state equation in 4691 ms returned []
Implicit Place search using SMT with State Equation took 9486 ms to find 0 implicit places.
[2022-05-18 04:55:33] [INFO ] Redundant transitions in 644 ms returned []
[2022-05-18 04:55:33] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:33] [INFO ] Computed 989 place invariants in 200 ms
[2022-05-18 04:55:37] [INFO ] Dead Transitions using invariants and state equation in 4832 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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
Detected a total of 2038/4637 stabilizing places and 2750/7926 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 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2654 steps, including 61 resets, run visited all 1 properties in 32 ms. (steps per millisecond=82 )
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 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2295 reset in 1118 ms.
Product exploration explored 100000 steps with 2296 reset in 1132 ms.
Built C files in :
/tmp/ltsmin14078864586065695394
[2022-05-18 04:55:40] [INFO ] Too many transitions (7926) to apply POR reductions. Disabling POR matrices.
[2022-05-18 04:55:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14078864586065695394
Running compilation step : cd /tmp/ltsmin14078864586065695394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14078864586065695394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14078864586065695394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 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 496 ms. Remains 4637 /4637 variables (removed 0) and now considering 7926/7926 (removed 0) transitions.
[2022-05-18 04:55:44] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:44] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:55:48] [INFO ] Implicit Places using invariants in 4607 ms returned []
[2022-05-18 04:55:48] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:49] [INFO ] Computed 989 place invariants in 236 ms
[2022-05-18 04:55:53] [INFO ] Implicit Places using invariants and state equation in 4779 ms returned []
Implicit Place search using SMT with State Equation took 9390 ms to find 0 implicit places.
[2022-05-18 04:55:54] [INFO ] Redundant transitions in 655 ms returned []
[2022-05-18 04:55:54] [INFO ] Flow matrix only has 7326 transitions (discarded 600 similar events)
// Phase 1: matrix 7326 rows 4637 cols
[2022-05-18 04:55:54] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:55:58] [INFO ] Dead Transitions using invariants and state equation in 4603 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4637/4637 places, 7926/7926 transitions.
Built C files in :
/tmp/ltsmin13256976492718876274
[2022-05-18 04:55:58] [INFO ] Too many transitions (7926) to apply POR reductions. Disabling POR matrices.
[2022-05-18 04:55:59] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13256976492718876274
Running compilation step : cd /tmp/ltsmin13256976492718876274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13256976492718876274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13256976492718876274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 04:56:02] [INFO ] Flatten gal took : 354 ms
[2022-05-18 04:56:02] [INFO ] Flatten gal took : 244 ms
[2022-05-18 04:56:02] [INFO ] Time to serialize gal into /tmp/LTL1487385170447971472.gal : 73 ms
[2022-05-18 04:56:02] [INFO ] Time to serialize properties into /tmp/LTL3928642619254089721.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1487385170447971472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3928642619254089721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1487385...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(F(G("(((ThereIsAMasterInTheLeafSet<1)||(NoNodeManageTheCrashOfNode4<1))||((Node18WantsToManageTheCrashOfNode4<1)||(Node18Ha...190
Formula 0 simplified : !GFGFG"(((ThereIsAMasterInTheLeafSet<1)||(NoNodeManageTheCrashOfNode4<1))||((Node18WantsToManageTheCrashOfNode4<1)||(Node18HasDetect...175
Detected timeout of ITS tools.
[2022-05-18 04:56:18] [INFO ] Flatten gal took : 243 ms
[2022-05-18 04:56:18] [INFO ] Applying decomposition
[2022-05-18 04:56:18] [INFO ] Flatten gal took : 249 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4845747801147343947.txt' '-o' '/tmp/graph4845747801147343947.bin' '-w' '/tmp/graph4845747801147343947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4845747801147343947.bin' '-l' '-1' '-v' '-w' '/tmp/graph4845747801147343947.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:56:19] [INFO ] Decomposing Gal with order
[2022-05-18 04:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:56:21] [INFO ] Removed a total of 6719 redundant transitions.
[2022-05-18 04:56:21] [INFO ] Flatten gal took : 1700 ms
[2022-05-18 04:56:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4309 labels/synchronizations in 351 ms.
[2022-05-18 04:56:22] [INFO ] Time to serialize gal into /tmp/LTL14864779973052708222.gal : 160 ms
[2022-05-18 04:56:22] [INFO ] Time to serialize properties into /tmp/LTL2154544742830398642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864779973052708222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2154544742830398642.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1486477...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(F(G("(((i1.u1.ThereIsAMasterInTheLeafSet<1)||(i1.u1.NoNodeManageTheCrashOfNode4<1))||((i1.u1.Node18WantsToManageTheCrashOfN...220
Formula 0 simplified : !GFGFG"(((i1.u1.ThereIsAMasterInTheLeafSet<1)||(i1.u1.NoNodeManageTheCrashOfNode4<1))||((i1.u1.Node18WantsToManageTheCrashOfNode4<1)...205
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6699306303383475344
[2022-05-18 04:56:37] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6699306303383475344
Running compilation step : cd /tmp/ltsmin6699306303383475344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6699306303383475344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6699306303383475344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-15 finished in 98707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(G(p0))||G((G(p1)&&p2))||p3)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&G(X(G(F(X(p1)))))))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 5021 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5021/5021 places, 8395/8395 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 5021 transition count 8388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5014 transition count 8388
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 14 place count 5014 transition count 8077
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 636 place count 4703 transition count 8077
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 646 place count 4693 transition count 8042
Iterating global reduction 2 with 10 rules applied. Total rules applied 656 place count 4693 transition count 8042
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 656 place count 4693 transition count 8039
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 662 place count 4690 transition count 8039
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 667 place count 4685 transition count 8009
Iterating global reduction 2 with 5 rules applied. Total rules applied 672 place count 4685 transition count 8009
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 730 place count 4656 transition count 7980
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 736 place count 4650 transition count 7974
Iterating global reduction 2 with 6 rules applied. Total rules applied 742 place count 4650 transition count 7974
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 742 place count 4650 transition count 7969
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 752 place count 4645 transition count 7969
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 758 place count 4639 transition count 7933
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 4639 transition count 7933
Applied a total of 764 rules in 2460 ms. Remains 4639 /5021 variables (removed 382) and now considering 7933/8395 (removed 462) transitions.
[2022-05-18 04:56:42] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:56:43] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:56:48] [INFO ] Implicit Places using invariants in 5118 ms returned []
[2022-05-18 04:56:48] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:56:48] [INFO ] Computed 989 place invariants in 198 ms
[2022-05-18 04:56:53] [INFO ] Implicit Places using invariants and state equation in 4927 ms returned []
Implicit Place search using SMT with State Equation took 10046 ms to find 0 implicit places.
[2022-05-18 04:56:53] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:56:53] [INFO ] Computed 989 place invariants in 195 ms
[2022-05-18 04:56:57] [INFO ] Dead Transitions using invariants and state equation in 4924 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4639/5021 places, 7933/8395 transitions.
Finished structural reductions, in 1 iterations. Remains : 4639/5021 places, 7933/8395 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1656 1) (LT s4476 1)), p1:(OR (LT s2684 1) (LT s2687 1) (LT s3188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2296 reset in 1168 ms.
Product exploration explored 100000 steps with 2294 reset in 1239 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/4639 stabilizing places and 2756/7933 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 22991 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22991 steps, saw 10748 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:57:04] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:57:04] [INFO ] Computed 989 place invariants in 196 ms
[2022-05-18 04:57:05] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2022-05-18 04:57:05] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 263 ms returned sat
[2022-05-18 04:57:08] [INFO ] After 4387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:57:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 04:57:09] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 258 ms returned sat
[2022-05-18 04:57:14] [INFO ] After 4150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:57:14] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:57:19] [INFO ] After 5201ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:57:27] [INFO ] Deduced a trap composed of 388 places in 4497 ms of which 4 ms to minimize.
[2022-05-18 04:57:33] [INFO ] Deduced a trap composed of 386 places in 4406 ms of which 5 ms to minimize.
[2022-05-18 04:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 10513 ms
[2022-05-18 04:57:33] [INFO ] After 19765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 04:57:33] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 4639 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4639/4639 places, 7933/7933 transitions.
Free-agglomeration rule (complex) applied 324 times.
Iterating global reduction 0 with 324 rules applied. Total rules applied 324 place count 4639 transition count 10354
Reduce places removed 324 places and 0 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 648 place count 4315 transition count 10354
Applied a total of 648 rules in 1191 ms. Remains 4315 /4639 variables (removed 324) and now considering 10354/7933 (removed -2421) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4639 places, 10354/7933 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21727 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21727 steps, saw 9964 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:57:38] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:57:38] [INFO ] Computed 989 place invariants in 252 ms
[2022-05-18 04:57:39] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 04:57:39] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 228 ms returned sat
[2022-05-18 04:57:43] [INFO ] After 4985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:57:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 04:57:44] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 266 ms returned sat
[2022-05-18 04:57:53] [INFO ] After 8098ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:57:53] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 04:58:05] [INFO ] After 12299ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 04:58:09] [INFO ] After 15801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 04:58:09] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 4315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 561 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 550 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
[2022-05-18 04:58:10] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:58:10] [INFO ] Computed 989 place invariants in 266 ms
[2022-05-18 04:58:14] [INFO ] Implicit Places using invariants in 4110 ms returned []
Implicit Place search using SMT only with invariants took 4116 ms to find 0 implicit places.
[2022-05-18 04:58:14] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:58:14] [INFO ] Computed 989 place invariants in 258 ms
[2022-05-18 04:58:20] [INFO ] Dead Transitions using invariants and state equation in 5714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Graph (trivial) has 3288 edges and 4315 vertex of which 24 / 4315 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 32046 edges and 4292 vertex of which 4270 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 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3644.t3984 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 3886 transition count 8679
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 3664 transition count 8260
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3454 transition count 7898
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3258 transition count 7594
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3105 transition count 7340
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 2967 transition count 7136
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 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 6 with 265 rules applied. Total rules applied 2952 place count 2864 transition count 6974
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 2776 transition count 6854
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 2715 transition count 6768
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 2669 transition count 6715
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 2642 transition count 6689
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 2629 transition count 6677
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 2617 transition count 6677
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 300 Pre rules applied. Total rules applied 3496 place count 2617 transition count 6377
Deduced a syphon composed of 300 places in 2 ms
Ensure Unique test removed 300 places
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 13 with 900 rules applied. Total rules applied 4396 place count 2017 transition count 6377
Discarding 311 places :
Symmetric choice reduction at 13 with 311 rule applications. Total rules 4707 place count 1706 transition count 6066
Iterating global reduction 13 with 311 rules applied. Total rules applied 5018 place count 1706 transition count 6066
Discarding 399 places :
Symmetric choice reduction at 13 with 399 rule applications. Total rules 5417 place count 1307 transition count 3672
Iterating global reduction 13 with 399 rules applied. Total rules applied 5816 place count 1307 transition count 3672
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 13 with 387 rules applied. Total rules applied 6203 place count 1307 transition count 3285
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 837
Deduced a syphon composed of 837 places in 0 ms
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 14 with 1674 rules applied. Total rules applied 7877 place count 470 transition count 2448
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 8712 place count 470 transition count 1613
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 15 with 165 rules applied. Total rules applied 8877 place count 470 transition count 1448
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9030 place count 317 transition count 1448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9030 place count 317 transition count 1447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9032 place count 316 transition count 1447
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9184 place count 164 transition count 535
Iterating global reduction 16 with 152 rules applied. Total rules applied 9336 place count 164 transition count 535
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 16 with 140 rules applied. Total rules applied 9476 place count 164 transition count 395
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 9488 place count 164 transition count 383
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 9494 place count 164 transition count 377
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 9500 place count 158 transition count 377
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 9511 place count 147 transition count 311
Ensure Unique test removed 1 places
Iterating global reduction 18 with 12 rules applied. Total rules applied 9523 place count 146 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 9524 place count 146 transition count 310
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 9534 place count 146 transition count 300
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 19 with 144 rules applied. Total rules applied 9678 place count 146 transition count 300
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 9689 place count 135 transition count 234
Iterating global reduction 19 with 11 rules applied. Total rules applied 9700 place count 135 transition count 234
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 9711 place count 135 transition count 223
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 9713 place count 135 transition count 223
Applied a total of 9713 rules in 8435 ms. Remains 135 /4315 variables (removed 4180) and now considering 223/10354 (removed 10131) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 223 rows 135 cols
[2022-05-18 04:58:28] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-18 04:58:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 04:58:28] [INFO ] [Real]Absence check using 4 positive and 35 generalized place invariants in 5 ms returned sat
[2022-05-18 04:58:28] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:58:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 04:58:28] [INFO ] [Nat]Absence check using 4 positive and 35 generalized place invariants in 5 ms returned sat
[2022-05-18 04:58:28] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:58:28] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-18 04:58:28] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:58:28] [INFO ] Flatten gal took : 14 ms
[2022-05-18 04:58:28] [INFO ] Flatten gal took : 14 ms
[2022-05-18 04:58:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7412009421577163361.gal : 2 ms
[2022-05-18 04:58:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8473218784530708396.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6036931569575101316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7412009421577163361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8473218784530708396.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8473218784530708396.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :23 after 43
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :43 after 154
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :154 after 200
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :200 after 436
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :436 after 2919
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2919 after 10345
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10345 after 27766
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27766 after 49558
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :49558 after 120808
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :120808 after 145860
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :145860 after 384705
Detected timeout of ITS tools.
[2022-05-18 04:58:43] [INFO ] Flatten gal took : 10 ms
[2022-05-18 04:58:43] [INFO ] Applying decomposition
[2022-05-18 04:58:43] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5473367617821982356.txt' '-o' '/tmp/graph5473367617821982356.bin' '-w' '/tmp/graph5473367617821982356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5473367617821982356.bin' '-l' '-1' '-v' '-w' '/tmp/graph5473367617821982356.weights' '-q' '0' '-e' '0.001'
[2022-05-18 04:58:43] [INFO ] Decomposing Gal with order
[2022-05-18 04:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 04:58:43] [INFO ] Removed a total of 507 redundant transitions.
[2022-05-18 04:58:43] [INFO ] Flatten gal took : 25 ms
[2022-05-18 04:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-18 04:58:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13769907153864544910.gal : 2 ms
[2022-05-18 04:58:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8376587544120430204.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6036931569575101316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13769907153864544910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8376587544120430204.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8376587544120430204.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 44
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :44 after 140
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :140 after 491
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :491 after 1242
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1242 after 2591
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2591 after 5320
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5320 after 8246
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8246 after 14420
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8042076286114942256
[2022-05-18 04:58:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8042076286114942256
Running compilation step : cd /tmp/ltsmin8042076286114942256;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 442 ms.
Running link step : cd /tmp/ltsmin8042076286114942256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8042076286114942256;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 51 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin8042076286114942256;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 269 ms.
Found Violation
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 4639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4639/4639 places, 7933/7933 transitions.
Applied a total of 0 rules in 327 ms. Remains 4639 /4639 variables (removed 0) and now considering 7933/7933 (removed 0) transitions.
[2022-05-18 04:59:00] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:59:00] [INFO ] Computed 989 place invariants in 199 ms
[2022-05-18 04:59:05] [INFO ] Implicit Places using invariants in 5063 ms returned []
[2022-05-18 04:59:05] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:59:05] [INFO ] Computed 989 place invariants in 200 ms
[2022-05-18 04:59:10] [INFO ] Implicit Places using invariants and state equation in 5364 ms returned []
Implicit Place search using SMT with State Equation took 10427 ms to find 0 implicit places.
[2022-05-18 04:59:10] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:59:11] [INFO ] Computed 989 place invariants in 197 ms
[2022-05-18 04:59:16] [INFO ] Dead Transitions using invariants and state equation in 5214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4639/4639 places, 7933/7933 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/4639 stabilizing places and 2756/7933 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 23148 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23148 steps, saw 10822 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:59:20] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 04:59:20] [INFO ] Computed 989 place invariants in 211 ms
[2022-05-18 04:59:20] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2022-05-18 04:59:21] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 275 ms returned sat
[2022-05-18 04:59:24] [INFO ] After 4507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 04:59:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2022-05-18 04:59:25] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 277 ms returned sat
[2022-05-18 04:59:30] [INFO ] After 4471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 04:59:30] [INFO ] State equation strengthened by 2857 read => feed constraints.
[2022-05-18 04:59:35] [INFO ] After 5497ms SMT Verify possible using 2857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 04:59:44] [INFO ] Deduced a trap composed of 388 places in 4299 ms of which 16 ms to minimize.
[2022-05-18 04:59:50] [INFO ] Deduced a trap composed of 386 places in 4405 ms of which 5 ms to minimize.
[2022-05-18 04:59:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 04:59:50] [INFO ] After 25960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 4639 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4639/4639 places, 7933/7933 transitions.
Free-agglomeration rule (complex) applied 324 times.
Iterating global reduction 0 with 324 rules applied. Total rules applied 324 place count 4639 transition count 10354
Reduce places removed 324 places and 0 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 648 place count 4315 transition count 10354
Applied a total of 648 rules in 1107 ms. Remains 4315 /4639 variables (removed 324) and now considering 10354/7933 (removed -2421) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4639 places, 10354/7933 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21492 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21492 steps, saw 9864 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 04:59:55] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 04:59:55] [INFO ] Computed 989 place invariants in 250 ms
[2022-05-18 04:59:56] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 04:59:56] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 256 ms returned sat
[2022-05-18 05:00:00] [INFO ] After 4993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 05:00:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2022-05-18 05:00:01] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 255 ms returned sat
[2022-05-18 05:00:09] [INFO ] After 7723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 05:00:09] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2022-05-18 05:00:21] [INFO ] After 11487ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 05:00:25] [INFO ] After 16191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 05:00:25] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 4315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 519 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4315/4315 places, 10354/10354 transitions.
Applied a total of 0 rules in 520 ms. Remains 4315 /4315 variables (removed 0) and now considering 10354/10354 (removed 0) transitions.
[2022-05-18 05:00:26] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 05:00:27] [INFO ] Computed 989 place invariants in 247 ms
[2022-05-18 05:00:31] [INFO ] Implicit Places using invariants in 4162 ms returned []
Implicit Place search using SMT only with invariants took 4162 ms to find 0 implicit places.
[2022-05-18 05:00:31] [INFO ] Flow matrix only has 9480 transitions (discarded 874 similar events)
// Phase 1: matrix 9480 rows 4315 cols
[2022-05-18 05:00:31] [INFO ] Computed 989 place invariants in 268 ms
[2022-05-18 05:00:38] [INFO ] Dead Transitions using invariants and state equation in 7479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4315/4315 places, 10354/10354 transitions.
Graph (trivial) has 3288 edges and 4315 vertex of which 24 / 4315 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 32046 edges and 4292 vertex of which 4270 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 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3644.t3984 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 3886 transition count 8679
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 3664 transition count 8260
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3454 transition count 7898
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3258 transition count 7594
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3105 transition count 7340
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 2967 transition count 7136
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 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 6 with 265 rules applied. Total rules applied 2952 place count 2864 transition count 6974
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 2776 transition count 6854
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 2715 transition count 6768
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 2669 transition count 6715
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 2642 transition count 6689
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 2629 transition count 6677
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 2617 transition count 6677
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 300 Pre rules applied. Total rules applied 3496 place count 2617 transition count 6377
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 13 with 900 rules applied. Total rules applied 4396 place count 2017 transition count 6377
Discarding 311 places :
Symmetric choice reduction at 13 with 311 rule applications. Total rules 4707 place count 1706 transition count 6066
Iterating global reduction 13 with 311 rules applied. Total rules applied 5018 place count 1706 transition count 6066
Discarding 399 places :
Symmetric choice reduction at 13 with 399 rule applications. Total rules 5417 place count 1307 transition count 3672
Iterating global reduction 13 with 399 rules applied. Total rules applied 5816 place count 1307 transition count 3672
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 13 with 387 rules applied. Total rules applied 6203 place count 1307 transition count 3285
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 837
Deduced a syphon composed of 837 places in 1 ms
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 14 with 1674 rules applied. Total rules applied 7877 place count 470 transition count 2448
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 8712 place count 470 transition count 1613
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 15 with 165 rules applied. Total rules applied 8877 place count 470 transition count 1448
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9030 place count 317 transition count 1448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9030 place count 317 transition count 1447
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9032 place count 316 transition count 1447
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9184 place count 164 transition count 535
Iterating global reduction 16 with 152 rules applied. Total rules applied 9336 place count 164 transition count 535
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 16 with 140 rules applied. Total rules applied 9476 place count 164 transition count 395
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 9488 place count 164 transition count 383
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 9494 place count 164 transition count 377
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 9500 place count 158 transition count 377
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 9511 place count 147 transition count 311
Ensure Unique test removed 1 places
Iterating global reduction 18 with 12 rules applied. Total rules applied 9523 place count 146 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 9524 place count 146 transition count 310
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 9534 place count 146 transition count 300
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 19 with 144 rules applied. Total rules applied 9678 place count 146 transition count 300
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 9689 place count 135 transition count 234
Iterating global reduction 19 with 11 rules applied. Total rules applied 9700 place count 135 transition count 234
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 9711 place count 135 transition count 223
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 9713 place count 135 transition count 223
Applied a total of 9713 rules in 8511 ms. Remains 135 /4315 variables (removed 4180) and now considering 223/10354 (removed 10131) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 223 rows 135 cols
[2022-05-18 05:00:47] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-18 05:00:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 05:00:47] [INFO ] [Real]Absence check using 4 positive and 35 generalized place invariants in 5 ms returned sat
[2022-05-18 05:00:47] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 05:00:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 05:00:47] [INFO ] [Nat]Absence check using 4 positive and 35 generalized place invariants in 9 ms returned sat
[2022-05-18 05:00:47] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 05:00:47] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-18 05:00:47] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-18 05:00:47] [INFO ] Flatten gal took : 13 ms
[2022-05-18 05:00:47] [INFO ] Flatten gal took : 10 ms
[2022-05-18 05:00:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15810530686449929161.gal : 1 ms
[2022-05-18 05:00:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7415437177685383176.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6626420363604803220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15810530686449929161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7415437177685383176.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7415437177685383176.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :23 after 43
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :43 after 154
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :154 after 200
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :200 after 436
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :436 after 2919
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2919 after 10345
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10345 after 27766
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27766 after 49558
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :49558 after 120808
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :120808 after 145860
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :145860 after 384705
Detected timeout of ITS tools.
[2022-05-18 05:01:02] [INFO ] Flatten gal took : 16 ms
[2022-05-18 05:01:02] [INFO ] Applying decomposition
[2022-05-18 05:01:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2760802402277001937.txt' '-o' '/tmp/graph2760802402277001937.bin' '-w' '/tmp/graph2760802402277001937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2760802402277001937.bin' '-l' '-1' '-v' '-w' '/tmp/graph2760802402277001937.weights' '-q' '0' '-e' '0.001'
[2022-05-18 05:01:02] [INFO ] Decomposing Gal with order
[2022-05-18 05:01:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 05:01:02] [INFO ] Removed a total of 507 redundant transitions.
[2022-05-18 05:01:02] [INFO ] Flatten gal took : 23 ms
[2022-05-18 05:01:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-18 05:01:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15279269048991422739.gal : 2 ms
[2022-05-18 05:01:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11985328092040147614.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6626420363604803220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15279269048991422739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11985328092040147614.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality11985328092040147614.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 242
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :242 after 242
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :242 after 276
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :276 after 1260
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1260 after 209126
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16148287916442363165
[2022-05-18 05:01:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16148287916442363165
Running compilation step : cd /tmp/ltsmin16148287916442363165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin16148287916442363165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16148287916442363165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 86 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin16148287916442363165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 49 ms.
Found Violation
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 2298 reset in 1120 ms.
Product exploration explored 100000 steps with 2297 reset in 1145 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 4639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4639/4639 places, 7933/7933 transitions.
Applied a total of 0 rules in 473 ms. Remains 4639 /4639 variables (removed 0) and now considering 7933/7933 (removed 0) transitions.
[2022-05-18 05:01:22] [INFO ] Redundant transitions in 596 ms returned []
[2022-05-18 05:01:22] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 05:01:22] [INFO ] Computed 989 place invariants in 200 ms
[2022-05-18 05:01:27] [INFO ] Dead Transitions using invariants and state equation in 5193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4639/4639 places, 7933/7933 transitions.
Product exploration explored 100000 steps with 2297 reset in 2653 ms.
Product exploration explored 100000 steps with 2296 reset in 2664 ms.
Built C files in :
/tmp/ltsmin11880976294278290744
[2022-05-18 05:01:33] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11880976294278290744
Running compilation step : cd /tmp/ltsmin11880976294278290744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11880976294278290744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11880976294278290744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 4639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4639/4639 places, 7933/7933 transitions.
Applied a total of 0 rules in 323 ms. Remains 4639 /4639 variables (removed 0) and now considering 7933/7933 (removed 0) transitions.
[2022-05-18 05:01:36] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 05:01:36] [INFO ] Computed 989 place invariants in 207 ms
[2022-05-18 05:01:41] [INFO ] Implicit Places using invariants in 4998 ms returned []
[2022-05-18 05:01:41] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 05:01:41] [INFO ] Computed 989 place invariants in 194 ms
[2022-05-18 05:01:46] [INFO ] Implicit Places using invariants and state equation in 4946 ms returned []
Implicit Place search using SMT with State Equation took 9962 ms to find 0 implicit places.
[2022-05-18 05:01:46] [INFO ] Flow matrix only has 7333 transitions (discarded 600 similar events)
// Phase 1: matrix 7333 rows 4639 cols
[2022-05-18 05:01:46] [INFO ] Computed 989 place invariants in 198 ms
[2022-05-18 05:01:51] [INFO ] Dead Transitions using invariants and state equation in 4790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4639/4639 places, 7933/7933 transitions.
Built C files in :
/tmp/ltsmin3603177183221473464
[2022-05-18 05:01:51] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3603177183221473464
Running compilation step : cd /tmp/ltsmin3603177183221473464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3603177183221473464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3603177183221473464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 05:01:54] [INFO ] Flatten gal took : 240 ms
[2022-05-18 05:01:54] [INFO ] Flatten gal took : 300 ms
[2022-05-18 05:01:54] [INFO ] Time to serialize gal into /tmp/LTL10967482274859918951.gal : 26 ms
[2022-05-18 05:01:54] [INFO ] Time to serialize properties into /tmp/LTL12186071167149115348.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10967482274859918951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12186071167149115348.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1096748...268
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node7ManageTheCrashOfNode5<1)||(Lx5IsAtTheLeftExtremityOfTheLeafSet<1))"))&&(G(X(G(F(X("(((Node18IsActive<1)||(Node18IsTh...216
Formula 0 simplified : !XG(X"((Node7ManageTheCrashOfNode5<1)||(Lx5IsAtTheLeftExtremityOfTheLeafSet<1))" & GXGFX"(((Node18IsActive<1)||(Node18IsTheNodeMaste...197
Detected timeout of ITS tools.
[2022-05-18 05:02:10] [INFO ] Flatten gal took : 247 ms
[2022-05-18 05:02:10] [INFO ] Applying decomposition
[2022-05-18 05:02:10] [INFO ] Flatten gal took : 251 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16666163147367818457.txt' '-o' '/tmp/graph16666163147367818457.bin' '-w' '/tmp/graph16666163147367818457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16666163147367818457.bin' '-l' '-1' '-v' '-w' '/tmp/graph16666163147367818457.weights' '-q' '0' '-e' '0.001'
[2022-05-18 05:02:11] [INFO ] Decomposing Gal with order
[2022-05-18 05:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 05:02:12] [INFO ] Removed a total of 6679 redundant transitions.
[2022-05-18 05:02:12] [INFO ] Flatten gal took : 1250 ms
[2022-05-18 05:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4850 labels/synchronizations in 348 ms.
[2022-05-18 05:02:13] [INFO ] Time to serialize gal into /tmp/LTL5150920904118820505.gal : 38 ms
[2022-05-18 05:02:13] [INFO ] Time to serialize properties into /tmp/LTL6439729244325466740.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5150920904118820505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6439729244325466740.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5150920...245
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i0.u0.Node7ManageTheCrashOfNode5<1)||(i0.u0.Lx5IsAtTheLeftExtremityOfTheLeafSet<1))"))&&(G(X(G(F(X("(((i18.u1.Node18IsAct...249
Formula 0 simplified : !XG(X"((i0.u0.Node7ManageTheCrashOfNode5<1)||(i0.u0.Lx5IsAtTheLeftExtremityOfTheLeafSet<1))" & GXGFX"(((i18.u1.Node18IsActive<1)||(i...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12539024727141245564
[2022-05-18 05:02:28] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12539024727141245564
Running compilation step : cd /tmp/ltsmin12539024727141245564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12539024727141245564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12539024727141245564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03 finished in 351186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||(F(!p2)&&p1))) U (p3 U p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(F(G(p0)))))))'
[2022-05-18 05:02:31] [INFO ] Flatten gal took : 254 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin346554418527050981
[2022-05-18 05:02:32] [INFO ] Too many transitions (8395) to apply POR reductions. Disabling POR matrices.
[2022-05-18 05:02:32] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin346554418527050981
Running compilation step : cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 05:02:32] [INFO ] Applying decomposition
[2022-05-18 05:02:32] [INFO ] Flatten gal took : 450 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6421367029898327493.txt' '-o' '/tmp/graph6421367029898327493.bin' '-w' '/tmp/graph6421367029898327493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6421367029898327493.bin' '-l' '-1' '-v' '-w' '/tmp/graph6421367029898327493.weights' '-q' '0' '-e' '0.001'
[2022-05-18 05:02:33] [INFO ] Decomposing Gal with order
[2022-05-18 05:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 05:02:34] [INFO ] Removed a total of 6392 redundant transitions.
[2022-05-18 05:02:34] [INFO ] Flatten gal took : 1036 ms
[2022-05-18 05:02:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4121 labels/synchronizations in 275 ms.
[2022-05-18 05:02:35] [INFO ] Time to serialize gal into /tmp/LTLFireability1466249467948658078.gal : 71 ms
[2022-05-18 05:02:35] [INFO ] Time to serialize properties into /tmp/LTLFireability3669324273762238847.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1466249467948658078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3669324273762238847.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G(F(X(((F(G("(i28.u144.Node4HasTheLeafSetOfRx5ToReplaceNode16<1)")))||(G((G("((i25.u230.Node9ManageTheCrashOfNode6>=1)&&(i25.u659.L...368
Formula 0 simplified : !GFX("((i24.u658.Node0HasAskedItsLeafSetToLx1ToReplaceNode1>=1)&&(i24.u41.LeafSetOfLx1IsSentToNode0>=1))" | FG"(i28.u144.Node4HasThe...347
Compilation finished in 42442 ms.
Running link step : cd /tmp/ltsmin346554418527050981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((<>([]((LTLAPp0==true)))||[](([]((LTLAPp1==true))&&(LTLAPp2==true)))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((<>([]((LTLAPp0==true)))||[](([]((LTLAPp1==true))&&(LTLAPp2==true)))||(LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp4==true))&&[](X([](<>(X((LTLAPp5==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 05:31:23] [INFO ] Flatten gal took : 3918 ms
[2022-05-18 05:31:25] [INFO ] Time to serialize gal into /tmp/LTLFireability3199766815391768506.gal : 1101 ms
[2022-05-18 05:31:26] [INFO ] Time to serialize properties into /tmp/LTLFireability6487151048952275904.ltl : 95 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3199766815391768506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6487151048952275904.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 4 LTL properties
Checking formula 0 : !((G(F(X(((F(G("(Node4HasTheLeafSetOfRx5ToReplaceNode16<1)")))||(G((G("((Node9ManageTheCrashOfNode6>=1)&&(Lx3IsAtTheLeftExtremityOfThe...315
Formula 0 simplified : !GFX("((Node0HasAskedItsLeafSetToLx1ToReplaceNode1>=1)&&(LeafSetOfLx1IsSentToNode0>=1))" | FG"(Node4HasTheLeafSetOfRx5ToReplaceNode1...294
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp4==true))&&[](X([](<>(X((LTLAPp5==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((X((LTLAPp6==true))||(<>(!(LTLAPp8==true))&&(LTLAPp7==true)))) U ((LTLAPp9==true) U (LTLAPp8==true))))' '--buchi-type=spotba'
LTSmin run took 3765 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin346554418527050981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>([](<>(<>([]((LTLAPp10==true)))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r132-tall-165271821300740"
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 ;