About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16166.747 | 3600000.00 | 12443690.00 | 7025.30 | ?FTFFTT?TTTFTFFF | 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-165271821300731.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-S24C05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 13K Apr 29 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 12M 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-S24C05-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652845004777
Running Version 202205111006
[2022-05-18 03:36:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 03:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:36:46] [INFO ] Load time of PNML (sax parser for PT used): 675 ms
[2022-05-18 03:36:46] [INFO ] Transformed 11106 places.
[2022-05-18 03:36:46] [INFO ] Transformed 16561 transitions.
[2022-05-18 03:36:46] [INFO ] Parsed PT model containing 11106 places and 16561 transitions in 911 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 11106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 11068 transition count 16561
Discarding 2978 places :
Symmetric choice reduction at 1 with 2978 rule applications. Total rules 3016 place count 8090 transition count 13583
Iterating global reduction 1 with 2978 rules applied. Total rules applied 5994 place count 8090 transition count 13583
Discarding 2722 places :
Symmetric choice reduction at 1 with 2722 rule applications. Total rules 8716 place count 5368 transition count 10861
Iterating global reduction 1 with 2722 rules applied. Total rules applied 11438 place count 5368 transition count 10861
Discarding 519 places :
Symmetric choice reduction at 1 with 519 rule applications. Total rules 11957 place count 4849 transition count 8266
Iterating global reduction 1 with 519 rules applied. Total rules applied 12476 place count 4849 transition count 8266
Applied a total of 12476 rules in 3461 ms. Remains 4849 /11106 variables (removed 6257) and now considering 8266/16561 (removed 8295) transitions.
[2022-05-18 03:36:50] [INFO ] Flow matrix only has 7666 transitions (discarded 600 similar events)
// Phase 1: matrix 7666 rows 4849 cols
[2022-05-18 03:36:51] [INFO ] Computed 937 place invariants in 399 ms
[2022-05-18 03:36:54] [INFO ] Implicit Places using invariants in 4129 ms returned []
[2022-05-18 03:36:55] [INFO ] Flow matrix only has 7666 transitions (discarded 600 similar events)
// Phase 1: matrix 7666 rows 4849 cols
[2022-05-18 03:36:55] [INFO ] Computed 937 place invariants in 187 ms
[2022-05-18 03:36:58] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned []
Implicit Place search using SMT with State Equation took 7746 ms to find 0 implicit places.
[2022-05-18 03:36:58] [INFO ] Flow matrix only has 7666 transitions (discarded 600 similar events)
// Phase 1: matrix 7666 rows 4849 cols
[2022-05-18 03:36:58] [INFO ] Computed 937 place invariants in 223 ms
[2022-05-18 03:37:03] [INFO ] Dead Transitions using invariants and state equation in 5143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4849/11106 places, 8266/16561 transitions.
Finished structural reductions, in 1 iterations. Remains : 4849/11106 places, 8266/16561 transitions.
Support contains 51 out of 4849 places after structural reductions.
[2022-05-18 03:37:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 03:37:04] [INFO ] Flatten gal took : 519 ms
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 03:37:04] [INFO ] Flatten gal took : 348 ms
[2022-05-18 03:37:05] [INFO ] Input system was already deterministic with 8266 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 30) seen :10
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2022-05-18 03:37:06] [INFO ] Flow matrix only has 7666 transitions (discarded 600 similar events)
// Phase 1: matrix 7666 rows 4849 cols
[2022-05-18 03:37:06] [INFO ] Computed 937 place invariants in 222 ms
[2022-05-18 03:37:08] [INFO ] After 1791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-18 03:37:10] [INFO ] [Nat]Absence check using 47 positive place invariants in 59 ms returned sat
[2022-05-18 03:37:10] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 291 ms returned sat
[2022-05-18 03:37:18] [INFO ] After 7126ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :10
[2022-05-18 03:37:18] [INFO ] State equation strengthened by 2926 read => feed constraints.
[2022-05-18 03:37:33] [INFO ] After 15227ms SMT Verify possible using 2926 Read/Feed constraints in natural domain returned unsat :9 sat :7
[2022-05-18 03:37:33] [INFO ] After 15230ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 03:37:33] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :7
Fused 18 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 17 out of 4849 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 4849 transition count 8256
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 4839 transition count 8256
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 20 place count 4839 transition count 8002
Deduced a syphon composed of 254 places in 6 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 528 place count 4585 transition count 8002
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 538 place count 4575 transition count 7980
Iterating global reduction 2 with 10 rules applied. Total rules applied 548 place count 4575 transition count 7980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 548 place count 4575 transition count 7979
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 550 place count 4574 transition count 7979
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 557 place count 4567 transition count 7944
Iterating global reduction 2 with 7 rules applied. Total rules applied 564 place count 4567 transition count 7944
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 628 place count 4535 transition count 7912
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 638 place count 4525 transition count 7902
Iterating global reduction 2 with 10 rules applied. Total rules applied 648 place count 4525 transition count 7902
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 648 place count 4525 transition count 7900
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 652 place count 4523 transition count 7900
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 662 place count 4513 transition count 7850
Iterating global reduction 2 with 10 rules applied. Total rules applied 672 place count 4513 transition count 7850
Free-agglomeration rule (complex) applied 345 times.
Iterating global reduction 2 with 345 rules applied. Total rules applied 1017 place count 4513 transition count 9621
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 2 with 345 rules applied. Total rules applied 1362 place count 4168 transition count 9621
Partial Free-agglomeration rule applied 150 times.
Drop transitions removed 150 transitions
Iterating global reduction 3 with 150 rules applied. Total rules applied 1512 place count 4168 transition count 9621
Applied a total of 1512 rules in 4074 ms. Remains 4168 /4849 variables (removed 681) and now considering 9621/8266 (removed -1355) transitions.
Finished structural reductions, in 1 iterations. Remains : 4168/4849 places, 9621/8266 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-18 03:37:39] [INFO ] Flow matrix only has 8736 transitions (discarded 885 similar events)
// Phase 1: matrix 8736 rows 4168 cols
[2022-05-18 03:37:39] [INFO ] Computed 937 place invariants in 258 ms
[2022-05-18 03:37:40] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-18 03:37:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 03:37:41] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 236 ms returned sat
[2022-05-18 03:37:47] [INFO ] After 6151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-18 03:37:47] [INFO ] State equation strengthened by 4962 read => feed constraints.
[2022-05-18 03:38:05] [INFO ] After 17278ms SMT Verify possible using 4962 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 03:38:05] [INFO ] After 17283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 03:38:05] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 45 ms.
Support contains 14 out of 4168 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4168/4168 places, 9621/9621 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 4168 transition count 9621
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 6 place count 4165 transition count 9618
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 4165 transition count 9618
Applied a total of 9 rules in 1275 ms. Remains 4165 /4168 variables (removed 3) and now considering 9618/9621 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4165/4168 places, 9618/9621 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-18 03:38:07] [INFO ] Flow matrix only has 8733 transitions (discarded 885 similar events)
// Phase 1: matrix 8733 rows 4165 cols
[2022-05-18 03:38:07] [INFO ] Computed 937 place invariants in 305 ms
[2022-05-18 03:38:08] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 03:38:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 03:38:09] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 248 ms returned sat
[2022-05-18 03:38:15] [INFO ] After 5532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 03:38:15] [INFO ] State equation strengthened by 4962 read => feed constraints.
[2022-05-18 03:38:33] [INFO ] After 18163ms SMT Verify possible using 4962 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:38:33] [INFO ] After 18164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 03:38:33] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 8 out of 4165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4165/4165 places, 9618/9618 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 4165 transition count 9617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4164 transition count 9617
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 4164 transition count 9613
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10 place count 4160 transition count 9613
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 15 place count 4155 transition count 9608
Iterating global reduction 3 with 5 rules applied. Total rules applied 20 place count 4155 transition count 9608
Applied a total of 20 rules in 1164 ms. Remains 4155 /4165 variables (removed 10) and now considering 9608/9618 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4155/4165 places, 9608/9618 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-18 03:38:35] [INFO ] Flow matrix only has 8723 transitions (discarded 885 similar events)
// Phase 1: matrix 8723 rows 4155 cols
[2022-05-18 03:38:35] [INFO ] Computed 937 place invariants in 244 ms
[2022-05-18 03:38:36] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 03:38:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2022-05-18 03:38:37] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 248 ms returned sat
[2022-05-18 03:38:42] [INFO ] After 5306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 03:38:42] [INFO ] State equation strengthened by 4962 read => feed constraints.
[2022-05-18 03:39:00] [INFO ] After 17921ms SMT Verify possible using 4962 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-18 03:39:06] [INFO ] Deduced a trap composed of 2 places in 5088 ms of which 10 ms to minimize.
[2022-05-18 03:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 03:39:06] [INFO ] After 30133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 4155 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4155/4155 places, 9608/9608 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4155 transition count 9607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4154 transition count 9607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 4153 transition count 9606
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 4153 transition count 9606
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 4153 transition count 9606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 4152 transition count 9605
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 4152 transition count 9605
Applied a total of 7 rules in 1777 ms. Remains 4152 /4155 variables (removed 3) and now considering 9605/9608 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4152/4155 places, 9605/9608 transitions.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2225 stabilizing places and 3065 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G(p0)))))'
Support contains 2 out of 4849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 4849 transition count 8254
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 4837 transition count 8254
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 24 place count 4837 transition count 8000
Deduced a syphon composed of 254 places in 5 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 532 place count 4583 transition count 8000
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 551 place count 4564 transition count 7969
Iterating global reduction 2 with 19 rules applied. Total rules applied 570 place count 4564 transition count 7969
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 570 place count 4564 transition count 7967
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 574 place count 4562 transition count 7967
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 590 place count 4546 transition count 7887
Iterating global reduction 2 with 16 rules applied. Total rules applied 606 place count 4546 transition count 7887
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 670 place count 4514 transition count 7855
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 682 place count 4502 transition count 7843
Iterating global reduction 2 with 12 rules applied. Total rules applied 694 place count 4502 transition count 7843
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 694 place count 4502 transition count 7836
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 708 place count 4495 transition count 7836
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 720 place count 4483 transition count 7776
Iterating global reduction 2 with 12 rules applied. Total rules applied 732 place count 4483 transition count 7776
Applied a total of 732 rules in 2596 ms. Remains 4483 /4849 variables (removed 366) and now considering 7776/8266 (removed 490) transitions.
[2022-05-18 03:39:11] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:39:11] [INFO ] Computed 937 place invariants in 287 ms
[2022-05-18 03:39:16] [INFO ] Implicit Places using invariants in 4734 ms returned []
[2022-05-18 03:39:16] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:39:16] [INFO ] Computed 937 place invariants in 209 ms
[2022-05-18 03:39:20] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 9112 ms to find 0 implicit places.
[2022-05-18 03:39:21] [INFO ] Redundant transitions in 888 ms returned []
[2022-05-18 03:39:21] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:39:21] [INFO ] Computed 937 place invariants in 198 ms
[2022-05-18 03:39:25] [INFO ] Dead Transitions using invariants and state equation in 4584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4483/4849 places, 7776/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4483/4849 places, 7776/8266 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s924 s2174)], 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 2740 reset in 1346 ms.
Product exploration explored 100000 steps with 2743 reset in 1308 ms.
Computed a total of 1884 stabilizing places and 2600 stable transitions
Computed a total of 1884 stabilizing places and 2600 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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)]
Incomplete random walk after 10000 steps, including 275 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25728 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25728 steps, saw 11933 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 03:39:32] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:39:32] [INFO ] Computed 937 place invariants in 195 ms
[2022-05-18 03:39:32] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:39:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 03:39:33] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 270 ms returned sat
[2022-05-18 03:39:37] [INFO ] After 3797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:39:37] [INFO ] State equation strengthened by 2802 read => feed constraints.
[2022-05-18 03:39:46] [INFO ] After 9161ms SMT Verify possible using 2802 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 03:39:46] [INFO ] After 13903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 4483 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4483/4483 places, 7776/7776 transitions.
Free-agglomeration rule (complex) applied 334 times.
Iterating global reduction 0 with 334 rules applied. Total rules applied 334 place count 4483 transition count 9598
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 0 with 334 rules applied. Total rules applied 668 place count 4149 transition count 9598
Applied a total of 668 rules in 1120 ms. Remains 4149 /4483 variables (removed 334) and now considering 9598/7776 (removed -1822) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4483 places, 9598/7776 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24224 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24224 steps, saw 11037 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 03:39:51] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:39:51] [INFO ] Computed 937 place invariants in 222 ms
[2022-05-18 03:39:51] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:39:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 55 ms returned sat
[2022-05-18 03:39:52] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 242 ms returned sat
[2022-05-18 03:39:57] [INFO ] After 4340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:39:57] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2022-05-18 03:40:06] [INFO ] After 9359ms SMT Verify possible using 4958 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 03:40:06] [INFO ] After 14560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9598/9598 transitions.
Applied a total of 0 rules in 490 ms. Remains 4149 /4149 variables (removed 0) and now considering 9598/9598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4149 places, 9598/9598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9598/9598 transitions.
Applied a total of 0 rules in 485 ms. Remains 4149 /4149 variables (removed 0) and now considering 9598/9598 (removed 0) transitions.
[2022-05-18 03:40:07] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:40:07] [INFO ] Computed 937 place invariants in 220 ms
[2022-05-18 03:40:12] [INFO ] Implicit Places using invariants in 5260 ms returned []
[2022-05-18 03:40:12] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:40:12] [INFO ] Computed 937 place invariants in 225 ms
[2022-05-18 03:40:18] [INFO ] Implicit Places using invariants and state equation in 5361 ms returned []
Implicit Place search using SMT with State Equation took 10623 ms to find 0 implicit places.
[2022-05-18 03:40:19] [INFO ] Redundant transitions in 1222 ms returned []
[2022-05-18 03:40:19] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:40:19] [INFO ] Computed 937 place invariants in 231 ms
[2022-05-18 03:40:24] [INFO ] Dead Transitions using invariants and state equation in 5703 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4149 places, 9598/9598 transitions.
Graph (trivial) has 3278 edges and 4149 vertex of which 25 / 4149 are part of one of the 1 SCC in 4 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 27727 edges and 4125 vertex of which 4103 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3675.t4002 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3717 transition count 7870
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3475 transition count 7389
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3234 transition count 6949
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 637 rules applied. Total rules applied 2286 place count 2994 transition count 6552
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 558 rules applied. Total rules applied 2844 place count 2795 transition count 6193
Ensure Unique test removed 35 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 519 rules applied. Total rules applied 3363 place count 2598 transition count 5871
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 2436 transition count 5583
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 2276 transition count 5329
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 2148 transition count 5105
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2022 transition count 4911
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 1924 transition count 4743
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 1828 transition count 4601
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 1756 transition count 4481
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 1686 transition count 4383
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 1636 transition count 4303
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 1588 transition count 4241
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 1556 transition count 4193
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 1526 transition count 4159
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 1508 transition count 4135
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 1492 transition count 4121
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 1484 transition count 4113
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 1478 transition count 4110
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 1475 transition count 4109
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6248 place count 1475 transition count 3859
Deduced a syphon composed of 250 places in 1 ms
Ensure Unique test removed 250 places
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 23 with 750 rules applied. Total rules applied 6998 place count 975 transition count 3859
Discarding 264 places :
Symmetric choice reduction at 23 with 264 rule applications. Total rules 7262 place count 711 transition count 3595
Iterating global reduction 23 with 264 rules applied. Total rules applied 7526 place count 711 transition count 3595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7526 place count 711 transition count 3594
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7528 place count 710 transition count 3594
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8067 place count 171 transition count 899
Iterating global reduction 23 with 539 rules applied. Total rules applied 8606 place count 171 transition count 899
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9145 place count 171 transition count 360
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 49 rules applied. Total rules applied 9194 place count 146 transition count 336
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 24 with 10 rules applied. Total rules applied 9204 place count 146 transition count 326
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 9214 place count 136 transition count 326
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9236 place count 114 transition count 216
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 9269 place count 103 transition count 216
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9291 place count 103 transition count 194
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9302 place count 92 transition count 139
Iterating global reduction 26 with 11 rules applied. Total rules applied 9313 place count 92 transition count 139
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9324 place count 81 transition count 128
Iterating global reduction 26 with 11 rules applied. Total rules applied 9335 place count 81 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 9336 place count 81 transition count 128
Applied a total of 9336 rules in 5399 ms. Remains 81 /4149 variables (removed 4068) and now considering 128/9598 (removed 9470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 81 cols
[2022-05-18 03:40:30] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-18 03:40:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:40:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-18 03:40:30] [INFO ] [Nat]Absence check using 4 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-18 03:40:30] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:40:30] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-18 03:40:30] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 03:40:30] [INFO ] Flatten gal took : 12 ms
[2022-05-18 03:40:30] [INFO ] Flatten gal took : 8 ms
[2022-05-18 03:40:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3133285071568745025.gal : 7 ms
[2022-05-18 03:40:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10682943469763854380.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4200431587597459872;'/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/ReachabilityCardinality3133285071568745025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10682943469763854380.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/ReachabilityCardinality10682943469763854380.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 95
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :95 after 255
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :255 after 425
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :425 after 663
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :663 after 1302
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1302 after 2806
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2806 after 15114
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,55060,0.38193,15932,2,9640,14,28934,7,0,431,39714,0
Total reachable state count : 55060
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1498,0.383033,16196,2,774,14,28934,7,0,437,39714,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 4483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4483/4483 places, 7776/7776 transitions.
Applied a total of 0 rules in 1092 ms. Remains 4483 /4483 variables (removed 0) and now considering 7776/7776 (removed 0) transitions.
[2022-05-18 03:40:32] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:40:32] [INFO ] Computed 937 place invariants in 194 ms
[2022-05-18 03:40:36] [INFO ] Implicit Places using invariants in 4611 ms returned []
[2022-05-18 03:40:36] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:40:37] [INFO ] Computed 937 place invariants in 199 ms
[2022-05-18 03:40:41] [INFO ] Implicit Places using invariants and state equation in 4431 ms returned []
Implicit Place search using SMT with State Equation took 9044 ms to find 0 implicit places.
[2022-05-18 03:40:41] [INFO ] Redundant transitions in 595 ms returned []
[2022-05-18 03:40:41] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:40:42] [INFO ] Computed 937 place invariants in 201 ms
[2022-05-18 03:40:46] [INFO ] Dead Transitions using invariants and state equation in 4798 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4483/4483 places, 7776/7776 transitions.
Computed a total of 1884 stabilizing places and 2600 stable transitions
Computed a total of 1884 stabilizing places and 2600 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 274 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25412 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25412 steps, saw 11794 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 03:40:50] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:40:50] [INFO ] Computed 937 place invariants in 200 ms
[2022-05-18 03:40:50] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:40:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2022-05-18 03:40:51] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 268 ms returned sat
[2022-05-18 03:40:55] [INFO ] After 3669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:40:55] [INFO ] State equation strengthened by 2802 read => feed constraints.
[2022-05-18 03:41:04] [INFO ] After 9164ms SMT Verify possible using 2802 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 03:41:04] [INFO ] After 13757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4483 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4483/4483 places, 7776/7776 transitions.
Free-agglomeration rule (complex) applied 334 times.
Iterating global reduction 0 with 334 rules applied. Total rules applied 334 place count 4483 transition count 9598
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 0 with 334 rules applied. Total rules applied 668 place count 4149 transition count 9598
Applied a total of 668 rules in 1209 ms. Remains 4149 /4483 variables (removed 334) and now considering 9598/7776 (removed -1822) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4483 places, 9598/7776 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24936 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24936 steps, saw 11356 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 03:41:09] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:41:09] [INFO ] Computed 937 place invariants in 240 ms
[2022-05-18 03:41:09] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:41:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2022-05-18 03:41:10] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 233 ms returned sat
[2022-05-18 03:41:14] [INFO ] After 4115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:41:14] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2022-05-18 03:41:24] [INFO ] After 9370ms SMT Verify possible using 4958 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 03:41:24] [INFO ] After 14299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 4149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9598/9598 transitions.
Applied a total of 0 rules in 570 ms. Remains 4149 /4149 variables (removed 0) and now considering 9598/9598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4149 places, 9598/9598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9598/9598 transitions.
Applied a total of 0 rules in 566 ms. Remains 4149 /4149 variables (removed 0) and now considering 9598/9598 (removed 0) transitions.
[2022-05-18 03:41:25] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:41:25] [INFO ] Computed 937 place invariants in 223 ms
[2022-05-18 03:41:30] [INFO ] Implicit Places using invariants in 5379 ms returned []
[2022-05-18 03:41:30] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:41:30] [INFO ] Computed 937 place invariants in 215 ms
[2022-05-18 03:41:36] [INFO ] Implicit Places using invariants and state equation in 5426 ms returned []
Implicit Place search using SMT with State Equation took 10823 ms to find 0 implicit places.
[2022-05-18 03:41:37] [INFO ] Redundant transitions in 904 ms returned []
[2022-05-18 03:41:37] [INFO ] Flow matrix only has 8713 transitions (discarded 885 similar events)
// Phase 1: matrix 8713 rows 4149 cols
[2022-05-18 03:41:37] [INFO ] Computed 937 place invariants in 221 ms
[2022-05-18 03:41:42] [INFO ] Dead Transitions using invariants and state equation in 5969 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4149 places, 9598/9598 transitions.
Graph (trivial) has 3278 edges and 4149 vertex of which 25 / 4149 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 27727 edges and 4125 vertex of which 4103 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3675.t4002 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3717 transition count 7870
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3475 transition count 7389
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3234 transition count 6949
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 637 rules applied. Total rules applied 2286 place count 2994 transition count 6552
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 558 rules applied. Total rules applied 2844 place count 2795 transition count 6193
Ensure Unique test removed 35 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 519 rules applied. Total rules applied 3363 place count 2598 transition count 5871
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 2436 transition count 5583
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 2276 transition count 5329
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 2148 transition count 5105
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2022 transition count 4911
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 1924 transition count 4743
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 1828 transition count 4601
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 1756 transition count 4481
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 1686 transition count 4383
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 1636 transition count 4303
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 1588 transition count 4241
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 1556 transition count 4193
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 1526 transition count 4159
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 1508 transition count 4135
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 1492 transition count 4121
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 1484 transition count 4113
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 1478 transition count 4110
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 1475 transition count 4109
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6248 place count 1475 transition count 3859
Deduced a syphon composed of 250 places in 0 ms
Ensure Unique test removed 250 places
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 23 with 750 rules applied. Total rules applied 6998 place count 975 transition count 3859
Discarding 264 places :
Symmetric choice reduction at 23 with 264 rule applications. Total rules 7262 place count 711 transition count 3595
Iterating global reduction 23 with 264 rules applied. Total rules applied 7526 place count 711 transition count 3595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7526 place count 711 transition count 3594
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7528 place count 710 transition count 3594
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8067 place count 171 transition count 899
Iterating global reduction 23 with 539 rules applied. Total rules applied 8606 place count 171 transition count 899
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9145 place count 171 transition count 360
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 49 rules applied. Total rules applied 9194 place count 146 transition count 336
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 24 with 10 rules applied. Total rules applied 9204 place count 146 transition count 326
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 9214 place count 136 transition count 326
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9236 place count 114 transition count 216
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 9269 place count 103 transition count 216
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9291 place count 103 transition count 194
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9302 place count 92 transition count 139
Iterating global reduction 26 with 11 rules applied. Total rules applied 9313 place count 92 transition count 139
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9324 place count 81 transition count 128
Iterating global reduction 26 with 11 rules applied. Total rules applied 9335 place count 81 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 9336 place count 81 transition count 128
Applied a total of 9336 rules in 4988 ms. Remains 81 /4149 variables (removed 4068) and now considering 128/9598 (removed 9470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 81 cols
[2022-05-18 03:41:48] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-18 03:41:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 03:41:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 03:41:48] [INFO ] [Nat]Absence check using 4 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-18 03:41:48] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 03:41:48] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 03:41:48] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 03:41:48] [INFO ] Flatten gal took : 15 ms
[2022-05-18 03:41:48] [INFO ] Flatten gal took : 11 ms
[2022-05-18 03:41:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15391981043596988331.gal : 7 ms
[2022-05-18 03:41:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality854841836410551982.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2468791877557592017;'/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/ReachabilityCardinality15391981043596988331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality854841836410551982.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/ReachabilityCardinality854841836410551982.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 95
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :95 after 255
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :255 after 425
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :425 after 663
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :663 after 1302
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1302 after 2806
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2806 after 15114
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,55060,0.379451,16132,2,9640,14,28934,7,0,431,39714,0
Total reachable state count : 55060
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1498,0.380409,16132,2,774,14,28934,7,0,437,39714,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2743 reset in 1298 ms.
Product exploration explored 100000 steps with 2745 reset in 1379 ms.
Built C files in :
/tmp/ltsmin5825457946389184203
[2022-05-18 03:41:51] [INFO ] Too many transitions (7776) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:41:51] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5825457946389184203
Running compilation step : cd /tmp/ltsmin5825457946389184203;'/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/ltsmin5825457946389184203;'/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/ltsmin5825457946389184203;'/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 2 out of 4483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4483/4483 places, 7776/7776 transitions.
Applied a total of 0 rules in 675 ms. Remains 4483 /4483 variables (removed 0) and now considering 7776/7776 (removed 0) transitions.
[2022-05-18 03:41:55] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:41:55] [INFO ] Computed 937 place invariants in 186 ms
[2022-05-18 03:41:59] [INFO ] Implicit Places using invariants in 4575 ms returned []
[2022-05-18 03:41:59] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:42:00] [INFO ] Computed 937 place invariants in 183 ms
[2022-05-18 03:42:04] [INFO ] Implicit Places using invariants and state equation in 4612 ms returned []
Implicit Place search using SMT with State Equation took 9192 ms to find 0 implicit places.
[2022-05-18 03:42:05] [INFO ] Redundant transitions in 606 ms returned []
[2022-05-18 03:42:05] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2022-05-18 03:42:05] [INFO ] Computed 937 place invariants in 215 ms
[2022-05-18 03:42:09] [INFO ] Dead Transitions using invariants and state equation in 4856 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4483/4483 places, 7776/7776 transitions.
Built C files in :
/tmp/ltsmin3168391991986408123
[2022-05-18 03:42:09] [INFO ] Too many transitions (7776) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:42:10] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3168391991986408123
Running compilation step : cd /tmp/ltsmin3168391991986408123;'/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/ltsmin3168391991986408123;'/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/ltsmin3168391991986408123;'/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 03:42:13] [INFO ] Flatten gal took : 404 ms
[2022-05-18 03:42:14] [INFO ] Flatten gal took : 314 ms
[2022-05-18 03:42:14] [INFO ] Time to serialize gal into /tmp/LTL12638486863958726704.gal : 46 ms
[2022-05-18 03:42:14] [INFO ] Time to serialize properties into /tmp/LTL17501717386366384575.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/LTL12638486863958726704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17501717386366384575.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/LTL1263848...268
Read 1 LTL properties
Checking formula 0 : !((X(F(F(G("(Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=Node13HasDetectedCrashOfNode8)"))))))
Formula 0 simplified : !XFG"(Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=Node13HasDetectedCrashOfNode8)"
Detected timeout of ITS tools.
[2022-05-18 03:42:29] [INFO ] Flatten gal took : 295 ms
[2022-05-18 03:42:29] [INFO ] Applying decomposition
[2022-05-18 03:42:29] [INFO ] Flatten gal took : 296 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/graph4771247831747259785.txt' '-o' '/tmp/graph4771247831747259785.bin' '-w' '/tmp/graph4771247831747259785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4771247831747259785.bin' '-l' '-1' '-v' '-w' '/tmp/graph4771247831747259785.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:42:30] [INFO ] Decomposing Gal with order
[2022-05-18 03:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:42:32] [INFO ] Removed a total of 6634 redundant transitions.
[2022-05-18 03:42:33] [INFO ] Flatten gal took : 1795 ms
[2022-05-18 03:42:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 882 labels/synchronizations in 345 ms.
[2022-05-18 03:42:34] [INFO ] Time to serialize gal into /tmp/LTL8387291145073267383.gal : 64 ms
[2022-05-18 03:42:34] [INFO ] Time to serialize properties into /tmp/LTL6571873062616565557.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/LTL8387291145073267383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6571873062616565557.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/LTL8387291...266
Read 1 LTL properties
Checking formula 0 : !((X(F(F(G("(gu95.Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=gu95.Node13HasDetectedCrashOfNode8)"))))))
Formula 0 simplified : !XFG"(gu95.Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=gu95.Node13HasDetectedCrashOfNode8)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6931729922820258624
[2022-05-18 03:42:49] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6931729922820258624
Running compilation step : cd /tmp/ltsmin6931729922820258624;'/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/ltsmin6931729922820258624;'/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/ltsmin6931729922820258624;'/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-S24C05-LTLCardinality-00 finished in 224047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X((true U p0)))&&p1))))'
Support contains 3 out of 4849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 4818 transition count 8223
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 4818 transition count 8223
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 90 place count 4790 transition count 8131
Iterating global reduction 0 with 28 rules applied. Total rules applied 118 place count 4790 transition count 8131
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 130 place count 4778 transition count 8071
Iterating global reduction 0 with 12 rules applied. Total rules applied 142 place count 4778 transition count 8071
Applied a total of 142 rules in 2256 ms. Remains 4778 /4849 variables (removed 71) and now considering 8071/8266 (removed 195) transitions.
[2022-05-18 03:42:54] [INFO ] Flow matrix only has 7471 transitions (discarded 600 similar events)
// Phase 1: matrix 7471 rows 4778 cols
[2022-05-18 03:42:55] [INFO ] Computed 937 place invariants in 185 ms
[2022-05-18 03:42:58] [INFO ] Implicit Places using invariants in 3641 ms returned []
[2022-05-18 03:42:58] [INFO ] Flow matrix only has 7471 transitions (discarded 600 similar events)
// Phase 1: matrix 7471 rows 4778 cols
[2022-05-18 03:42:58] [INFO ] Computed 937 place invariants in 182 ms
[2022-05-18 03:43:06] [INFO ] Implicit Places using invariants and state equation in 7892 ms returned []
Implicit Place search using SMT with State Equation took 11550 ms to find 0 implicit places.
[2022-05-18 03:43:06] [INFO ] Flow matrix only has 7471 transitions (discarded 600 similar events)
// Phase 1: matrix 7471 rows 4778 cols
[2022-05-18 03:43:06] [INFO ] Computed 937 place invariants in 180 ms
[2022-05-18 03:43:11] [INFO ] Dead Transitions using invariants and state equation in 4888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4778/4849 places, 8071/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4778/4849 places, 8071/8266 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-03 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: 3}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s1976 s1569), p1:(LEQ 1 s1908)], 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 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-03 finished in 19050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((false U false)||((p0 U p1)&&p2))))))'
Support contains 5 out of 4849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4849/4849 places, 8266/8266 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 0 with 11 rules applied. Total rules applied 11 place count 4849 transition count 8255
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4838 transition count 8255
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 22 place count 4838 transition count 8001
Deduced a syphon composed of 254 places in 5 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 530 place count 4584 transition count 8001
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 546 place count 4568 transition count 7977
Iterating global reduction 2 with 16 rules applied. Total rules applied 562 place count 4568 transition count 7977
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 562 place count 4568 transition count 7975
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 566 place count 4566 transition count 7975
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 580 place count 4552 transition count 7905
Iterating global reduction 2 with 14 rules applied. Total rules applied 594 place count 4552 transition count 7905
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 658 place count 4520 transition count 7873
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 669 place count 4509 transition count 7862
Iterating global reduction 2 with 11 rules applied. Total rules applied 680 place count 4509 transition count 7862
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 680 place count 4509 transition count 7856
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 692 place count 4503 transition count 7856
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 703 place count 4492 transition count 7801
Iterating global reduction 2 with 11 rules applied. Total rules applied 714 place count 4492 transition count 7801
Applied a total of 714 rules in 3857 ms. Remains 4492 /4849 variables (removed 357) and now considering 7801/8266 (removed 465) transitions.
[2022-05-18 03:43:15] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:43:15] [INFO ] Computed 937 place invariants in 201 ms
[2022-05-18 03:43:19] [INFO ] Implicit Places using invariants in 3649 ms returned []
[2022-05-18 03:43:19] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:43:19] [INFO ] Computed 937 place invariants in 201 ms
[2022-05-18 03:43:22] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 7126 ms to find 0 implicit places.
[2022-05-18 03:43:23] [INFO ] Redundant transitions in 625 ms returned []
[2022-05-18 03:43:23] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:43:23] [INFO ] Computed 937 place invariants in 179 ms
[2022-05-18 03:43:27] [INFO ] Dead Transitions using invariants and state equation in 4303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4492/4849 places, 7801/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4492/4849 places, 7801/8266 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2651 s2094), p2:(LEQ s1840 s680), p0:(LEQ 1 s266)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2671 reset in 1226 ms.
Product exploration explored 100000 steps with 2669 reset in 1223 ms.
Computed a total of 1893 stabilizing places and 2625 stable transitions
Computed a total of 1893 stabilizing places and 2625 stable transitions
Detected a total of 1893/4492 stabilizing places and 2625/7801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p1 p2) (AND p2 p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND p1 p2) (AND p2 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 579 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 03:43:31] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:43:31] [INFO ] Computed 937 place invariants in 173 ms
[2022-05-18 03:43:32] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 03:43:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 03:43:33] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 247 ms returned sat
[2022-05-18 03:43:36] [INFO ] After 3353ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-18 03:43:36] [INFO ] State equation strengthened by 2818 read => feed constraints.
[2022-05-18 03:43:37] [INFO ] After 481ms SMT Verify possible using 2818 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-18 03:43:41] [INFO ] Deduced a trap composed of 335 places in 4328 ms of which 6 ms to minimize.
[2022-05-18 03:43:46] [INFO ] Deduced a trap composed of 258 places in 4536 ms of which 4 ms to minimize.
[2022-05-18 03:43:51] [INFO ] Deduced a trap composed of 245 places in 4271 ms of which 4 ms to minimize.
[2022-05-18 03:43:56] [INFO ] Deduced a trap composed of 350 places in 4200 ms of which 5 ms to minimize.
[2022-05-18 03:44:01] [INFO ] Deduced a trap composed of 317 places in 4269 ms of which 6 ms to minimize.
[2022-05-18 03:44:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 03:44:01] [INFO ] After 29184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4492/4492 places, 7801/7801 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4490 transition count 7795
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4490 transition count 7795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 4489 transition count 7790
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 4489 transition count 7790
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 343 place count 4489 transition count 9601
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 680 place count 4152 transition count 9601
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 705 place count 4152 transition count 9601
Applied a total of 705 rules in 2963 ms. Remains 4152 /4492 variables (removed 340) and now considering 9601/7801 (removed -1800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4152/4492 places, 9601/7801 transitions.
Incomplete random walk after 10000 steps, including 319 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 39 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2531 steps, run visited all 1 properties in 308 ms. (steps per millisecond=8 )
Probabilistic random walk after 2531 steps, saw 1254 distinct states, run finished after 309 ms. (steps per millisecond=8 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p1 p2) (AND p2 p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND p1 p2) (AND p2 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p1) p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p1 p2) (AND p0 p2)))), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2)))]
Knowledge based reduction with 16 factoid took 637 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p2) (NOT p1))]
Support contains 4 out of 4492 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 : 4492/4492 places, 7801/7801 transitions.
Applied a total of 0 rules in 657 ms. Remains 4492 /4492 variables (removed 0) and now considering 7801/7801 (removed 0) transitions.
[2022-05-18 03:44:06] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:44:06] [INFO ] Computed 937 place invariants in 188 ms
[2022-05-18 03:44:10] [INFO ] Implicit Places using invariants in 3475 ms returned []
[2022-05-18 03:44:10] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:44:10] [INFO ] Computed 937 place invariants in 179 ms
[2022-05-18 03:44:13] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 7266 ms to find 0 implicit places.
[2022-05-18 03:44:14] [INFO ] Redundant transitions in 582 ms returned []
[2022-05-18 03:44:14] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:44:14] [INFO ] Computed 937 place invariants in 201 ms
[2022-05-18 03:44:19] [INFO ] Dead Transitions using invariants and state equation in 4638 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4492/4492 places, 7801/7801 transitions.
Computed a total of 1893 stabilizing places and 2625 stable transitions
Computed a total of 1893 stabilizing places and 2625 stable transitions
Detected a total of 1893/4492 stabilizing places and 2625/7801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p2) (NOT p1))]
Finished random walk after 3816 steps, including 102 resets, run visited all 2 properties in 86 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (OR (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2673 reset in 1155 ms.
Product exploration explored 100000 steps with 2670 reset in 1207 ms.
Built C files in :
/tmp/ltsmin5939590690299915980
[2022-05-18 03:44:22] [INFO ] Too many transitions (7801) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:44:22] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5939590690299915980
Running compilation step : cd /tmp/ltsmin5939590690299915980;'/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/ltsmin5939590690299915980;'/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/ltsmin5939590690299915980;'/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 4492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4492/4492 places, 7801/7801 transitions.
Applied a total of 0 rules in 666 ms. Remains 4492 /4492 variables (removed 0) and now considering 7801/7801 (removed 0) transitions.
[2022-05-18 03:44:26] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:44:26] [INFO ] Computed 937 place invariants in 198 ms
[2022-05-18 03:44:56] [INFO ] Implicit Places using invariants in 30383 ms returned []
[2022-05-18 03:44:56] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:44:56] [INFO ] Computed 937 place invariants in 189 ms
[2022-05-18 03:45:02] [INFO ] Implicit Places using invariants and state equation in 5552 ms returned []
Implicit Place search using SMT with State Equation took 35970 ms to find 0 implicit places.
[2022-05-18 03:45:02] [INFO ] Redundant transitions in 610 ms returned []
[2022-05-18 03:45:02] [INFO ] Flow matrix only has 7201 transitions (discarded 600 similar events)
// Phase 1: matrix 7201 rows 4492 cols
[2022-05-18 03:45:03] [INFO ] Computed 937 place invariants in 181 ms
[2022-05-18 03:45:06] [INFO ] Dead Transitions using invariants and state equation in 4157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4492/4492 places, 7801/7801 transitions.
Built C files in :
/tmp/ltsmin1773857598051486139
[2022-05-18 03:45:06] [INFO ] Too many transitions (7801) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:45:07] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1773857598051486139
Running compilation step : cd /tmp/ltsmin1773857598051486139;'/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/ltsmin1773857598051486139;'/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/ltsmin1773857598051486139;'/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 03:45:10] [INFO ] Flatten gal took : 568 ms
[2022-05-18 03:45:11] [INFO ] Flatten gal took : 303 ms
[2022-05-18 03:45:11] [INFO ] Time to serialize gal into /tmp/LTL4608948584016856921.gal : 193 ms
[2022-05-18 03:45:11] [INFO ] Time to serialize properties into /tmp/LTL5052752022716698079.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/LTL4608948584016856921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5052752022716698079.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/LTL4608948...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G((("(Node0WantsToManageTheCrashOfNode17>=1)")U("(Node18HasTheLeafSetOfLx0ToReplaceNode8<=Node12HasAskedItsLeafSetToLx0ToReplac...248
Formula 0 simplified : !XFG("(Node9HasAskedItsLeafSetToLx0ToReplaceNode1<=Node2ManageTheCrashOfNode7)" & ("(Node0WantsToManageTheCrashOfNode17>=1)" U "(Nod...239
Detected timeout of ITS tools.
[2022-05-18 03:45:26] [INFO ] Flatten gal took : 276 ms
[2022-05-18 03:45:26] [INFO ] Applying decomposition
[2022-05-18 03:45:27] [INFO ] Flatten gal took : 273 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/graph4222153483130946428.txt' '-o' '/tmp/graph4222153483130946428.bin' '-w' '/tmp/graph4222153483130946428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4222153483130946428.bin' '-l' '-1' '-v' '-w' '/tmp/graph4222153483130946428.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:45:27] [INFO ] Decomposing Gal with order
[2022-05-18 03:45:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:45:29] [INFO ] Removed a total of 6404 redundant transitions.
[2022-05-18 03:45:29] [INFO ] Flatten gal took : 1277 ms
[2022-05-18 03:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 260 ms.
[2022-05-18 03:45:30] [INFO ] Time to serialize gal into /tmp/LTL10217866147786762170.gal : 35 ms
[2022-05-18 03:45:30] [INFO ] Time to serialize properties into /tmp/LTL16132612794695518922.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/LTL10217866147786762170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16132612794695518922.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/LTL1021786...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G((("(gi0.gi1.gu1.Node0WantsToManageTheCrashOfNode17>=1)")U("(gu182.Node18HasTheLeafSetOfLx0ToReplaceNode8<=gu182.Node12HasAske...282
Formula 0 simplified : !XFG("(gu63.Node9HasAskedItsLeafSetToLx0ToReplaceNode1<=gu63.Node2ManageTheCrashOfNode7)" & ("(gi0.gi1.gu1.Node0WantsToManageTheCras...273
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11468794744844777055
[2022-05-18 03:45:45] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11468794744844777055
Running compilation step : cd /tmp/ltsmin11468794744844777055;'/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/ltsmin11468794744844777055;'/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/ltsmin11468794744844777055;'/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-S24C05-LTLCardinality-07 finished in 157035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!((p0 U p1) U !X(p0)))||X(p2))))'
Support contains 5 out of 4849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4822 transition count 8227
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4822 transition count 8227
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 78 place count 4798 transition count 8147
Iterating global reduction 0 with 24 rules applied. Total rules applied 102 place count 4798 transition count 8147
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 4788 transition count 8097
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 4788 transition count 8097
Applied a total of 122 rules in 2687 ms. Remains 4788 /4849 variables (removed 61) and now considering 8097/8266 (removed 169) transitions.
[2022-05-18 03:45:51] [INFO ] Flow matrix only has 7497 transitions (discarded 600 similar events)
// Phase 1: matrix 7497 rows 4788 cols
[2022-05-18 03:45:51] [INFO ] Computed 937 place invariants in 189 ms
[2022-05-18 03:45:59] [INFO ] Implicit Places using invariants in 7907 ms returned []
[2022-05-18 03:45:59] [INFO ] Flow matrix only has 7497 transitions (discarded 600 similar events)
// Phase 1: matrix 7497 rows 4788 cols
[2022-05-18 03:45:59] [INFO ] Computed 937 place invariants in 228 ms
[2022-05-18 03:46:07] [INFO ] Implicit Places using invariants and state equation in 7890 ms returned []
Implicit Place search using SMT with State Equation took 15830 ms to find 0 implicit places.
[2022-05-18 03:46:07] [INFO ] Flow matrix only has 7497 transitions (discarded 600 similar events)
// Phase 1: matrix 7497 rows 4788 cols
[2022-05-18 03:46:07] [INFO ] Computed 937 place invariants in 200 ms
[2022-05-18 03:46:16] [INFO ] Dead Transitions using invariants and state equation in 9290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4788/4849 places, 8097/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4788/4849 places, 8097/8266 transitions.
Stuttering acceptance computed with spot in 508 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0, 1} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 5}, { cond=p1, acceptance={0, 1} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 6}]], initial=0, aps=[p1:(LEQ s1844 s2071), p0:(LEQ 1 s3504), p2:(LEQ s1744 s2799)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3639 ms.
Product exploration explored 100000 steps with 33333 reset in 3069 ms.
Computed a total of 2164 stabilizing places and 2896 stable transitions
Computed a total of 2164 stabilizing places and 2896 stable transitions
Detected a total of 2164/4788 stabilizing places and 2896/8097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 12 factoid took 283 ms. Reduced automaton from 9 states, 24 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-08 finished in 35421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((true U p0)))'
Support contains 2 out of 4849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 4820 transition count 8225
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 4820 transition count 8225
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 4794 transition count 8143
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 4794 transition count 8143
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 122 place count 4782 transition count 8083
Iterating global reduction 0 with 12 rules applied. Total rules applied 134 place count 4782 transition count 8083
Applied a total of 134 rules in 2162 ms. Remains 4782 /4849 variables (removed 67) and now considering 8083/8266 (removed 183) transitions.
[2022-05-18 03:46:26] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2022-05-18 03:46:26] [INFO ] Computed 937 place invariants in 178 ms
[2022-05-18 03:46:31] [INFO ] Implicit Places using invariants in 4932 ms returned []
[2022-05-18 03:46:31] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2022-05-18 03:46:31] [INFO ] Computed 937 place invariants in 189 ms
[2022-05-18 03:46:36] [INFO ] Implicit Places using invariants and state equation in 4842 ms returned []
Implicit Place search using SMT with State Equation took 9795 ms to find 0 implicit places.
[2022-05-18 03:46:36] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2022-05-18 03:46:36] [INFO ] Computed 937 place invariants in 177 ms
[2022-05-18 03:46:40] [INFO ] Dead Transitions using invariants and state equation in 4796 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4782/4849 places, 8083/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4782/4849 places, 8083/8266 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1472 s2334)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3396 ms.
Product exploration explored 100000 steps with 50000 reset in 3463 ms.
Computed a total of 2158 stabilizing places and 2882 stable transitions
Computed a total of 2158 stabilizing places and 2882 stable transitions
Detected a total of 2158/4782 stabilizing places and 2882/8083 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-09 finished in 23830 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(p1))))))'
Support contains 6 out of 4849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4822 transition count 8227
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4822 transition count 8227
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 78 place count 4798 transition count 8155
Iterating global reduction 0 with 24 rules applied. Total rules applied 102 place count 4798 transition count 8155
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 114 place count 4786 transition count 8095
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 4786 transition count 8095
Applied a total of 126 rules in 2235 ms. Remains 4786 /4849 variables (removed 63) and now considering 8095/8266 (removed 171) transitions.
[2022-05-18 03:46:50] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:46:50] [INFO ] Computed 937 place invariants in 180 ms
[2022-05-18 03:46:55] [INFO ] Implicit Places using invariants in 5214 ms returned []
[2022-05-18 03:46:55] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:46:55] [INFO ] Computed 937 place invariants in 173 ms
[2022-05-18 03:47:00] [INFO ] Implicit Places using invariants and state equation in 5113 ms returned []
Implicit Place search using SMT with State Equation took 10348 ms to find 0 implicit places.
[2022-05-18 03:47:00] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:47:00] [INFO ] Computed 937 place invariants in 187 ms
[2022-05-18 03:47:05] [INFO ] Dead Transitions using invariants and state equation in 5029 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4786/4849 places, 8095/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4786/4849 places, 8095/8266 transitions.
Stuttering acceptance computed with spot in 490 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=p0, acceptance={} source=10 dest: 6}, { cond=(NOT p0), acceptance={} source=10 dest: 7}]], initial=10, aps=[p1:(LEQ s459 s1030), p0:(OR (GT s3820 s4430) (GT s1959 s1565))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 2367 ms.
Product exploration explored 100000 steps with 20000 reset in 2406 ms.
Computed a total of 2162 stabilizing places and 2894 stable transitions
Computed a total of 2162 stabilizing places and 2894 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 11 states, 17 edges and 2 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 2578 steps, including 50 resets, run visited all 1 properties in 33 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 4786 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4786/4786 places, 8095/8095 transitions.
Applied a total of 0 rules in 535 ms. Remains 4786 /4786 variables (removed 0) and now considering 8095/8095 (removed 0) transitions.
[2022-05-18 03:47:12] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:47:12] [INFO ] Computed 937 place invariants in 175 ms
[2022-05-18 03:47:17] [INFO ] Implicit Places using invariants in 5085 ms returned []
[2022-05-18 03:47:17] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:47:17] [INFO ] Computed 937 place invariants in 171 ms
[2022-05-18 03:47:22] [INFO ] Implicit Places using invariants and state equation in 5067 ms returned []
Implicit Place search using SMT with State Equation took 10165 ms to find 0 implicit places.
[2022-05-18 03:47:22] [INFO ] Flow matrix only has 7495 transitions (discarded 600 similar events)
// Phase 1: matrix 7495 rows 4786 cols
[2022-05-18 03:47:22] [INFO ] Computed 937 place invariants in 175 ms
[2022-05-18 03:47:27] [INFO ] Dead Transitions using invariants and state equation in 4935 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4786/4786 places, 8095/8095 transitions.
Computed a total of 2162 stabilizing places and 2894 stable transitions
Computed a total of 2162 stabilizing places and 2894 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Finished Best-First random walk after 3381 steps, including 12 resets, run visited all 1 properties in 10 ms. (steps per millisecond=338 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 2359 ms.
Product exploration explored 100000 steps with 20000 reset in 2403 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 4786 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4786/4786 places, 8095/8095 transitions.
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 260 Pre rules applied. Total rules applied 0 place count 4786 transition count 8099
Deduced a syphon composed of 260 places in 5 ms
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 4786 transition count 8099
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 263 place count 4783 transition count 8093
Deduced a syphon composed of 260 places in 5 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 266 place count 4783 transition count 8093
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 269 place count 4780 transition count 8078
Deduced a syphon composed of 260 places in 5 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 272 place count 4780 transition count 8078
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 285 places in 5 ms
Iterating global reduction 0 with 25 rules applied. Total rules applied 297 place count 4780 transition count 8078
Deduced a syphon composed of 285 places in 4 ms
Applied a total of 297 rules in 2207 ms. Remains 4780 /4786 variables (removed 6) and now considering 8078/8095 (removed 17) transitions.
[2022-05-18 03:47:36] [INFO ] Redundant transitions in 674 ms returned []
[2022-05-18 03:47:36] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4780 cols
[2022-05-18 03:47:36] [INFO ] Computed 937 place invariants in 199 ms
[2022-05-18 03:47:41] [INFO ] Dead Transitions using invariants and state equation in 4742 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4780/4786 places, 8078/8095 transitions.
Finished structural reductions, in 1 iterations. Remains : 4780/4786 places, 8078/8095 transitions.
Product exploration timeout after 77120 steps with 15424 reset in 10001 ms.
Product exploration timeout after 77520 steps with 15504 reset in 10001 ms.
Built C files in :
/tmp/ltsmin15571013864123613910
[2022-05-18 03:48:01] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15571013864123613910
Running compilation step : cd /tmp/ltsmin15571013864123613910;'/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/ltsmin15571013864123613910;'/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/ltsmin15571013864123613910;'/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 2 out of 4786 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4786/4786 places, 8095/8095 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4783 transition count 8092
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4783 transition count 8092
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4780 transition count 8077
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4780 transition count 8077
Applied a total of 12 rules in 944 ms. Remains 4780 /4786 variables (removed 6) and now considering 8077/8095 (removed 18) transitions.
[2022-05-18 03:48:05] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:48:05] [INFO ] Computed 937 place invariants in 181 ms
[2022-05-18 03:48:09] [INFO ] Implicit Places using invariants in 3931 ms returned []
[2022-05-18 03:48:09] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:48:09] [INFO ] Computed 937 place invariants in 175 ms
[2022-05-18 03:48:13] [INFO ] Implicit Places using invariants and state equation in 3676 ms returned []
Implicit Place search using SMT with State Equation took 7611 ms to find 0 implicit places.
[2022-05-18 03:48:13] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:48:13] [INFO ] Computed 937 place invariants in 186 ms
[2022-05-18 03:48:18] [INFO ] Dead Transitions using invariants and state equation in 5027 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4780/4786 places, 8077/8095 transitions.
Finished structural reductions, in 1 iterations. Remains : 4780/4786 places, 8077/8095 transitions.
Built C files in :
/tmp/ltsmin17425311012145780624
[2022-05-18 03:48:18] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17425311012145780624
Running compilation step : cd /tmp/ltsmin17425311012145780624;'/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/ltsmin17425311012145780624;'/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/ltsmin17425311012145780624;'/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 03:48:21] [INFO ] Flatten gal took : 286 ms
[2022-05-18 03:48:21] [INFO ] Flatten gal took : 297 ms
[2022-05-18 03:48:21] [INFO ] Time to serialize gal into /tmp/LTL5749986131751511820.gal : 29 ms
[2022-05-18 03:48:21] [INFO ] Time to serialize properties into /tmp/LTL1035790829630160641.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/LTL5749986131751511820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1035790829630160641.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/LTL5749986...266
Read 1 LTL properties
Checking formula 0 : !(((G("((Node22HasAskedItsLeafSetToRx1ToReplaceNode21>Node24ThinksNode21ShouldBeNodeMasterToReplaceNode17)||(Node9HasAskedItsLeafSetTo...335
Formula 0 simplified : !(G"((Node22HasAskedItsLeafSetToRx1ToReplaceNode21>Node24ThinksNode21ShouldBeNodeMasterToReplaceNode17)||(Node9HasAskedItsLeafSetToL...322
Detected timeout of ITS tools.
[2022-05-18 03:48:37] [INFO ] Flatten gal took : 299 ms
[2022-05-18 03:48:37] [INFO ] Applying decomposition
[2022-05-18 03:48:37] [INFO ] Flatten gal took : 309 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/graph10884092258734561989.txt' '-o' '/tmp/graph10884092258734561989.bin' '-w' '/tmp/graph10884092258734561989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10884092258734561989.bin' '-l' '-1' '-v' '-w' '/tmp/graph10884092258734561989.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:48:38] [INFO ] Decomposing Gal with order
[2022-05-18 03:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:48:39] [INFO ] Removed a total of 6334 redundant transitions.
[2022-05-18 03:48:39] [INFO ] Flatten gal took : 857 ms
[2022-05-18 03:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 237 labels/synchronizations in 84 ms.
[2022-05-18 03:48:40] [INFO ] Time to serialize gal into /tmp/LTL1612082647879891170.gal : 37 ms
[2022-05-18 03:48:40] [INFO ] Time to serialize properties into /tmp/LTL8516471734156149958.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/LTL1612082647879891170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8516471734156149958.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/LTL1612082...266
Read 1 LTL properties
Checking formula 0 : !(((G("((gu487.Node22HasAskedItsLeafSetToRx1ToReplaceNode21>gu487.Node24ThinksNode21ShouldBeNodeMasterToReplaceNode17)||(gu276.Node9Ha...369
Formula 0 simplified : !(G"((gu487.Node22HasAskedItsLeafSetToRx1ToReplaceNode21>gu487.Node24ThinksNode21ShouldBeNodeMasterToReplaceNode17)||(gu276.Node9Has...356
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4284490987078029538
[2022-05-18 03:48:55] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4284490987078029538
Running compilation step : cd /tmp/ltsmin4284490987078029538;'/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/ltsmin4284490987078029538;'/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/ltsmin4284490987078029538;'/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-S24C05-LTLCardinality-10 finished in 131022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 4849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 4849 transition count 8254
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 4837 transition count 8254
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 24 place count 4837 transition count 8000
Deduced a syphon composed of 254 places in 5 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 532 place count 4583 transition count 8000
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 550 place count 4565 transition count 7970
Iterating global reduction 2 with 18 rules applied. Total rules applied 568 place count 4565 transition count 7970
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 568 place count 4565 transition count 7969
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 570 place count 4564 transition count 7969
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 585 place count 4549 transition count 7894
Iterating global reduction 2 with 15 rules applied. Total rules applied 600 place count 4549 transition count 7894
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 664 place count 4517 transition count 7862
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 676 place count 4505 transition count 7850
Iterating global reduction 2 with 12 rules applied. Total rules applied 688 place count 4505 transition count 7850
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 688 place count 4505 transition count 7843
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 702 place count 4498 transition count 7843
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 714 place count 4486 transition count 7783
Iterating global reduction 2 with 12 rules applied. Total rules applied 726 place count 4486 transition count 7783
Applied a total of 726 rules in 2670 ms. Remains 4486 /4849 variables (removed 363) and now considering 7783/8266 (removed 483) transitions.
[2022-05-18 03:49:01] [INFO ] Flow matrix only has 7183 transitions (discarded 600 similar events)
// Phase 1: matrix 7183 rows 4486 cols
[2022-05-18 03:49:01] [INFO ] Computed 937 place invariants in 191 ms
[2022-05-18 03:49:05] [INFO ] Implicit Places using invariants in 3618 ms returned []
[2022-05-18 03:49:05] [INFO ] Flow matrix only has 7183 transitions (discarded 600 similar events)
// Phase 1: matrix 7183 rows 4486 cols
[2022-05-18 03:49:05] [INFO ] Computed 937 place invariants in 179 ms
[2022-05-18 03:49:08] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 7183 ms to find 0 implicit places.
[2022-05-18 03:49:09] [INFO ] Redundant transitions in 707 ms returned []
[2022-05-18 03:49:09] [INFO ] Flow matrix only has 7183 transitions (discarded 600 similar events)
// Phase 1: matrix 7183 rows 4486 cols
[2022-05-18 03:49:09] [INFO ] Computed 937 place invariants in 189 ms
[2022-05-18 03:49:15] [INFO ] Dead Transitions using invariants and state equation in 5493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4486/4849 places, 7783/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4486/4849 places, 7783/8266 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s776)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-11 finished in 16193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(true U p0)))'
Support contains 2 out of 4849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 4819 transition count 8224
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 4819 transition count 8224
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 87 place count 4792 transition count 8137
Iterating global reduction 0 with 27 rules applied. Total rules applied 114 place count 4792 transition count 8137
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 126 place count 4780 transition count 8077
Iterating global reduction 0 with 12 rules applied. Total rules applied 138 place count 4780 transition count 8077
Applied a total of 138 rules in 1356 ms. Remains 4780 /4849 variables (removed 69) and now considering 8077/8266 (removed 189) transitions.
[2022-05-18 03:49:16] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:49:16] [INFO ] Computed 937 place invariants in 181 ms
[2022-05-18 03:49:20] [INFO ] Implicit Places using invariants in 3738 ms returned []
[2022-05-18 03:49:20] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:49:20] [INFO ] Computed 937 place invariants in 170 ms
[2022-05-18 03:49:24] [INFO ] Implicit Places using invariants and state equation in 3658 ms returned []
Implicit Place search using SMT with State Equation took 7399 ms to find 0 implicit places.
[2022-05-18 03:49:24] [INFO ] Flow matrix only has 7477 transitions (discarded 600 similar events)
// Phase 1: matrix 7477 rows 4780 cols
[2022-05-18 03:49:24] [INFO ] Computed 937 place invariants in 188 ms
[2022-05-18 03:49:28] [INFO ] Dead Transitions using invariants and state equation in 4962 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4780/4849 places, 8077/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4780/4849 places, 8077/8266 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s2600 s4424)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5131 steps with 98 reset in 78 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-13 finished in 13957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!((X(p0)||p0)&&!p0) U p1))'
Support contains 4 out of 4849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4849/4849 places, 8266/8266 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 4849 transition count 8256
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 4839 transition count 8256
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 20 place count 4839 transition count 8002
Deduced a syphon composed of 254 places in 5 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 528 place count 4585 transition count 8002
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 547 place count 4566 transition count 7971
Iterating global reduction 2 with 19 rules applied. Total rules applied 566 place count 4566 transition count 7971
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 566 place count 4566 transition count 7969
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 570 place count 4564 transition count 7969
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 586 place count 4548 transition count 7889
Iterating global reduction 2 with 16 rules applied. Total rules applied 602 place count 4548 transition count 7889
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 666 place count 4516 transition count 7857
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 676 place count 4506 transition count 7847
Iterating global reduction 2 with 10 rules applied. Total rules applied 686 place count 4506 transition count 7847
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 686 place count 4506 transition count 7842
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 696 place count 4501 transition count 7842
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 706 place count 4491 transition count 7792
Iterating global reduction 2 with 10 rules applied. Total rules applied 716 place count 4491 transition count 7792
Applied a total of 716 rules in 2472 ms. Remains 4491 /4849 variables (removed 358) and now considering 7792/8266 (removed 474) transitions.
[2022-05-18 03:49:31] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
// Phase 1: matrix 7192 rows 4491 cols
[2022-05-18 03:49:31] [INFO ] Computed 937 place invariants in 216 ms
[2022-05-18 03:49:35] [INFO ] Implicit Places using invariants in 3604 ms returned []
[2022-05-18 03:49:35] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
// Phase 1: matrix 7192 rows 4491 cols
[2022-05-18 03:49:35] [INFO ] Computed 937 place invariants in 184 ms
[2022-05-18 03:49:38] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 7174 ms to find 0 implicit places.
[2022-05-18 03:49:39] [INFO ] Redundant transitions in 611 ms returned []
[2022-05-18 03:49:39] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
// Phase 1: matrix 7192 rows 4491 cols
[2022-05-18 03:49:39] [INFO ] Computed 937 place invariants in 196 ms
[2022-05-18 03:49:43] [INFO ] Dead Transitions using invariants and state equation in 4480 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4491/4849 places, 7792/8266 transitions.
Finished structural reductions, in 1 iterations. Remains : 4491/4849 places, 7792/8266 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LEQ 1 s721) (LEQ 1 s4198)), p0:(LEQ s1743 s2466)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1238 steps with 32 reset in 21 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-15 finished in 14901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((false U false)||((p0 U p1)&&p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(p1))))))'
[2022-05-18 03:49:44] [INFO ] Flatten gal took : 289 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10121563577238274913
[2022-05-18 03:49:44] [INFO ] Too many transitions (8266) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:49:44] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10121563577238274913
Running compilation step : cd /tmp/ltsmin10121563577238274913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 03:49:44] [INFO ] Applying decomposition
[2022-05-18 03:49:45] [INFO ] Flatten gal took : 277 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/graph11962571087775165754.txt' '-o' '/tmp/graph11962571087775165754.bin' '-w' '/tmp/graph11962571087775165754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11962571087775165754.bin' '-l' '-1' '-v' '-w' '/tmp/graph11962571087775165754.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:49:45] [INFO ] Decomposing Gal with order
[2022-05-18 03:49:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:49:47] [INFO ] Removed a total of 7019 redundant transitions.
[2022-05-18 03:49:47] [INFO ] Flatten gal took : 819 ms
[2022-05-18 03:49:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 80 ms.
[2022-05-18 03:49:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality1897747505639905923.gal : 34 ms
[2022-05-18 03:49:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality6501625592748814668.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/LTLCardinality1897747505639905923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6501625592748814668.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/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((X(F(F(G("(gu177.Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=gu177.Node13HasDetectedCrashOfNode8)"))))))
Formula 0 simplified : !XFG"(gu177.Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=gu177.Node13HasDetectedCrashOfNode8)"
Compilation finished in 41437 ms.
Running link step : cd /tmp/ltsmin10121563577238274913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin10121563577238274913;'/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)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10121563577238274913;'/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)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10121563577238274913;'/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(<>([](((false U false)||(((LTLAPp1==true) U (LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 04:14:09] [INFO ] Flatten gal took : 711 ms
[2022-05-18 04:14:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality1173231480931456691.gal : 100 ms
[2022-05-18 04:14:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality8744343155228062316.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/LTLCardinality1173231480931456691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8744343155228062316.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/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((X(F(F(G("(Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=Node13HasDetectedCrashOfNode8)"))))))
Formula 0 simplified : !XFG"(Node3ThinksNode18ShouldBeNodeMasterToReplaceNode6<=Node13HasDetectedCrashOfNode8)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10121563577238274913;'/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(<>([](((false U false)||(((LTLAPp1==true) U (LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10121563577238274913;'/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' '([]((LTLAPp4==true))||X(X(X(X((LTLAPp5==true))))))' '--buchi-type=spotba'
LTSmin run took 6220 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin10121563577238274913;'/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)))))' '--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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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-S24C05"
export BK_EXAMINATION="LTLCardinality"
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-S24C05, examination is LTLCardinality"
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-165271821300731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C05.tgz
mv MultiCrashLeafsetExtension-PT-S24C05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;