About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15195.848 | 2328286.00 | 6135956.00 | 26308.50 | FFFFFFTFFTFFTTFF | 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-165271821200676.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-S16C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 11K Apr 29 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 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 4.6M 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-S16C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652828111511
Running Version 202205111006
[2022-05-17 22:55:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 22:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:55:14] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2022-05-17 22:55:14] [INFO ] Transformed 4914 places.
[2022-05-17 22:55:14] [INFO ] Transformed 6913 transitions.
[2022-05-17 22:55:14] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1342 places :
Symmetric choice reduction at 1 with 1342 rule applications. Total rules 1372 place count 3542 transition count 5571
Iterating global reduction 1 with 1342 rules applied. Total rules applied 2714 place count 3542 transition count 5571
Discarding 1170 places :
Symmetric choice reduction at 1 with 1170 rule applications. Total rules 3884 place count 2372 transition count 4401
Iterating global reduction 1 with 1170 rules applied. Total rules applied 5054 place count 2372 transition count 4401
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 5264 place count 2162 transition count 3351
Iterating global reduction 1 with 210 rules applied. Total rules applied 5474 place count 2162 transition count 3351
Applied a total of 5474 rules in 1069 ms. Remains 2162 /4914 variables (removed 2752) and now considering 3351/6913 (removed 3562) transitions.
[2022-05-17 22:55:15] [INFO ] Flow matrix only has 3079 transitions (discarded 272 similar events)
// Phase 1: matrix 3079 rows 2162 cols
[2022-05-17 22:55:16] [INFO ] Computed 505 place invariants in 181 ms
[2022-05-17 22:55:17] [INFO ] Implicit Places using invariants in 2156 ms returned [4, 8, 12, 16, 18, 20, 22, 27, 37, 46, 57, 70, 85, 101, 117, 119, 121, 125, 127, 140, 151, 160, 169, 174, 177, 200, 207, 210, 211, 212, 213, 214, 215, 218, 223, 230, 239, 250, 263, 277, 291, 293, 294, 295, 296, 307, 316, 323, 328, 331, 335, 358, 365, 368, 369, 370, 371, 372, 373, 375, 378, 383, 399, 410, 422, 435, 436, 438, 439, 450, 457, 462, 465, 469, 471, 494, 501, 504, 505, 507, 508, 509, 511, 513, 516, 521, 531, 540, 550, 560, 561, 562, 563, 564, 565, 572, 577, 580, 582, 584, 586, 609, 616, 619, 620, 621, 623, 624, 629, 631, 633, 636, 641, 648, 656, 666, 667, 668, 669, 674, 677, 681, 683, 686, 688, 714, 721, 724, 725, 729, 730, 734, 736, 738, 740, 743, 748, 756, 762, 763, 764, 765, 766, 767, 770, 772, 774, 776, 778, 780, 803, 810, 813, 814, 815, 816, 817, 818, 820, 822, 824, 826, 828, 831, 835, 839, 840, 841, 843, 844, 846, 848, 850, 852, 856, 858, 888, 891, 892, 893, 894, 895, 896, 898, 901, 903, 905, 907, 909, 911, 914, 915, 916, 917, 919, 921, 923, 925, 927, 931, 933, 956, 958, 962, 965, 966, 967, 968, 970, 972, 974, 976, 978, 983, 985, 987, 990, 991, 992, 993, 994, 995, 997, 999, 1001, 1003, 1005, 1007, 1030, 1037, 1040, 1041, 1042, 1043, 1045, 1049, 1051, 1053, 1056, 1058, 1060, 1062, 1065, 1066, 1067, 1068, 1070, 1072, 1074, 1076, 1078, 1083, 1085, 1108, 1115, 1118, 1119, 1120, 1121, 1122, 1123, 1125, 1127, 1129, 1131, 1133, 1135, 1138, 1143, 1144, 1145, 1146, 1147, 1148, 1151, 1153, 1155, 1157, 1159, 1161, 1184, 1191, 1195, 1196, 1197, 1198, 1199, 1202, 1204, 1208, 1210, 1212, 1215, 1220, 1227, 1228, 1229, 1230, 1231, 1232, 1237, 1240, 1242, 1244, 1246, 1248, 1271, 1278, 1281, 1282, 1284, 1285, 1286, 1288, 1290, 1294, 1296, 1299, 1304, 1311, 1320, 1321, 1322, 1323, 1324, 1325, 1333, 1338, 1342, 1344, 1346, 1348, 1371, 1378, 1382, 1383, 1384, 1385, 1386, 1388, 1390, 1392, 1395, 1400, 1410, 1420, 1432, 1433, 1434, 1435, 1436, 1445, 1452, 1457, 1460, 1462, 1464, 1496, 1499, 1500, 1501, 1502, 1503, 1504, 1506, 1508, 1511, 1516, 1532, 1543, 1556, 1557, 1558, 1559, 1560, 1561, 1572, 1581, 1588, 1593, 1596, 1598, 1621, 1628, 1631, 1632, 1633, 1634, 1635, 1636, 1638, 1641, 1646, 1653, 1663, 1674, 1687, 1702, 1703, 1704, 1705, 1706, 1707, 1720, 1731, 1740, 1747, 1752, 1755, 1778, 1780, 1784, 1787, 1788, 1789, 1790, 1791, 1792, 1795, 1800, 1807, 1816, 1827, 1840, 1855, 1872, 1873, 1874, 1875, 1876, 1877, 1892, 1905, 1916, 1932, 1937, 1961]
Discarding 437 places :
Implicit Place search using SMT only with invariants took 2222 ms to find 437 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1725/4914 places, 3351/6913 transitions.
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 140 place count 1585 transition count 3211
Iterating global reduction 0 with 140 rules applied. Total rules applied 280 place count 1585 transition count 3211
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 420 place count 1445 transition count 3071
Iterating global reduction 0 with 140 rules applied. Total rules applied 560 place count 1445 transition count 3071
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 700 place count 1305 transition count 2931
Iterating global reduction 0 with 140 rules applied. Total rules applied 840 place count 1305 transition count 2931
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 855 place count 1290 transition count 2856
Iterating global reduction 0 with 15 rules applied. Total rules applied 870 place count 1290 transition count 2856
Applied a total of 870 rules in 667 ms. Remains 1290 /1725 variables (removed 435) and now considering 2856/3351 (removed 495) transitions.
[2022-05-17 22:55:18] [INFO ] Flow matrix only has 2584 transitions (discarded 272 similar events)
// Phase 1: matrix 2584 rows 1290 cols
[2022-05-17 22:55:18] [INFO ] Computed 68 place invariants in 37 ms
[2022-05-17 22:55:19] [INFO ] Implicit Places using invariants in 1148 ms returned [313]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1289/4914 places, 2856/6913 transitions.
Applied a total of 0 rules in 40 ms. Remains 1289 /1289 variables (removed 0) and now considering 2856/2856 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1289/4914 places, 2856/6913 transitions.
Support contains 64 out of 1289 places after structural reductions.
[2022-05-17 22:55:20] [INFO ] Flatten gal took : 210 ms
[2022-05-17 22:55:20] [INFO ] Flatten gal took : 183 ms
[2022-05-17 22:55:20] [INFO ] Input system was already deterministic with 2856 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 34) seen :14
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-05-17 22:55:21] [INFO ] Flow matrix only has 2584 transitions (discarded 272 similar events)
// Phase 1: matrix 2584 rows 1289 cols
[2022-05-17 22:55:21] [INFO ] Computed 67 place invariants in 30 ms
[2022-05-17 22:55:22] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2022-05-17 22:55:22] [INFO ] [Real]Absence check using 31 positive and 36 generalized place invariants in 21 ms returned sat
[2022-05-17 22:55:22] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:11
[2022-05-17 22:55:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2022-05-17 22:55:22] [INFO ] [Nat]Absence check using 31 positive and 36 generalized place invariants in 26 ms returned sat
[2022-05-17 22:55:25] [INFO ] After 1941ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2022-05-17 22:55:25] [INFO ] State equation strengthened by 1006 read => feed constraints.
[2022-05-17 22:55:27] [INFO ] After 1977ms SMT Verify possible using 1006 Read/Feed constraints in natural domain returned unsat :4 sat :11
[2022-05-17 22:55:28] [INFO ] Deduced a trap composed of 256 places in 577 ms of which 6 ms to minimize.
[2022-05-17 22:55:28] [INFO ] Deduced a trap composed of 311 places in 541 ms of which 1 ms to minimize.
[2022-05-17 22:55:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1351 ms
[2022-05-17 22:55:29] [INFO ] Deduced a trap composed of 233 places in 576 ms of which 2 ms to minimize.
[2022-05-17 22:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 823 ms
[2022-05-17 22:55:30] [INFO ] Deduced a trap composed of 155 places in 555 ms of which 3 ms to minimize.
[2022-05-17 22:55:31] [INFO ] Deduced a trap composed of 130 places in 573 ms of which 2 ms to minimize.
[2022-05-17 22:55:31] [INFO ] Deduced a trap composed of 232 places in 527 ms of which 1 ms to minimize.
[2022-05-17 22:55:32] [INFO ] Deduced a trap composed of 230 places in 502 ms of which 1 ms to minimize.
[2022-05-17 22:55:32] [INFO ] Deduced a trap composed of 218 places in 514 ms of which 1 ms to minimize.
[2022-05-17 22:55:33] [INFO ] Deduced a trap composed of 246 places in 495 ms of which 1 ms to minimize.
[2022-05-17 22:55:34] [INFO ] Deduced a trap composed of 224 places in 485 ms of which 2 ms to minimize.
[2022-05-17 22:55:34] [INFO ] Deduced a trap composed of 214 places in 482 ms of which 1 ms to minimize.
[2022-05-17 22:55:35] [INFO ] Deduced a trap composed of 216 places in 481 ms of which 2 ms to minimize.
[2022-05-17 22:55:35] [INFO ] Deduced a trap composed of 219 places in 500 ms of which 1 ms to minimize.
[2022-05-17 22:55:36] [INFO ] Deduced a trap composed of 236 places in 489 ms of which 1 ms to minimize.
[2022-05-17 22:55:37] [INFO ] Deduced a trap composed of 234 places in 492 ms of which 1 ms to minimize.
[2022-05-17 22:55:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7591 ms
[2022-05-17 22:55:38] [INFO ] Deduced a trap composed of 315 places in 552 ms of which 2 ms to minimize.
[2022-05-17 22:55:38] [INFO ] Deduced a trap composed of 204 places in 534 ms of which 1 ms to minimize.
[2022-05-17 22:55:39] [INFO ] Deduced a trap composed of 204 places in 559 ms of which 1 ms to minimize.
[2022-05-17 22:55:40] [INFO ] Deduced a trap composed of 210 places in 553 ms of which 1 ms to minimize.
[2022-05-17 22:55:40] [INFO ] Deduced a trap composed of 210 places in 576 ms of which 1 ms to minimize.
[2022-05-17 22:55:41] [INFO ] Deduced a trap composed of 203 places in 533 ms of which 2 ms to minimize.
[2022-05-17 22:55:42] [INFO ] Deduced a trap composed of 204 places in 551 ms of which 1 ms to minimize.
[2022-05-17 22:55:42] [INFO ] Deduced a trap composed of 213 places in 549 ms of which 1 ms to minimize.
[2022-05-17 22:55:43] [INFO ] Deduced a trap composed of 205 places in 552 ms of which 1 ms to minimize.
[2022-05-17 22:55:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5728 ms
[2022-05-17 22:55:44] [INFO ] Deduced a trap composed of 344 places in 546 ms of which 1 ms to minimize.
[2022-05-17 22:55:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 716 ms
[2022-05-17 22:55:45] [INFO ] Deduced a trap composed of 306 places in 538 ms of which 1 ms to minimize.
[2022-05-17 22:55:45] [INFO ] Deduced a trap composed of 186 places in 536 ms of which 1 ms to minimize.
[2022-05-17 22:55:46] [INFO ] Deduced a trap composed of 194 places in 552 ms of which 1 ms to minimize.
[2022-05-17 22:55:47] [INFO ] Deduced a trap composed of 192 places in 588 ms of which 1 ms to minimize.
[2022-05-17 22:55:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2579 ms
[2022-05-17 22:55:47] [INFO ] After 22410ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 22:55:47] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :11
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 18 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1289 transition count 2839
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 1272 transition count 2839
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 34 place count 1272 transition count 2817
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 78 place count 1250 transition count 2817
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 1234 transition count 2781
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 1234 transition count 2781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 110 place count 1234 transition count 2780
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 1233 transition count 2780
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 123 place count 1222 transition count 2725
Iterating global reduction 2 with 11 rules applied. Total rules applied 134 place count 1222 transition count 2725
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 196 place count 1191 transition count 2694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 202 place count 1185 transition count 2688
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 1185 transition count 2688
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 1179 transition count 2658
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 1179 transition count 2658
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 2 with 137 rules applied. Total rules applied 357 place count 1179 transition count 3261
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 2 with 137 rules applied. Total rules applied 494 place count 1042 transition count 3261
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 511 place count 1042 transition count 3261
Applied a total of 511 rules in 839 ms. Remains 1042 /1289 variables (removed 247) and now considering 3261/2856 (removed -405) transitions.
Finished structural reductions, in 1 iterations. Remains : 1042/1289 places, 3261/2856 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-17 22:55:49] [INFO ] Flow matrix only has 2876 transitions (discarded 385 similar events)
// Phase 1: matrix 2876 rows 1042 cols
[2022-05-17 22:55:49] [INFO ] Computed 67 place invariants in 28 ms
[2022-05-17 22:55:49] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-17 22:55:49] [INFO ] [Real]Absence check using 33 positive and 34 generalized place invariants in 6 ms returned sat
[2022-05-17 22:55:50] [INFO ] After 1304ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2022-05-17 22:55:51] [INFO ] State equation strengthened by 1658 read => feed constraints.
[2022-05-17 22:55:51] [INFO ] After 407ms SMT Verify possible using 1658 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-17 22:55:51] [INFO ] After 2113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-17 22:55:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2022-05-17 22:55:51] [INFO ] [Nat]Absence check using 33 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-17 22:55:53] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-17 22:55:55] [INFO ] After 2042ms SMT Verify possible using 1658 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-17 22:55:55] [INFO ] Deduced a trap composed of 121 places in 469 ms of which 1 ms to minimize.
[2022-05-17 22:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 639 ms
[2022-05-17 22:55:56] [INFO ] Deduced a trap composed of 143 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2022-05-17 22:55:57] [INFO ] Deduced a trap composed of 83 places in 500 ms of which 1 ms to minimize.
[2022-05-17 22:55:58] [INFO ] Deduced a trap composed of 178 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:55:59] [INFO ] Deduced a trap composed of 179 places in 411 ms of which 2 ms to minimize.
[2022-05-17 22:56:00] [INFO ] Deduced a trap composed of 79 places in 486 ms of which 2 ms to minimize.
[2022-05-17 22:56:00] [INFO ] Deduced a trap composed of 174 places in 490 ms of which 1 ms to minimize.
[2022-05-17 22:56:01] [INFO ] Deduced a trap composed of 72 places in 492 ms of which 1 ms to minimize.
[2022-05-17 22:56:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4743 ms
[2022-05-17 22:56:02] [INFO ] Deduced a trap composed of 260 places in 443 ms of which 1 ms to minimize.
[2022-05-17 22:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 879 ms
[2022-05-17 22:56:04] [INFO ] After 11078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1618 ms.
[2022-05-17 22:56:05] [INFO ] After 14423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 10 ms.
Support contains 12 out of 1042 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1042/1042 places, 3261/3261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1041 transition count 3256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1041 transition count 3256
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1041 transition count 3254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 1039 transition count 3254
Applied a total of 6 rules in 241 ms. Remains 1039 /1042 variables (removed 3) and now considering 3254/3261 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1039/1042 places, 3254/3261 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-17 22:56:06] [INFO ] Flow matrix only has 2868 transitions (discarded 386 similar events)
// Phase 1: matrix 2868 rows 1039 cols
[2022-05-17 22:56:06] [INFO ] Computed 67 place invariants in 31 ms
[2022-05-17 22:56:07] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-17 22:56:07] [INFO ] [Real]Absence check using 33 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-17 22:56:08] [INFO ] After 1128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2022-05-17 22:56:08] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2022-05-17 22:56:08] [INFO ] After 285ms SMT Verify possible using 1654 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 22:56:08] [INFO ] After 1765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 22:56:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-05-17 22:56:08] [INFO ] [Nat]Absence check using 33 positive and 34 generalized place invariants in 6 ms returned sat
[2022-05-17 22:56:10] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 22:56:11] [INFO ] After 1337ms SMT Verify possible using 1654 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 22:56:12] [INFO ] Deduced a trap composed of 163 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:56:12] [INFO ] Deduced a trap composed of 162 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:56:13] [INFO ] Deduced a trap composed of 138 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:56:14] [INFO ] Deduced a trap composed of 149 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:56:14] [INFO ] Deduced a trap composed of 134 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:56:15] [INFO ] Deduced a trap composed of 146 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:56:15] [INFO ] Deduced a trap composed of 149 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:56:16] [INFO ] Deduced a trap composed of 161 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:56:16] [INFO ] Deduced a trap composed of 133 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:56:17] [INFO ] Deduced a trap composed of 163 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:56:17] [INFO ] Deduced a trap composed of 152 places in 397 ms of which 0 ms to minimize.
[2022-05-17 22:56:18] [INFO ] Deduced a trap composed of 150 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:56:20] [INFO ] Deduced a trap composed of 192 places in 438 ms of which 1 ms to minimize.
[2022-05-17 22:56:21] [INFO ] Deduced a trap composed of 164 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:56:21] [INFO ] Deduced a trap composed of 141 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:56:22] [INFO ] Deduced a trap composed of 157 places in 414 ms of which 0 ms to minimize.
[2022-05-17 22:56:22] [INFO ] Deduced a trap composed of 163 places in 417 ms of which 0 ms to minimize.
[2022-05-17 22:56:23] [INFO ] Deduced a trap composed of 152 places in 409 ms of which 5 ms to minimize.
[2022-05-17 22:56:23] [INFO ] Deduced a trap composed of 171 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:56:24] [INFO ] Deduced a trap composed of 152 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:56:25] [INFO ] Deduced a trap composed of 153 places in 429 ms of which 5 ms to minimize.
[2022-05-17 22:56:25] [INFO ] Deduced a trap composed of 162 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:56:26] [INFO ] Deduced a trap composed of 141 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:56:27] [INFO ] Deduced a trap composed of 174 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:56:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 16139 ms
[2022-05-17 22:56:28] [INFO ] Deduced a trap composed of 145 places in 482 ms of which 2 ms to minimize.
[2022-05-17 22:56:29] [INFO ] Deduced a trap composed of 79 places in 480 ms of which 1 ms to minimize.
[2022-05-17 22:56:29] [INFO ] Deduced a trap composed of 87 places in 499 ms of which 2 ms to minimize.
[2022-05-17 22:56:30] [INFO ] Deduced a trap composed of 78 places in 477 ms of which 1 ms to minimize.
[2022-05-17 22:56:30] [INFO ] Deduced a trap composed of 76 places in 468 ms of which 3 ms to minimize.
[2022-05-17 22:56:31] [INFO ] Deduced a trap composed of 98 places in 481 ms of which 1 ms to minimize.
[2022-05-17 22:56:32] [INFO ] Deduced a trap composed of 80 places in 476 ms of which 1 ms to minimize.
[2022-05-17 22:56:32] [INFO ] Deduced a trap composed of 92 places in 497 ms of which 1 ms to minimize.
[2022-05-17 22:56:33] [INFO ] Deduced a trap composed of 70 places in 484 ms of which 1 ms to minimize.
[2022-05-17 22:56:33] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 5750 ms
[2022-05-17 22:56:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 22:56:33] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 6 ms.
Support contains 10 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1039/1039 places, 3254/3254 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1039 transition count 3253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1038 transition count 3253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1037 transition count 3252
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1037 transition count 3252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1037 transition count 3252
Applied a total of 5 rules in 219 ms. Remains 1037 /1039 variables (removed 2) and now considering 3252/3254 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1039 places, 3252/3254 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 22:56:34] [INFO ] Flow matrix only has 2866 transitions (discarded 386 similar events)
// Phase 1: matrix 2866 rows 1037 cols
[2022-05-17 22:56:34] [INFO ] Computed 67 place invariants in 33 ms
[2022-05-17 22:56:34] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-17 22:56:34] [INFO ] [Real]Absence check using 33 positive and 34 generalized place invariants in 12 ms returned sat
[2022-05-17 22:56:34] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 22:56:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-17 22:56:34] [INFO ] [Nat]Absence check using 33 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-17 22:56:36] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 22:56:36] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2022-05-17 22:56:38] [INFO ] After 2644ms SMT Verify possible using 1654 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 22:56:39] [INFO ] Deduced a trap composed of 191 places in 453 ms of which 1 ms to minimize.
[2022-05-17 22:56:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2022-05-17 22:56:41] [INFO ] After 5254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1705 ms.
[2022-05-17 22:56:43] [INFO ] After 8405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 3252/3252 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 1037 transition count 3251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1036 transition count 3251
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1036 transition count 3251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1035 transition count 3250
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1035 transition count 3250
Applied a total of 5 rules in 209 ms. Remains 1035 /1037 variables (removed 2) and now considering 3250/3252 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1035/1037 places, 3250/3252 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 65188 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65188 steps, saw 27571 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-17 22:56:46] [INFO ] Flow matrix only has 2864 transitions (discarded 386 similar events)
// Phase 1: matrix 2864 rows 1035 cols
[2022-05-17 22:56:46] [INFO ] Computed 67 place invariants in 45 ms
[2022-05-17 22:56:46] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-17 22:56:46] [INFO ] [Real]Absence check using 33 positive and 34 generalized place invariants in 7 ms returned sat
[2022-05-17 22:56:48] [INFO ] After 1150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2022-05-17 22:56:48] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2022-05-17 22:56:48] [INFO ] After 206ms SMT Verify possible using 1654 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 22:56:48] [INFO ] After 1666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 22:56:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-17 22:56:48] [INFO ] [Nat]Absence check using 33 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-17 22:56:49] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 22:56:50] [INFO ] After 1107ms SMT Verify possible using 1654 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 22:56:51] [INFO ] Deduced a trap composed of 177 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:56:52] [INFO ] Deduced a trap composed of 110 places in 497 ms of which 1 ms to minimize.
[2022-05-17 22:56:53] [INFO ] Deduced a trap composed of 70 places in 502 ms of which 1 ms to minimize.
[2022-05-17 22:56:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1711 ms
[2022-05-17 22:56:54] [INFO ] Deduced a trap composed of 196 places in 448 ms of which 0 ms to minimize.
[2022-05-17 22:56:55] [INFO ] Deduced a trap composed of 102 places in 487 ms of which 1 ms to minimize.
[2022-05-17 22:56:56] [INFO ] Deduced a trap composed of 110 places in 492 ms of which 1 ms to minimize.
[2022-05-17 22:56:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1713 ms
[2022-05-17 22:56:56] [INFO ] After 6294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1580 ms.
[2022-05-17 22:56:57] [INFO ] After 9357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 1035 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1035/1035 places, 3250/3250 transitions.
Applied a total of 0 rules in 84 ms. Remains 1035 /1035 variables (removed 0) and now considering 3250/3250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1035/1035 places, 3250/3250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1035/1035 places, 3250/3250 transitions.
Applied a total of 0 rules in 88 ms. Remains 1035 /1035 variables (removed 0) and now considering 3250/3250 (removed 0) transitions.
[2022-05-17 22:56:57] [INFO ] Flow matrix only has 2864 transitions (discarded 386 similar events)
// Phase 1: matrix 2864 rows 1035 cols
[2022-05-17 22:56:57] [INFO ] Computed 67 place invariants in 35 ms
[2022-05-17 22:56:58] [INFO ] Implicit Places using invariants in 1042 ms returned [7, 84, 200, 284, 285, 314, 370, 395, 396, 416, 417, 460, 470, 485, 524, 533, 573, 606, 648, 677, 700, 718, 976]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1047 ms to find 23 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1012/1035 places, 3250/3250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1000 transition count 3238
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1000 transition count 3238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 988 transition count 3226
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 988 transition count 3226
Applied a total of 48 rules in 160 ms. Remains 988 /1012 variables (removed 24) and now considering 3226/3250 (removed 24) transitions.
[2022-05-17 22:56:59] [INFO ] Flow matrix only has 2840 transitions (discarded 386 similar events)
// Phase 1: matrix 2840 rows 988 cols
[2022-05-17 22:56:59] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-17 22:56:59] [INFO ] Implicit Places using invariants in 841 ms returned []
[2022-05-17 22:57:00] [INFO ] Flow matrix only has 2840 transitions (discarded 386 similar events)
// Phase 1: matrix 2840 rows 988 cols
[2022-05-17 22:57:00] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-17 22:57:00] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2022-05-17 22:57:16] [INFO ] Implicit Places using invariants and state equation in 16233 ms returned []
Implicit Place search using SMT with State Equation took 17078 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 988/1035 places, 3226/3250 transitions.
Finished structural reductions, in 2 iterations. Remains : 988/1035 places, 3226/3250 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
Computed a total of 457 stabilizing places and 1223 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((false U !p0)) U p0))))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 1270 transition count 2815
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 1248 transition count 2815
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 101 place count 1229 transition count 2764
Iterating global reduction 2 with 19 rules applied. Total rules applied 120 place count 1229 transition count 2764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 1229 transition count 2763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 1228 transition count 2763
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 1217 transition count 2708
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 place count 1217 transition count 2708
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 208 place count 1185 transition count 2676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 1177 transition count 2668
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 1177 transition count 2668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 1169 transition count 2628
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 1169 transition count 2628
Applied a total of 240 rules in 434 ms. Remains 1169 /1289 variables (removed 120) and now considering 2628/2856 (removed 228) transitions.
[2022-05-17 22:57:16] [INFO ] Flow matrix only has 2356 transitions (discarded 272 similar events)
// Phase 1: matrix 2356 rows 1169 cols
[2022-05-17 22:57:17] [INFO ] Computed 67 place invariants in 30 ms
[2022-05-17 22:57:17] [INFO ] Implicit Places using invariants in 954 ms returned [9, 228, 324, 325, 359, 425, 455, 456, 479, 480, 530, 540, 556, 571, 596, 606, 650, 687, 736, 770, 797, 818, 1106]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 956 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1146/1289 places, 2628/2856 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1135 transition count 2617
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1135 transition count 2617
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1124 transition count 2606
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1124 transition count 2606
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1118 transition count 2576
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1118 transition count 2576
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 1110 transition count 2568
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1102 transition count 2560
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1102 transition count 2560
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 1092 transition count 2510
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 1092 transition count 2510
Applied a total of 108 rules in 416 ms. Remains 1092 /1146 variables (removed 54) and now considering 2510/2628 (removed 118) transitions.
[2022-05-17 22:57:18] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 22:57:18] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 22:57:19] [INFO ] Implicit Places using invariants in 842 ms returned []
[2022-05-17 22:57:19] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 22:57:19] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 22:57:20] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 22:57:27] [INFO ] Implicit Places using invariants and state equation in 8532 ms returned [1070]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9377 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1289 places, 2510/2856 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 90 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2022-05-17 22:57:27] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2022-05-17 22:57:27] [INFO ] Computed 43 place invariants in 23 ms
[2022-05-17 22:57:28] [INFO ] Implicit Places using invariants in 843 ms returned []
[2022-05-17 22:57:28] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2022-05-17 22:57:28] [INFO ] Computed 43 place invariants in 17 ms
[2022-05-17 22:57:29] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 22:57:37] [INFO ] Implicit Places using invariants and state equation in 8612 ms returned []
Implicit Place search using SMT with State Equation took 9456 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1289 places, 2509/2856 transitions.
Finished structural reductions, in 3 iterations. Remains : 1090/1289 places, 2509/2856 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s132 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 finished in 20959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!G(F(p0))&&F(!p1)&&!p2) U (p3 U p2)))'
Support contains 10 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 38 place count 1270 transition count 2816
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 1249 transition count 2816
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 97 place count 1232 transition count 2771
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 1232 transition count 2771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 1232 transition count 2770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1231 transition count 2770
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 126 place count 1221 transition count 2720
Iterating global reduction 2 with 10 rules applied. Total rules applied 136 place count 1221 transition count 2720
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 200 place count 1189 transition count 2688
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 208 place count 1181 transition count 2680
Iterating global reduction 2 with 8 rules applied. Total rules applied 216 place count 1181 transition count 2680
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 224 place count 1173 transition count 2640
Iterating global reduction 2 with 8 rules applied. Total rules applied 232 place count 1173 transition count 2640
Applied a total of 232 rules in 385 ms. Remains 1173 /1289 variables (removed 116) and now considering 2640/2856 (removed 216) transitions.
[2022-05-17 22:57:37] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1173 cols
[2022-05-17 22:57:37] [INFO ] Computed 67 place invariants in 25 ms
[2022-05-17 22:57:38] [INFO ] Implicit Places using invariants in 922 ms returned [9, 94, 225, 321, 359, 425, 455, 456, 479, 480, 543, 559, 574, 599, 609, 653, 690, 739, 773, 821]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 925 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1153/1289 places, 2640/2856 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1143 transition count 2630
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1143 transition count 2630
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1133 transition count 2620
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1133 transition count 2620
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1127 transition count 2590
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1127 transition count 2590
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 1119 transition count 2582
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1111 transition count 2574
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1111 transition count 2574
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1102 transition count 2529
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1102 transition count 2529
Applied a total of 102 rules in 379 ms. Remains 1102 /1153 variables (removed 51) and now considering 2529/2640 (removed 111) transitions.
[2022-05-17 22:57:39] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:57:39] [INFO ] Computed 47 place invariants in 30 ms
[2022-05-17 22:57:40] [INFO ] Implicit Places using invariants in 830 ms returned []
[2022-05-17 22:57:40] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:57:40] [INFO ] Computed 47 place invariants in 25 ms
[2022-05-17 22:57:40] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:57:49] [INFO ] Implicit Places using invariants and state equation in 9228 ms returned []
Implicit Place search using SMT with State Equation took 10062 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1289 places, 2529/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1102/1289 places, 2529/2856 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), p0, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s748 1) (GEQ s1057 1) (GEQ s1058 1)), p3:(AND (GEQ s850 1) (GEQ s1076 1)), p1:(AND (GEQ s323 1) (GEQ s340 1)), p0:(AND (GEQ s510 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2723 reset in 547 ms.
Product exploration explored 100000 steps with 2722 reset in 540 ms.
Computed a total of 287 stabilizing places and 913 stable transitions
Computed a total of 287 stabilizing places and 913 stable transitions
Detected a total of 287/1102 stabilizing places and 913/2529 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 565 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), p0, p1]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 22:57:51] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:57:51] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-17 22:57:51] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-05-17 22:57:51] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 10 ms returned sat
[2022-05-17 22:57:52] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 22:57:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-05-17 22:57:52] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 16 ms returned sat
[2022-05-17 22:57:53] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 22:57:53] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:57:54] [INFO ] After 382ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 22:57:54] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 227 ms.
[2022-05-17 22:57:54] [INFO ] After 2142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 1102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1102/1102 places, 2529/2529 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1102 transition count 2528
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1101 transition count 2528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1100 transition count 2527
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1100 transition count 2527
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1099 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1099 transition count 2522
Free-agglomeration rule (complex) applied 128 times.
Iterating global reduction 0 with 128 rules applied. Total rules applied 134 place count 1099 transition count 2394
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 262 place count 971 transition count 2394
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 971 transition count 2394
Applied a total of 263 rules in 310 ms. Remains 971 /1102 variables (removed 131) and now considering 2394/2529 (removed 135) transitions.
Finished structural reductions, in 1 iterations. Remains : 971/1102 places, 2394/2529 transitions.
Finished random walk after 6045 steps, including 175 resets, run visited all 2 properties in 63 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (AND (NOT p2) (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 14 factoid took 567 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), p0, p1]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), p0, p1]
[2022-05-17 22:57:56] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:57:56] [INFO ] Computed 47 place invariants in 25 ms
[2022-05-17 22:57:58] [INFO ] [Real]Absence check using 31 positive place invariants in 110 ms returned sat
[2022-05-17 22:57:58] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 21 ms returned sat
[2022-05-17 22:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:00] [INFO ] [Real]Absence check using state equation in 1928 ms returned sat
[2022-05-17 22:58:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:58:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 49 ms returned sat
[2022-05-17 22:58:02] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 76 ms returned sat
[2022-05-17 22:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:03] [INFO ] [Nat]Absence check using state equation in 1501 ms returned sat
[2022-05-17 22:58:03] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:58:03] [INFO ] [Nat]Added 846 Read/Feed constraints in 83 ms returned sat
[2022-05-17 22:58:04] [INFO ] Deduced a trap composed of 80 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:58:04] [INFO ] Deduced a trap composed of 83 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:58:05] [INFO ] Deduced a trap composed of 90 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:58:05] [INFO ] Deduced a trap composed of 80 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:58:06] [INFO ] Deduced a trap composed of 80 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:58:06] [INFO ] Deduced a trap composed of 73 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:58:07] [INFO ] Deduced a trap composed of 75 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:58:07] [INFO ] Deduced a trap composed of 83 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:58:08] [INFO ] Deduced a trap composed of 75 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:58:08] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:58:09] [INFO ] Deduced a trap composed of 95 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:58:09] [INFO ] Deduced a trap composed of 84 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:58:10] [INFO ] Deduced a trap composed of 110 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:58:10] [INFO ] Deduced a trap composed of 95 places in 413 ms of which 0 ms to minimize.
[2022-05-17 22:58:11] [INFO ] Deduced a trap composed of 103 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:58:11] [INFO ] Deduced a trap composed of 85 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:58:12] [INFO ] Deduced a trap composed of 70 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:58:12] [INFO ] Deduced a trap composed of 108 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:58:13] [INFO ] Deduced a trap composed of 97 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:58:14] [INFO ] Deduced a trap composed of 98 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:58:14] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:58:15] [INFO ] Deduced a trap composed of 92 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:58:15] [INFO ] Deduced a trap composed of 74 places in 393 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 22:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 10 out of 1102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1102/1102 places, 2529/2529 transitions.
Applied a total of 0 rules in 73 ms. Remains 1102 /1102 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
[2022-05-17 22:58:15] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:15] [INFO ] Computed 47 place invariants in 27 ms
[2022-05-17 22:58:16] [INFO ] Implicit Places using invariants in 840 ms returned []
[2022-05-17 22:58:16] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:16] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-17 22:58:17] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:58:25] [INFO ] Implicit Places using invariants and state equation in 9157 ms returned []
Implicit Place search using SMT with State Equation took 9999 ms to find 0 implicit places.
[2022-05-17 22:58:25] [INFO ] Redundant transitions in 139 ms returned []
[2022-05-17 22:58:25] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:25] [INFO ] Computed 47 place invariants in 27 ms
[2022-05-17 22:58:26] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1102/1102 places, 2529/2529 transitions.
Computed a total of 287 stabilizing places and 913 stable transitions
Computed a total of 287 stabilizing places and 913 stable transitions
Detected a total of 287/1102 stabilizing places and 913/2529 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), p0, p1]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 22:58:27] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:27] [INFO ] Computed 47 place invariants in 27 ms
[2022-05-17 22:58:27] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-17 22:58:27] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 10 ms returned sat
[2022-05-17 22:58:28] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:58:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-17 22:58:28] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 16 ms returned sat
[2022-05-17 22:58:29] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:58:29] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:58:29] [INFO ] After 167ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:58:30] [INFO ] Deduced a trap composed of 73 places in 422 ms of which 0 ms to minimize.
[2022-05-17 22:58:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2022-05-17 22:58:30] [INFO ] After 837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-17 22:58:30] [INFO ] After 1759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1102/1102 places, 2529/2529 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1102 transition count 2528
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1101 transition count 2528
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 1099 transition count 2522
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1099 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1098 transition count 2517
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1098 transition count 2517
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 0 with 134 rules applied. Total rules applied 142 place count 1098 transition count 3451
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 0 with 134 rules applied. Total rules applied 276 place count 964 transition count 3451
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 277 place count 964 transition count 3451
Applied a total of 277 rules in 362 ms. Remains 964 /1102 variables (removed 138) and now considering 3451/2529 (removed -922) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/1102 places, 3451/2529 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Finished Best-First random walk after 7036 steps, including 28 resets, run visited all 1 properties in 17 ms. (steps per millisecond=413 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (AND (NOT p2) (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 14 factoid took 589 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), p0, p1]
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), p0, p1]
[2022-05-17 22:58:31] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:31] [INFO ] Computed 47 place invariants in 27 ms
[2022-05-17 22:58:33] [INFO ] [Real]Absence check using 31 positive place invariants in 106 ms returned sat
[2022-05-17 22:58:33] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 21 ms returned sat
[2022-05-17 22:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:35] [INFO ] [Real]Absence check using state equation in 1949 ms returned sat
[2022-05-17 22:58:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:58:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-05-17 22:58:37] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 84 ms returned sat
[2022-05-17 22:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:39] [INFO ] [Nat]Absence check using state equation in 1501 ms returned sat
[2022-05-17 22:58:39] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:58:39] [INFO ] [Nat]Added 846 Read/Feed constraints in 82 ms returned sat
[2022-05-17 22:58:39] [INFO ] Deduced a trap composed of 80 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:58:40] [INFO ] Deduced a trap composed of 83 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:58:40] [INFO ] Deduced a trap composed of 90 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:58:41] [INFO ] Deduced a trap composed of 80 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:58:41] [INFO ] Deduced a trap composed of 80 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:58:42] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:58:42] [INFO ] Deduced a trap composed of 75 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:58:43] [INFO ] Deduced a trap composed of 83 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:58:43] [INFO ] Deduced a trap composed of 75 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:58:44] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:58:44] [INFO ] Deduced a trap composed of 95 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:58:45] [INFO ] Deduced a trap composed of 84 places in 413 ms of which 2 ms to minimize.
[2022-05-17 22:58:45] [INFO ] Deduced a trap composed of 110 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:58:46] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:58:46] [INFO ] Deduced a trap composed of 103 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:58:47] [INFO ] Deduced a trap composed of 85 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:58:47] [INFO ] Deduced a trap composed of 70 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:58:48] [INFO ] Deduced a trap composed of 108 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:58:49] [INFO ] Deduced a trap composed of 97 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:58:49] [INFO ] Deduced a trap composed of 98 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:58:50] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:58:50] [INFO ] Deduced a trap composed of 92 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:58:51] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 22:58:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), p0, p1]
Product exploration explored 100000 steps with 2723 reset in 475 ms.
Product exploration explored 100000 steps with 2726 reset in 494 ms.
Built C files in :
/tmp/ltsmin6789807427376193249
[2022-05-17 22:58:52] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:58:52] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6789807427376193249
Running compilation step : cd /tmp/ltsmin6789807427376193249;'/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/ltsmin6789807427376193249;'/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/ltsmin6789807427376193249;'/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 10 out of 1102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1102/1102 places, 2529/2529 transitions.
Applied a total of 0 rules in 78 ms. Remains 1102 /1102 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
[2022-05-17 22:58:55] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:55] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-17 22:58:56] [INFO ] Implicit Places using invariants in 854 ms returned []
[2022-05-17 22:58:56] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:58:56] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-17 22:58:56] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-17 22:59:05] [INFO ] Implicit Places using invariants and state equation in 9221 ms returned []
Implicit Place search using SMT with State Equation took 10077 ms to find 0 implicit places.
[2022-05-17 22:59:05] [INFO ] Redundant transitions in 125 ms returned []
[2022-05-17 22:59:05] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1102 cols
[2022-05-17 22:59:05] [INFO ] Computed 47 place invariants in 29 ms
[2022-05-17 22:59:06] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1102/1102 places, 2529/2529 transitions.
Built C files in :
/tmp/ltsmin12567430321982305643
[2022-05-17 22:59:06] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:59:06] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12567430321982305643
Running compilation step : cd /tmp/ltsmin12567430321982305643;'/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/ltsmin12567430321982305643;'/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/ltsmin12567430321982305643;'/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-17 22:59:09] [INFO ] Flatten gal took : 165 ms
[2022-05-17 22:59:10] [INFO ] Flatten gal took : 162 ms
[2022-05-17 22:59:10] [INFO ] Time to serialize gal into /tmp/LTL11101551040300021088.gal : 119 ms
[2022-05-17 22:59:10] [INFO ] Time to serialize properties into /tmp/LTL4369725696871839826.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/LTL11101551040300021088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4369725696871839826.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/LTL1110155...267
Read 1 LTL properties
Checking formula 0 : !(((((!(G(F("((Node6HasAskedItsLeafSetToRx3ToReplaceNode14>=1)&&(LeafSetOfRx3IsSentToNode6>=1))"))))&&(F(!("((Node2HasAskedItsLeafSetT...618
Formula 0 simplified : !((!"(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode13>=1))&&((Node16WantsToManageTheCrashOfNode13>=1)&&(Node16HasDet...600
Detected timeout of ITS tools.
[2022-05-17 22:59:25] [INFO ] Flatten gal took : 73 ms
[2022-05-17 22:59:25] [INFO ] Applying decomposition
[2022-05-17 22:59:25] [INFO ] Flatten gal took : 77 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/graph13139924957661375438.txt' '-o' '/tmp/graph13139924957661375438.bin' '-w' '/tmp/graph13139924957661375438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13139924957661375438.bin' '-l' '-1' '-v' '-w' '/tmp/graph13139924957661375438.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:59:25] [INFO ] Decomposing Gal with order
[2022-05-17 22:59:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:59:26] [INFO ] Removed a total of 2281 redundant transitions.
[2022-05-17 22:59:26] [INFO ] Flatten gal took : 619 ms
[2022-05-17 22:59:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1471 labels/synchronizations in 148 ms.
[2022-05-17 22:59:26] [INFO ] Time to serialize gal into /tmp/LTL8950122088203105269.gal : 18 ms
[2022-05-17 22:59:26] [INFO ] Time to serialize properties into /tmp/LTL8699034705947690684.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/LTL8950122088203105269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8699034705947690684.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8950122...245
Read 1 LTL properties
Checking formula 0 : !(((((!(G(F("((i15.i1.u14.Node6HasAskedItsLeafSetToRx3ToReplaceNode14>=1)&&(i15.i1.u162.LeafSetOfRx3IsSentToNode6>=1))"))))&&(F(!("((i...720
Formula 0 simplified : !((!"(((u0.ThereIsAMasterInTheLeafSet>=1)&&(u0.NoNodeManageTheCrashOfNode13>=1))&&((u0.Node16WantsToManageTheCrashOfNode13>=1)&&(i4....702
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10679035819942074968
[2022-05-17 22:59:41] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10679035819942074968
Running compilation step : cd /tmp/ltsmin10679035819942074968;'/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/ltsmin10679035819942074968;'/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/ltsmin10679035819942074968;'/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-S16C05-LTLFireability-02 finished in 127501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X((G(p0)&&X(p1))))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1263 transition count 2806
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1263 transition count 2806
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 1243 transition count 2738
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 1243 transition count 2738
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 1235 transition count 2698
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 1235 transition count 2698
Applied a total of 108 rules in 202 ms. Remains 1235 /1289 variables (removed 54) and now considering 2698/2856 (removed 158) transitions.
[2022-05-17 22:59:45] [INFO ] Flow matrix only has 2426 transitions (discarded 272 similar events)
// Phase 1: matrix 2426 rows 1235 cols
[2022-05-17 22:59:45] [INFO ] Computed 67 place invariants in 28 ms
[2022-05-17 22:59:46] [INFO ] Implicit Places using invariants in 1199 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 575, 593, 610, 637, 647, 695, 734, 785, 820, 849, 871, 1161]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1202 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1211/1289 places, 2698/2856 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1191 transition count 2678
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1191 transition count 2678
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1171 transition count 2658
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1171 transition count 2658
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 1151 transition count 2638
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 1151 transition count 2638
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 137 place count 1134 transition count 2553
Iterating global reduction 0 with 17 rules applied. Total rules applied 154 place count 1134 transition count 2553
Applied a total of 154 rules in 272 ms. Remains 1134 /1211 variables (removed 77) and now considering 2553/2698 (removed 145) transitions.
[2022-05-17 22:59:46] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1134 cols
[2022-05-17 22:59:46] [INFO ] Computed 43 place invariants in 27 ms
[2022-05-17 22:59:47] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-17 22:59:47] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1134 cols
[2022-05-17 22:59:47] [INFO ] Computed 43 place invariants in 23 ms
[2022-05-17 22:59:48] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 22:59:56] [INFO ] Implicit Places using invariants and state equation in 9174 ms returned [1121]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10064 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1289 places, 2553/2856 transitions.
Applied a total of 0 rules in 65 ms. Remains 1133 /1133 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1133/1289 places, 2553/2856 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s538 1) (GEQ s1105 1)), p1:(AND (GEQ s729 1) (GEQ s1096 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 11963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1)||p1)))'
Support contains 3 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 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 0 with 18 rules applied. Total rules applied 18 place count 1289 transition count 2838
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1271 transition count 2838
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 36 place count 1271 transition count 2815
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 82 place count 1248 transition count 2815
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 101 place count 1229 transition count 2768
Iterating global reduction 2 with 19 rules applied. Total rules applied 120 place count 1229 transition count 2768
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 120 place count 1229 transition count 2766
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 1227 transition count 2766
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 136 place count 1215 transition count 2706
Iterating global reduction 2 with 12 rules applied. Total rules applied 148 place count 1215 transition count 2706
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 210 place count 1184 transition count 2675
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 1177 transition count 2668
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 1177 transition count 2668
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 231 place count 1170 transition count 2633
Iterating global reduction 2 with 7 rules applied. Total rules applied 238 place count 1170 transition count 2633
Applied a total of 238 rules in 392 ms. Remains 1170 /1289 variables (removed 119) and now considering 2633/2856 (removed 223) transitions.
[2022-05-17 22:59:57] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1170 cols
[2022-05-17 22:59:57] [INFO ] Computed 67 place invariants in 30 ms
[2022-05-17 22:59:58] [INFO ] Implicit Places using invariants in 966 ms returned [9, 94, 224, 320, 321, 355, 421, 451, 452, 475, 476, 526, 536, 552, 595, 605, 649, 686, 736, 770, 797, 818, 1106]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 968 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1147/1289 places, 2633/2856 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1135 transition count 2621
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1135 transition count 2621
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1123 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1123 transition count 2609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 1115 transition count 2569
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 1115 transition count 2569
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 1108 transition count 2562
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1101 transition count 2555
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1101 transition count 2555
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 1093 transition count 2515
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 1093 transition count 2515
Applied a total of 108 rules in 415 ms. Remains 1093 /1147 variables (removed 54) and now considering 2515/2633 (removed 118) transitions.
[2022-05-17 22:59:58] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 22:59:58] [INFO ] Computed 44 place invariants in 25 ms
[2022-05-17 22:59:59] [INFO ] Implicit Places using invariants in 836 ms returned []
[2022-05-17 22:59:59] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 22:59:59] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:00:00] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:00:08] [INFO ] Implicit Places using invariants and state equation in 8632 ms returned []
Implicit Place search using SMT with State Equation took 9478 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1289 places, 2515/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1093/1289 places, 2515/2856 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s538 1), p0:(AND (GEQ s672 1) (GEQ s1080 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 finished in 11419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F((!(p0 U p1)||(p2&&(G(!p0)||p0)))))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1289 transition count 2839
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 1272 transition count 2839
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 34 place count 1272 transition count 2817
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 78 place count 1250 transition count 2817
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 97 place count 1231 transition count 2766
Iterating global reduction 2 with 19 rules applied. Total rules applied 116 place count 1231 transition count 2766
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 116 place count 1231 transition count 2764
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 1229 transition count 2764
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 131 place count 1218 transition count 2709
Iterating global reduction 2 with 11 rules applied. Total rules applied 142 place count 1218 transition count 2709
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 204 place count 1187 transition count 2678
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 1181 transition count 2672
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 1181 transition count 2672
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 1175 transition count 2642
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 1175 transition count 2642
Applied a total of 228 rules in 407 ms. Remains 1175 /1289 variables (removed 114) and now considering 2642/2856 (removed 214) transitions.
[2022-05-17 23:00:08] [INFO ] Flow matrix only has 2370 transitions (discarded 272 similar events)
// Phase 1: matrix 2370 rows 1175 cols
[2022-05-17 23:00:08] [INFO ] Computed 67 place invariants in 26 ms
[2022-05-17 23:00:09] [INFO ] Implicit Places using invariants in 967 ms returned [97, 227, 324, 361, 460, 461, 484, 485, 535, 545, 561, 576, 601, 611, 655, 692, 741, 775, 802, 823, 1111]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 969 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/1289 places, 2642/2856 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1143 transition count 2631
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1143 transition count 2631
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1132 transition count 2620
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1132 transition count 2620
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1124 transition count 2580
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1124 transition count 2580
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1118 transition count 2574
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1112 transition count 2568
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1112 transition count 2568
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 1106 transition count 2538
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 1106 transition count 2538
Applied a total of 96 rules in 405 ms. Remains 1106 /1154 variables (removed 48) and now considering 2538/2642 (removed 104) transitions.
[2022-05-17 23:00:10] [INFO ] Flow matrix only has 2266 transitions (discarded 272 similar events)
// Phase 1: matrix 2266 rows 1106 cols
[2022-05-17 23:00:10] [INFO ] Computed 46 place invariants in 29 ms
[2022-05-17 23:00:11] [INFO ] Implicit Places using invariants in 881 ms returned []
[2022-05-17 23:00:11] [INFO ] Flow matrix only has 2266 transitions (discarded 272 similar events)
// Phase 1: matrix 2266 rows 1106 cols
[2022-05-17 23:00:11] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-17 23:00:11] [INFO ] State equation strengthened by 850 read => feed constraints.
[2022-05-17 23:00:18] [INFO ] Implicit Places using invariants and state equation in 7716 ms returned []
Implicit Place search using SMT with State Equation took 8600 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1106/1289 places, 2538/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1106/1289 places, 2538/2856 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s341 1) (GEQ s345 1)), p2:(LT s22 1), p1:(GEQ s420 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2714 reset in 545 ms.
Product exploration explored 100000 steps with 2714 reset in 529 ms.
Computed a total of 291 stabilizing places and 922 stable transitions
Computed a total of 291 stabilizing places and 922 stable transitions
Detected a total of 291/1106 stabilizing places and 922/2538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 531 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 74229 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74229 steps, saw 31342 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-17 23:00:24] [INFO ] Flow matrix only has 2266 transitions (discarded 272 similar events)
// Phase 1: matrix 2266 rows 1106 cols
[2022-05-17 23:00:24] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-17 23:00:24] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-17 23:00:24] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-17 23:00:24] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-17 23:00:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-17 23:00:24] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 23:00:25] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-05-17 23:00:25] [INFO ] State equation strengthened by 850 read => feed constraints.
[2022-05-17 23:00:25] [INFO ] After 330ms SMT Verify possible using 850 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2022-05-17 23:00:26] [INFO ] Deduced a trap composed of 226 places in 390 ms of which 1 ms to minimize.
[2022-05-17 23:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2022-05-17 23:00:26] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-05-17 23:00:26] [INFO ] After 1967ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1106/1106 places, 2538/2538 transitions.
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 0 with 137 rules applied. Total rules applied 137 place count 1106 transition count 3457
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 274 place count 969 transition count 3457
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 276 place count 969 transition count 3457
Applied a total of 276 rules in 267 ms. Remains 969 /1106 variables (removed 137) and now considering 3457/2538 (removed -919) transitions.
Finished structural reductions, in 1 iterations. Remains : 969/1106 places, 3457/2538 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76137 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76137 steps, saw 31820 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 23:00:29] [INFO ] Flow matrix only has 3059 transitions (discarded 398 similar events)
// Phase 1: matrix 3059 rows 969 cols
[2022-05-17 23:00:30] [INFO ] Computed 46 place invariants in 47 ms
[2022-05-17 23:00:30] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-17 23:00:30] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 10 ms returned sat
[2022-05-17 23:00:30] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:00:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-17 23:00:31] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 10 ms returned sat
[2022-05-17 23:00:31] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 23:00:31] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:00:32] [INFO ] After 353ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 23:00:32] [INFO ] Deduced a trap composed of 129 places in 394 ms of which 1 ms to minimize.
[2022-05-17 23:00:33] [INFO ] Deduced a trap composed of 138 places in 396 ms of which 1 ms to minimize.
[2022-05-17 23:00:33] [INFO ] Deduced a trap composed of 150 places in 389 ms of which 4 ms to minimize.
[2022-05-17 23:00:34] [INFO ] Deduced a trap composed of 164 places in 379 ms of which 0 ms to minimize.
[2022-05-17 23:00:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2375 ms
[2022-05-17 23:00:34] [INFO ] After 2933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-17 23:00:35] [INFO ] After 4148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 969 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 969/969 places, 3457/3457 transitions.
Applied a total of 0 rules in 89 ms. Remains 969 /969 variables (removed 0) and now considering 3457/3457 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 969/969 places, 3457/3457 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 969/969 places, 3457/3457 transitions.
Applied a total of 0 rules in 82 ms. Remains 969 /969 variables (removed 0) and now considering 3457/3457 (removed 0) transitions.
[2022-05-17 23:00:35] [INFO ] Flow matrix only has 3059 transitions (discarded 398 similar events)
// Phase 1: matrix 3059 rows 969 cols
[2022-05-17 23:00:35] [INFO ] Computed 46 place invariants in 33 ms
[2022-05-17 23:00:36] [INFO ] Implicit Places using invariants in 975 ms returned []
[2022-05-17 23:00:36] [INFO ] Flow matrix only has 3059 transitions (discarded 398 similar events)
// Phase 1: matrix 3059 rows 969 cols
[2022-05-17 23:00:36] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-17 23:00:36] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:00:52] [INFO ] Implicit Places using invariants and state equation in 16263 ms returned []
Implicit Place search using SMT with State Equation took 17239 ms to find 0 implicit places.
[2022-05-17 23:00:52] [INFO ] Redundant transitions in 222 ms returned []
[2022-05-17 23:00:52] [INFO ] Flow matrix only has 3059 transitions (discarded 398 similar events)
// Phase 1: matrix 3059 rows 969 cols
[2022-05-17 23:00:52] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-17 23:00:53] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 969/969 places, 3457/3457 transitions.
Graph (trivial) has 1050 edges and 969 vertex of which 17 / 969 are part of one of the 1 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4027 edges and 953 vertex of which 939 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1270.t1492 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 922 transition count 2688
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 825 transition count 2495
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 729 transition count 2327
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 657 transition count 2185
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 587 transition count 2065
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 537 transition count 1967
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 489 transition count 1887
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 457 transition count 1825
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 427 transition count 1777
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 409 transition count 1743
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 393 transition count 1719
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 385 transition count 1705
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 379 transition count 1697
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 376 transition count 1695
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 10 Pre rules applied. Total rules applied 1640 place count 376 transition count 1685
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 1660 place count 366 transition count 1685
Discarding 280 places :
Symmetric choice reduction at 14 with 280 rule applications. Total rules 1940 place count 86 transition count 349
Iterating global reduction 14 with 280 rules applied. Total rules applied 2220 place count 86 transition count 349
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 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 14 with 231 rules applied. Total rules applied 2451 place count 86 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2452 place count 85 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2452 place count 85 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2454 place count 84 transition count 117
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 2462 place count 76 transition count 98
Iterating global reduction 16 with 8 rules applied. Total rules applied 2470 place count 76 transition count 98
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 2478 place count 68 transition count 90
Iterating global reduction 16 with 8 rules applied. Total rules applied 2486 place count 68 transition count 90
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 16 with 16 rules applied. Total rules applied 2502 place count 60 transition count 82
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2503 place count 59 transition count 80
Iterating global reduction 16 with 1 rules applied. Total rules applied 2504 place count 59 transition count 80
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 2511 place count 59 transition count 73
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 2518 place count 52 transition count 73
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 2525 place count 52 transition count 73
Applied a total of 2525 rules in 471 ms. Remains 52 /969 variables (removed 917) and now considering 73/3457 (removed 3384) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 73 rows 52 cols
[2022-05-17 23:00:54] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 23:00:54] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-17 23:00:54] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-17 23:00:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:00:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 23:00:54] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-17 23:00:54] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 23:00:54] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 23:00:54] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-17 23:00:54] [INFO ] Flatten gal took : 4 ms
[2022-05-17 23:00:54] [INFO ] Flatten gal took : 4 ms
[2022-05-17 23:00:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6361822855437694073.gal : 4 ms
[2022-05-17 23:00:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11697735025267225578.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4910083448040331874;'/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/ReachabilityCardinality6361822855437694073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11697735025267225578.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/ReachabilityCardinality11697735025267225578.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 23
Reachability property apf5 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
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,30,0.026602,4736,2,240,8,689,6,0,265,290,0
Total reachable state count : 30
Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1,0.027173,4736,2,53,8,689,7,0,274,290,0
Reachability property apf5 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
apf5,1,0.027509,4736,2,53,8,689,8,0,275,290,0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))
Knowledge based reduction with 18 factoid took 485 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 finished in 46680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(p0)&&p1)))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1263 transition count 2802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1263 transition count 2802
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 1244 transition count 2739
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 1244 transition count 2739
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 1236 transition count 2699
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 1236 transition count 2699
Applied a total of 106 rules in 237 ms. Remains 1236 /1289 variables (removed 53) and now considering 2699/2856 (removed 157) transitions.
[2022-05-17 23:00:55] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1236 cols
[2022-05-17 23:00:55] [INFO ] Computed 67 place invariants in 46 ms
[2022-05-17 23:00:56] [INFO ] Implicit Places using invariants in 1050 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 575, 592, 609, 636, 646, 694, 787, 821, 850, 872, 1162]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1213/1289 places, 2699/2856 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1194 transition count 2680
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1194 transition count 2680
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1175 transition count 2661
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1175 transition count 2661
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1156 transition count 2642
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1156 transition count 2642
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 130 place count 1140 transition count 2562
Iterating global reduction 0 with 16 rules applied. Total rules applied 146 place count 1140 transition count 2562
Applied a total of 146 rules in 284 ms. Remains 1140 /1213 variables (removed 73) and now considering 2562/2699 (removed 137) transitions.
[2022-05-17 23:00:56] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:00:56] [INFO ] Computed 44 place invariants in 25 ms
[2022-05-17 23:00:57] [INFO ] Implicit Places using invariants in 878 ms returned []
[2022-05-17 23:00:57] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:00:57] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:00:58] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:01:05] [INFO ] Implicit Places using invariants and state equation in 7529 ms returned []
Implicit Place search using SMT with State Equation took 8408 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1289 places, 2562/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1140/1289 places, 2562/2856 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s631 1) (GEQ s1114 1)), p1:(OR (LT s673 1) (LT s711 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 finished in 10127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1262 transition count 2801
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1262 transition count 2801
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 1242 transition count 2733
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 1242 transition count 2733
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 1234 transition count 2693
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 1234 transition count 2693
Applied a total of 110 rules in 200 ms. Remains 1234 /1289 variables (removed 55) and now considering 2693/2856 (removed 163) transitions.
[2022-05-17 23:01:05] [INFO ] Flow matrix only has 2421 transitions (discarded 272 similar events)
// Phase 1: matrix 2421 rows 1234 cols
[2022-05-17 23:01:05] [INFO ] Computed 67 place invariants in 31 ms
[2022-05-17 23:01:06] [INFO ] Implicit Places using invariants in 985 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 575, 592, 609, 636, 646, 694, 733, 785, 819, 848, 870, 1160]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 988 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1210/1289 places, 2693/2856 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1190 transition count 2673
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1190 transition count 2673
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1170 transition count 2653
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1170 transition count 2653
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 1150 transition count 2633
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 1150 transition count 2633
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 137 place count 1133 transition count 2548
Iterating global reduction 0 with 17 rules applied. Total rules applied 154 place count 1133 transition count 2548
Applied a total of 154 rules in 259 ms. Remains 1133 /1210 variables (removed 77) and now considering 2548/2693 (removed 145) transitions.
[2022-05-17 23:01:06] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2022-05-17 23:01:06] [INFO ] Computed 43 place invariants in 28 ms
[2022-05-17 23:01:07] [INFO ] Implicit Places using invariants in 854 ms returned []
[2022-05-17 23:01:07] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2022-05-17 23:01:07] [INFO ] Computed 43 place invariants in 19 ms
[2022-05-17 23:01:08] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:01:17] [INFO ] Implicit Places using invariants and state equation in 9868 ms returned [1105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1132/1289 places, 2548/2856 transitions.
Applied a total of 0 rules in 45 ms. Remains 1132 /1132 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1132/1289 places, 2548/2856 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 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=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s689 1) (LT s1118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1003 ms.
Product exploration explored 100000 steps with 25000 reset in 1022 ms.
Computed a total of 300 stabilizing places and 915 stable transitions
Computed a total of 300 stabilizing places and 915 stable transitions
Detected a total of 300/1132 stabilizing places and 915/2548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 192 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5677 steps, run visited all 1 properties in 192 ms. (steps per millisecond=29 )
Probabilistic random walk after 5677 steps, saw 2510 distinct states, run finished after 192 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 2548/2548 transitions.
Applied a total of 0 rules in 53 ms. Remains 1132 /1132 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
[2022-05-17 23:01:20] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:20] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-17 23:01:21] [INFO ] Implicit Places using invariants in 847 ms returned []
[2022-05-17 23:01:21] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:21] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-17 23:01:22] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:01:30] [INFO ] Implicit Places using invariants and state equation in 9328 ms returned []
Implicit Place search using SMT with State Equation took 10176 ms to find 0 implicit places.
[2022-05-17 23:01:30] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:30] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-17 23:01:31] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1132/1132 places, 2548/2548 transitions.
Computed a total of 300 stabilizing places and 915 stable transitions
Computed a total of 300 stabilizing places and 915 stable transitions
Detected a total of 300/1132 stabilizing places and 915/2548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 191 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5677 steps, run visited all 1 properties in 191 ms. (steps per millisecond=29 )
Probabilistic random walk after 5677 steps, saw 2510 distinct states, run finished after 191 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1000 ms.
Product exploration explored 100000 steps with 25000 reset in 1027 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1132/1132 places, 2548/2548 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1132 transition count 2548
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 21 place count 1132 transition count 2548
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 31 place count 1132 transition count 2548
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 42 place count 1121 transition count 2537
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 53 place count 1121 transition count 2537
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 1121 transition count 2537
Deduced a syphon composed of 37 places in 1 ms
Applied a total of 70 rules in 399 ms. Remains 1121 /1132 variables (removed 11) and now considering 2537/2548 (removed 11) transitions.
[2022-05-17 23:01:35] [INFO ] Redundant transitions in 71 ms returned []
[2022-05-17 23:01:35] [INFO ] Flow matrix only has 2265 transitions (discarded 272 similar events)
// Phase 1: matrix 2265 rows 1121 cols
[2022-05-17 23:01:35] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-17 23:01:36] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1132 places, 2537/2548 transitions.
Finished structural reductions, in 1 iterations. Remains : 1121/1132 places, 2537/2548 transitions.
Product exploration explored 100000 steps with 25000 reset in 4506 ms.
Product exploration explored 100000 steps with 25000 reset in 4474 ms.
Built C files in :
/tmp/ltsmin9550821632671125628
[2022-05-17 23:01:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9550821632671125628
Running compilation step : cd /tmp/ltsmin9550821632671125628;'/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/ltsmin9550821632671125628;'/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/ltsmin9550821632671125628;'/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 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 2548/2548 transitions.
Applied a total of 0 rules in 55 ms. Remains 1132 /1132 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
[2022-05-17 23:01:48] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:48] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-17 23:01:49] [INFO ] Implicit Places using invariants in 829 ms returned []
[2022-05-17 23:01:49] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:49] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-17 23:01:50] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:01:58] [INFO ] Implicit Places using invariants and state equation in 9244 ms returned []
Implicit Place search using SMT with State Equation took 10076 ms to find 0 implicit places.
[2022-05-17 23:01:58] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1132 cols
[2022-05-17 23:01:58] [INFO ] Computed 42 place invariants in 28 ms
[2022-05-17 23:01:59] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1132/1132 places, 2548/2548 transitions.
Built C files in :
/tmp/ltsmin8941069666646386500
[2022-05-17 23:01:59] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8941069666646386500
Running compilation step : cd /tmp/ltsmin8941069666646386500;'/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/ltsmin8941069666646386500;'/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/ltsmin8941069666646386500;'/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-17 23:02:02] [INFO ] Flatten gal took : 79 ms
[2022-05-17 23:02:02] [INFO ] Flatten gal took : 83 ms
[2022-05-17 23:02:02] [INFO ] Time to serialize gal into /tmp/LTL5036675550932601791.gal : 12 ms
[2022-05-17 23:02:02] [INFO ] Time to serialize properties into /tmp/LTL7055896873794203838.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/LTL5036675550932601791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7055896873794203838.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/LTL5036675...266
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((Node12ManageTheCrashOfNode9<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((Node12ManageTheCrashOfNode9<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2022-05-17 23:02:18] [INFO ] Flatten gal took : 79 ms
[2022-05-17 23:02:18] [INFO ] Applying decomposition
[2022-05-17 23:02:18] [INFO ] Flatten gal took : 73 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/graph10244795843925043695.txt' '-o' '/tmp/graph10244795843925043695.bin' '-w' '/tmp/graph10244795843925043695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10244795843925043695.bin' '-l' '-1' '-v' '-w' '/tmp/graph10244795843925043695.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:02:18] [INFO ] Decomposing Gal with order
[2022-05-17 23:02:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:02:18] [INFO ] Removed a total of 3087 redundant transitions.
[2022-05-17 23:02:18] [INFO ] Flatten gal took : 193 ms
[2022-05-17 23:02:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1098 labels/synchronizations in 86 ms.
[2022-05-17 23:02:18] [INFO ] Time to serialize gal into /tmp/LTL11943519587233133796.gal : 16 ms
[2022-05-17 23:02:18] [INFO ] Time to serialize properties into /tmp/LTL11320565265612146298.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/LTL11943519587233133796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11320565265612146298.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1194351...247
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i2.u25.Node12ManageTheCrashOfNode9<1)||(i2.u33.Rx3IsAtTheRightExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((i2.u25.Node12ManageTheCrashOfNode9<1)||(i2.u33.Rx3IsAtTheRightExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6667955638850022623
[2022-05-17 23:02:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667955638850022623
Running compilation step : cd /tmp/ltsmin6667955638850022623;'/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/ltsmin6667955638850022623;'/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/ltsmin6667955638850022623;'/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-S16C05-LTLFireability-09 finished in 91708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 1270 transition count 2815
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 1248 transition count 2815
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 101 place count 1229 transition count 2764
Iterating global reduction 2 with 19 rules applied. Total rules applied 120 place count 1229 transition count 2764
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 120 place count 1229 transition count 2762
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 1227 transition count 2762
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 135 place count 1216 transition count 2707
Iterating global reduction 2 with 11 rules applied. Total rules applied 146 place count 1216 transition count 2707
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 208 place count 1185 transition count 2676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 1177 transition count 2668
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 1177 transition count 2668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 1169 transition count 2628
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 1169 transition count 2628
Applied a total of 240 rules in 333 ms. Remains 1169 /1289 variables (removed 120) and now considering 2628/2856 (removed 228) transitions.
[2022-05-17 23:02:37] [INFO ] Flow matrix only has 2356 transitions (discarded 272 similar events)
// Phase 1: matrix 2356 rows 1169 cols
[2022-05-17 23:02:37] [INFO ] Computed 67 place invariants in 21 ms
[2022-05-17 23:02:38] [INFO ] Implicit Places using invariants in 1034 ms returned [9, 94, 224, 320, 321, 355, 421, 451, 452, 476, 529, 539, 555, 570, 595, 605, 649, 686, 735, 769, 796, 817, 1105]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1146/1289 places, 2628/2856 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1134 transition count 2616
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1134 transition count 2616
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1122 transition count 2604
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1122 transition count 2604
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 1113 transition count 2559
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 1113 transition count 2559
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 1106 transition count 2552
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1099 transition count 2545
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1099 transition count 2545
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 1092 transition count 2510
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 1092 transition count 2510
Applied a total of 108 rules in 314 ms. Remains 1092 /1146 variables (removed 54) and now considering 2510/2628 (removed 118) transitions.
[2022-05-17 23:02:38] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 23:02:38] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:02:39] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2022-05-17 23:02:39] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 23:02:39] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-17 23:02:40] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 23:02:48] [INFO ] Implicit Places using invariants and state equation in 8968 ms returned [1083]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9991 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1289 places, 2510/2856 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 75 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2022-05-17 23:02:48] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2022-05-17 23:02:48] [INFO ] Computed 43 place invariants in 25 ms
[2022-05-17 23:02:49] [INFO ] Implicit Places using invariants in 857 ms returned []
[2022-05-17 23:02:49] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2022-05-17 23:02:49] [INFO ] Computed 43 place invariants in 18 ms
[2022-05-17 23:02:50] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 23:02:58] [INFO ] Implicit Places using invariants and state equation in 9126 ms returned []
Implicit Place search using SMT with State Equation took 9989 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1289 places, 2509/2856 transitions.
Finished structural reductions, in 3 iterations. Remains : 1090/1289 places, 2509/2856 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s467 1) (GEQ s481 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 finished in 21809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&p1))&&F(!p1)))'
Support contains 3 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1263 transition count 2798
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1263 transition count 2798
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 1245 transition count 2736
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 1245 transition count 2736
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 1238 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 1238 transition count 2701
Applied a total of 102 rules in 143 ms. Remains 1238 /1289 variables (removed 51) and now considering 2701/2856 (removed 155) transitions.
[2022-05-17 23:02:58] [INFO ] Flow matrix only has 2429 transitions (discarded 272 similar events)
// Phase 1: matrix 2429 rows 1238 cols
[2022-05-17 23:02:58] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-17 23:02:59] [INFO ] Implicit Places using invariants in 1007 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 575, 592, 609, 636, 646, 735, 823, 852, 874, 1164]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1216/1289 places, 2701/2856 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1198 transition count 2683
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1198 transition count 2683
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1180 transition count 2665
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1180 transition count 2665
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1162 transition count 2647
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1162 transition count 2647
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 123 place count 1147 transition count 2572
Iterating global reduction 0 with 15 rules applied. Total rules applied 138 place count 1147 transition count 2572
Applied a total of 138 rules in 182 ms. Remains 1147 /1216 variables (removed 69) and now considering 2572/2701 (removed 129) transitions.
[2022-05-17 23:03:00] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2022-05-17 23:03:00] [INFO ] Computed 45 place invariants in 26 ms
[2022-05-17 23:03:00] [INFO ] Implicit Places using invariants in 867 ms returned []
[2022-05-17 23:03:00] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2022-05-17 23:03:00] [INFO ] Computed 45 place invariants in 38 ms
[2022-05-17 23:03:01] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-17 23:03:10] [INFO ] Implicit Places using invariants and state equation in 9682 ms returned [1134]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10551 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1289 places, 2572/2856 transitions.
Applied a total of 0 rules in 34 ms. Remains 1146 /1146 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1146/1289 places, 2572/2856 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p1) (NOT p0)), p1, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s738 1), p0:(AND (GEQ s637 1) (GEQ s663 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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-S16C05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 finished in 12078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))||X(!(p2 U p3))||p0))))'
Support contains 8 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1263 transition count 2802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1263 transition count 2802
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 1244 transition count 2739
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 1244 transition count 2739
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 1236 transition count 2699
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 1236 transition count 2699
Applied a total of 106 rules in 167 ms. Remains 1236 /1289 variables (removed 53) and now considering 2699/2856 (removed 157) transitions.
[2022-05-17 23:03:10] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1236 cols
[2022-05-17 23:03:10] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-17 23:03:11] [INFO ] Implicit Places using invariants in 980 ms returned [11, 103, 348, 349, 386, 454, 484, 485, 512, 513, 566, 577, 594, 611, 638, 649, 697, 736, 787, 821, 850, 872, 1162]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 982 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1213/1289 places, 2699/2856 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1194 transition count 2680
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1194 transition count 2680
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1175 transition count 2661
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1175 transition count 2661
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1156 transition count 2642
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1156 transition count 2642
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 130 place count 1140 transition count 2562
Iterating global reduction 0 with 16 rules applied. Total rules applied 146 place count 1140 transition count 2562
Applied a total of 146 rules in 173 ms. Remains 1140 /1213 variables (removed 73) and now considering 2562/2699 (removed 137) transitions.
[2022-05-17 23:03:12] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:12] [INFO ] Computed 44 place invariants in 32 ms
[2022-05-17 23:03:12] [INFO ] Implicit Places using invariants in 856 ms returned []
[2022-05-17 23:03:12] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:12] [INFO ] Computed 44 place invariants in 20 ms
[2022-05-17 23:03:13] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:03:22] [INFO ] Implicit Places using invariants and state equation in 9439 ms returned []
Implicit Place search using SMT with State Equation took 10297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1289 places, 2562/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1140/1289 places, 2562/2856 transitions.
Stuttering acceptance computed with spot in 546 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s537 1) (LT s623 1)), p2:(AND (GEQ s537 1) (GEQ s623 1)), p3:(OR (AND (GEQ s590 1) (GEQ s1101 1)) (AND (GEQ s579 1) (GEQ s966 1))), p1:(OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1922 reset in 400 ms.
Product exploration explored 100000 steps with 1925 reset in 433 ms.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Incomplete random walk after 10000 steps, including 192 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 23:03:24] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:24] [INFO ] Computed 44 place invariants in 19 ms
[2022-05-17 23:03:24] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-17 23:03:24] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 14 ms returned sat
[2022-05-17 23:03:25] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-17 23:03:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-17 23:03:25] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 11 ms returned sat
[2022-05-17 23:03:26] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-17 23:03:26] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:03:26] [INFO ] After 104ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-17 23:03:26] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-17 23:03:26] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 38 place count 1121 transition count 2532
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 1110 transition count 2532
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1108 transition count 2526
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1108 transition count 2526
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 1108 transition count 2525
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1107 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1106 transition count 2520
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1106 transition count 2520
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 1089 transition count 2503
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 233 place count 1089 transition count 3448
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 364 place count 958 transition count 3448
Applied a total of 364 rules in 320 ms. Remains 958 /1140 variables (removed 182) and now considering 3448/2562 (removed -886) transitions.
Finished structural reductions, in 1 iterations. Remains : 958/1140 places, 3448/2562 transitions.
Finished random walk after 2275 steps, including 77 resets, run visited all 1 properties in 30 ms. (steps per millisecond=75 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p3) p2)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p3)]
Knowledge based reduction with 9 factoid took 766 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Support contains 8 out of 1140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Applied a total of 0 rules in 33 ms. Remains 1140 /1140 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2022-05-17 23:03:28] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:28] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:03:28] [INFO ] Implicit Places using invariants in 858 ms returned []
[2022-05-17 23:03:28] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:28] [INFO ] Computed 44 place invariants in 19 ms
[2022-05-17 23:03:29] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:03:38] [INFO ] Implicit Places using invariants and state equation in 9647 ms returned []
Implicit Place search using SMT with State Equation took 10509 ms to find 0 implicit places.
[2022-05-17 23:03:38] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:38] [INFO ] Computed 44 place invariants in 24 ms
[2022-05-17 23:03:39] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1140/1140 places, 2562/2562 transitions.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 603 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 192 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:03:40] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:40] [INFO ] Computed 44 place invariants in 28 ms
[2022-05-17 23:03:40] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-17 23:03:40] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 9 ms returned sat
[2022-05-17 23:03:41] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:03:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-17 23:03:41] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 17 ms returned sat
[2022-05-17 23:03:42] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:03:42] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:03:42] [INFO ] After 104ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:03:42] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-17 23:03:42] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 38 place count 1121 transition count 2532
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 1110 transition count 2532
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1108 transition count 2526
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1108 transition count 2526
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 1108 transition count 2525
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1107 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1106 transition count 2520
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1106 transition count 2520
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 1089 transition count 2503
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 233 place count 1089 transition count 3448
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 364 place count 958 transition count 3448
Applied a total of 364 rules in 305 ms. Remains 958 /1140 variables (removed 182) and now considering 3448/2562 (removed -886) transitions.
Finished structural reductions, in 1 iterations. Remains : 958/1140 places, 3448/2562 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 586 steps, run visited all 1 properties in 19 ms. (steps per millisecond=30 )
Probabilistic random walk after 586 steps, saw 351 distinct states, run finished after 19 ms. (steps per millisecond=30 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F p3)]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1921 reset in 392 ms.
Product exploration explored 100000 steps with 1922 reset in 403 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 2616 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Support contains 8 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 1140 transition count 2562
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 1140 transition count 2562
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1131 transition count 2553
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1131 transition count 2553
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 65 place count 1131 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1130 transition count 2552
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1130 transition count 2552
Deduced a syphon composed of 37 places in 2 ms
Applied a total of 67 rules in 225 ms. Remains 1130 /1140 variables (removed 10) and now considering 2552/2562 (removed 10) transitions.
[2022-05-17 23:03:47] [INFO ] Redundant transitions in 73 ms returned []
[2022-05-17 23:03:47] [INFO ] Flow matrix only has 2280 transitions (discarded 272 similar events)
// Phase 1: matrix 2280 rows 1130 cols
[2022-05-17 23:03:47] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:03:48] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1130/1140 places, 2552/2562 transitions.
Finished structural reductions, in 1 iterations. Remains : 1130/1140 places, 2552/2562 transitions.
Product exploration explored 100000 steps with 1923 reset in 395 ms.
Product exploration explored 100000 steps with 1922 reset in 412 ms.
Built C files in :
/tmp/ltsmin12175061691826089182
[2022-05-17 23:03:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12175061691826089182
Running compilation step : cd /tmp/ltsmin12175061691826089182;'/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/ltsmin12175061691826089182;'/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/ltsmin12175061691826089182;'/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 8 out of 1140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Applied a total of 0 rules in 40 ms. Remains 1140 /1140 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2022-05-17 23:03:52] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:52] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:03:53] [INFO ] Implicit Places using invariants in 883 ms returned []
[2022-05-17 23:03:53] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:03:53] [INFO ] Computed 44 place invariants in 19 ms
[2022-05-17 23:03:53] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:04:02] [INFO ] Implicit Places using invariants and state equation in 9165 ms returned []
Implicit Place search using SMT with State Equation took 10064 ms to find 0 implicit places.
[2022-05-17 23:04:02] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2022-05-17 23:04:02] [INFO ] Computed 44 place invariants in 20 ms
[2022-05-17 23:04:03] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1140/1140 places, 2562/2562 transitions.
Built C files in :
/tmp/ltsmin15588588547999455448
[2022-05-17 23:04:03] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15588588547999455448
Running compilation step : cd /tmp/ltsmin15588588547999455448;'/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/ltsmin15588588547999455448;'/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/ltsmin15588588547999455448;'/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-17 23:04:06] [INFO ] Flatten gal took : 85 ms
[2022-05-17 23:04:06] [INFO ] Flatten gal took : 140 ms
[2022-05-17 23:04:06] [INFO ] Time to serialize gal into /tmp/LTL727384117644531415.gal : 26 ms
[2022-05-17 23:04:07] [INFO ] Time to serialize properties into /tmp/LTL8139736452749976765.ltl : 358 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/LTL727384117644531415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8139736452749976765.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/LTL7273841...265
Read 1 LTL properties
Checking formula 0 : !((X(G(((F(G("((Node1HasAskedItsLeafSetToRx1ToReplaceNode15<1)||(LeafSetOfRx1IsSentToNode1<1))")))||(X(!(("((Node7NotifyThatHeIsActive...454
Formula 0 simplified : !XG("((Node7NotifyThatHeIsActive<1)||(Node10ThinksNode7ShouldBeNodeMasterToReplaceNode9<1))" | FG"((Node1HasAskedItsLeafSetToRx1ToRe...436
Detected timeout of ITS tools.
[2022-05-17 23:04:22] [INFO ] Flatten gal took : 71 ms
[2022-05-17 23:04:22] [INFO ] Applying decomposition
[2022-05-17 23:04:22] [INFO ] Flatten gal took : 70 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/graph5818118061709728682.txt' '-o' '/tmp/graph5818118061709728682.bin' '-w' '/tmp/graph5818118061709728682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5818118061709728682.bin' '-l' '-1' '-v' '-w' '/tmp/graph5818118061709728682.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:04:22] [INFO ] Decomposing Gal with order
[2022-05-17 23:04:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:04:22] [INFO ] Removed a total of 2892 redundant transitions.
[2022-05-17 23:04:22] [INFO ] Flatten gal took : 196 ms
[2022-05-17 23:04:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1884 labels/synchronizations in 88 ms.
[2022-05-17 23:04:22] [INFO ] Time to serialize gal into /tmp/LTL17793729249741410497.gal : 31 ms
[2022-05-17 23:04:22] [INFO ] Time to serialize properties into /tmp/LTL7356883125667456155.ltl : 30 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/LTL17793729249741410497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7356883125667456155.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1779372...246
Read 1 LTL properties
Checking formula 0 : !((X(G(((F(G("((i6.i1.u16.Node1HasAskedItsLeafSetToRx1ToReplaceNode15<1)||(i6.i1.u178.LeafSetOfRx1IsSentToNode1<1))")))||(X(!(("((i1.u...541
Formula 0 simplified : !XG("((i1.u95.Node7NotifyThatHeIsActive<1)||(i1.u102.Node10ThinksNode7ShouldBeNodeMasterToReplaceNode9<1))" | FG"((i6.i1.u16.Node1Ha...523
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7590736747217026563
[2022-05-17 23:04:38] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7590736747217026563
Running compilation step : cd /tmp/ltsmin7590736747217026563;'/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/ltsmin7590736747217026563;'/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/ltsmin7590736747217026563;'/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-S16C05-LTLFireability-12 finished in 90306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)||p0)) U G(!p1))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1261 transition count 2796
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1261 transition count 2796
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 76 place count 1241 transition count 2728
Iterating global reduction 0 with 20 rules applied. Total rules applied 96 place count 1241 transition count 2728
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 1233 transition count 2688
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 1233 transition count 2688
Applied a total of 112 rules in 156 ms. Remains 1233 /1289 variables (removed 56) and now considering 2688/2856 (removed 168) transitions.
[2022-05-17 23:04:41] [INFO ] Flow matrix only has 2416 transitions (discarded 272 similar events)
// Phase 1: matrix 2416 rows 1233 cols
[2022-05-17 23:04:41] [INFO ] Computed 67 place invariants in 19 ms
[2022-05-17 23:04:42] [INFO ] Implicit Places using invariants in 1023 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 575, 592, 609, 636, 646, 694, 733, 784, 818, 847, 869, 1159]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1289 places, 2688/2856 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1189 transition count 2668
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1189 transition count 2668
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1169 transition count 2648
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1169 transition count 2648
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 1149 transition count 2628
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 1149 transition count 2628
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 137 place count 1132 transition count 2543
Iterating global reduction 0 with 17 rules applied. Total rules applied 154 place count 1132 transition count 2543
Applied a total of 154 rules in 192 ms. Remains 1132 /1209 variables (removed 77) and now considering 2543/2688 (removed 145) transitions.
[2022-05-17 23:04:42] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1132 cols
[2022-05-17 23:04:42] [INFO ] Computed 43 place invariants in 25 ms
[2022-05-17 23:04:43] [INFO ] Implicit Places using invariants in 925 ms returned []
[2022-05-17 23:04:43] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1132 cols
[2022-05-17 23:04:43] [INFO ] Computed 43 place invariants in 19 ms
[2022-05-17 23:04:44] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:04:52] [INFO ] Implicit Places using invariants and state equation in 9167 ms returned [1104, 1119]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10094 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1130/1289 places, 2543/2856 transitions.
Applied a total of 0 rules in 34 ms. Remains 1130 /1130 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1130/1289 places, 2543/2856 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s198 1) (GEQ s625 1)), p0:(AND (GEQ s506 1) (GEQ s880 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25057 reset in 908 ms.
Product exploration explored 100000 steps with 25073 reset in 937 ms.
Computed a total of 298 stabilizing places and 910 stable transitions
Computed a total of 298 stabilizing places and 910 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1002 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[p1, (AND (NOT p1) (NOT p0)), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 191 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 74728 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74728 steps, saw 31937 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-17 23:04:59] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1130 cols
[2022-05-17 23:04:59] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-17 23:04:59] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-17 23:04:59] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:00] [INFO ] After 812ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 23:05:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 23:05:00] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:01] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-17 23:05:01] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:05:01] [INFO ] After 520ms SMT Verify possible using 826 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-17 23:05:02] [INFO ] Deduced a trap composed of 97 places in 415 ms of which 1 ms to minimize.
[2022-05-17 23:05:02] [INFO ] Deduced a trap composed of 370 places in 414 ms of which 1 ms to minimize.
[2022-05-17 23:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1007 ms
[2022-05-17 23:05:03] [INFO ] After 1953ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 329 ms.
[2022-05-17 23:05:03] [INFO ] After 3395ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1130 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1130/1130 places, 2543/2543 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1130 transition count 2521
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1108 transition count 2521
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 1108 transition count 2511
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 1098 transition count 2511
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1082 transition count 2495
Free-agglomeration rule (complex) applied 118 times.
Iterating global reduction 2 with 118 rules applied. Total rules applied 214 place count 1082 transition count 2917
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 2 with 118 rules applied. Total rules applied 332 place count 964 transition count 2917
Applied a total of 332 rules in 221 ms. Remains 964 /1130 variables (removed 166) and now considering 2917/2543 (removed -374) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/1130 places, 2917/2543 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76567 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76567 steps, saw 32027 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 23:05:07] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:05:07] [INFO ] Computed 41 place invariants in 38 ms
[2022-05-17 23:05:07] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-17 23:05:07] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:08] [INFO ] After 809ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-17 23:05:08] [INFO ] State equation strengthened by 1366 read => feed constraints.
[2022-05-17 23:05:08] [INFO ] After 152ms SMT Verify possible using 1366 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:05:08] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:05:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-17 23:05:08] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 7 ms returned sat
[2022-05-17 23:05:09] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:05:10] [INFO ] After 769ms SMT Verify possible using 1366 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 23:05:10] [INFO ] Deduced a trap composed of 194 places in 353 ms of which 1 ms to minimize.
[2022-05-17 23:05:10] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 1 ms to minimize.
[2022-05-17 23:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 929 ms
[2022-05-17 23:05:11] [INFO ] After 2185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 404 ms.
[2022-05-17 23:05:11] [INFO ] After 3613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 964 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 964/964 places, 2917/2917 transitions.
Applied a total of 0 rules in 81 ms. Remains 964 /964 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/964 places, 2917/2917 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 964/964 places, 2917/2917 transitions.
Applied a total of 0 rules in 65 ms. Remains 964 /964 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2022-05-17 23:05:12] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:05:12] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-17 23:05:12] [INFO ] Implicit Places using invariants in 857 ms returned []
[2022-05-17 23:05:12] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:05:12] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-17 23:05:13] [INFO ] State equation strengthened by 1366 read => feed constraints.
[2022-05-17 23:05:24] [INFO ] Implicit Places using invariants and state equation in 11449 ms returned []
Implicit Place search using SMT with State Equation took 12311 ms to find 0 implicit places.
[2022-05-17 23:05:24] [INFO ] Redundant transitions in 92 ms returned []
[2022-05-17 23:05:24] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:05:24] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:05:25] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 964/964 places, 2917/2917 transitions.
Graph (trivial) has 1040 edges and 964 vertex of which 16 / 964 are part of one of the 1 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 255 transitions
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 652 transitions.
Graph (complete) has 3471 edges and 949 vertex of which 935 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1622.t1589 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 98 rules applied. Total rules applied 100 place count 918 transition count 2167
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 1 with 274 rules applied. Total rules applied 374 place count 822 transition count 1989
Reduce places removed 89 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 2 with 241 rules applied. Total rules applied 615 place count 733 transition count 1837
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 192 rules applied. Total rules applied 807 place count 667 transition count 1711
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 167 rules applied. Total rules applied 974 place count 604 transition count 1607
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 5 with 125 rules applied. Total rules applied 1099 place count 560 transition count 1526
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 6 with 102 rules applied. Total rules applied 1201 place count 520 transition count 1464
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 69 rules applied. Total rules applied 1270 place count 495 transition count 1420
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 8 with 54 rules applied. Total rules applied 1324 place count 473 transition count 1388
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 9 with 33 rules applied. Total rules applied 1357 place count 460 transition count 1368
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 20 rules applied. Total rules applied 1377 place count 450 transition count 1358
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 11 with 14 rules applied. Total rules applied 1391 place count 447 transition count 1347
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 1403 place count 436 transition count 1346
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 4 Pre rules applied. Total rules applied 1403 place count 436 transition count 1342
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1411 place count 432 transition count 1342
Discarding 244 places :
Symmetric choice reduction at 13 with 244 rule applications. Total rules 1655 place count 188 transition count 623
Iterating global reduction 13 with 244 rules applied. Total rules applied 1899 place count 188 transition count 623
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 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 13 with 222 rules applied. Total rules applied 2121 place count 188 transition count 401
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 11 rules applied. Total rules applied 2132 place count 178 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2133 place count 177 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2133 place count 177 transition count 399
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2135 place count 176 transition count 399
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2145 place count 166 transition count 389
Iterating global reduction 16 with 10 rules applied. Total rules applied 2155 place count 166 transition count 389
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 16 with 140 rules applied. Total rules applied 2295 place count 96 transition count 319
Drop transitions removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 16 with 67 rules applied. Total rules applied 2362 place count 96 transition count 252
Discarding 31 places :
Symmetric choice reduction at 17 with 31 rule applications. Total rules 2393 place count 65 transition count 130
Iterating global reduction 17 with 31 rules applied. Total rules applied 2424 place count 65 transition count 130
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 17 with 27 rules applied. Total rules applied 2451 place count 65 transition count 103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 18 with 19 rules applied. Total rules applied 2470 place count 65 transition count 84
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 18 with 7 rules applied. Total rules applied 2477 place count 65 transition count 77
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 8 rules applied. Total rules applied 2485 place count 58 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 2486 place count 57 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 2486 place count 57 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 2488 place count 56 transition count 75
Discarding 9 places :
Symmetric choice reduction at 21 with 9 rule applications. Total rules 2497 place count 47 transition count 54
Iterating global reduction 21 with 9 rules applied. Total rules applied 2506 place count 47 transition count 54
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 21 with 13 rules applied. Total rules applied 2519 place count 47 transition count 41
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 2521 place count 45 transition count 39
Iterating global reduction 22 with 2 rules applied. Total rules applied 2523 place count 45 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 2525 place count 44 transition count 46
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 22 with 6 rules applied. Total rules applied 2531 place count 44 transition count 40
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2537 place count 38 transition count 40
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 23 with 10 rules applied. Total rules applied 2547 place count 38 transition count 40
Applied a total of 2547 rules in 354 ms. Remains 38 /964 variables (removed 926) and now considering 40/2917 (removed 2877) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 40 rows 38 cols
[2022-05-17 23:05:25] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:05:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:05:25] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 23:05:25] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-17 23:05:25] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 23:05:25] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:05:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:05:25] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:05:25] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:05:25] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 23:05:25] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 23:05:25] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:05:25] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:05:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17712110072226646359.gal : 0 ms
[2022-05-17 23:05:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15100772484823630732.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1792098153650915238;'/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/ReachabilityCardinality17712110072226646359.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15100772484823630732.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...321
Loading property file /tmp/ReachabilityCardinality15100772484823630732.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 27
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :27 after 50
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :50 after 87
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :87 after 596
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,1747,0.019192,4460,2,508,10,2237,10,0,192,1529,0
Total reachable state count : 1747
Verifying 4 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,35,0.019735,4460,2,169,10,2237,10,0,195,1529,0
Reachability property apf2 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
apf2,35,0.020645,4460,2,169,10,2237,10,0,198,1529,0
Reachability property apf3 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
apf3,35,0.021097,4460,2,169,10,2237,10,0,198,1529,0
Reachability property apf4 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
apf4,1,0.02166,4460,2,39,10,2237,10,0,201,1529,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 559 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[true, p1]
Stuttering acceptance computed with spot in 40 ms :[true, p1]
Support contains 2 out of 1130 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 : 1130/1130 places, 2543/2543 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1130 transition count 2521
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1108 transition count 2521
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 1108 transition count 2511
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 1098 transition count 2511
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1082 transition count 2495
Applied a total of 96 rules in 130 ms. Remains 1082 /1130 variables (removed 48) and now considering 2495/2543 (removed 48) transitions.
[2022-05-17 23:05:26] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:05:26] [INFO ] Computed 41 place invariants in 34 ms
[2022-05-17 23:05:27] [INFO ] Implicit Places using invariants in 828 ms returned []
[2022-05-17 23:05:27] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:05:27] [INFO ] Computed 41 place invariants in 34 ms
[2022-05-17 23:05:28] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:05:35] [INFO ] Implicit Places using invariants and state equation in 7948 ms returned []
Implicit Place search using SMT with State Equation took 8778 ms to find 0 implicit places.
[2022-05-17 23:05:35] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-17 23:05:35] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:05:35] [INFO ] Computed 41 place invariants in 18 ms
[2022-05-17 23:05:36] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1082/1130 places, 2495/2543 transitions.
Finished structural reductions, in 1 iterations. Remains : 1082/1130 places, 2495/2543 transitions.
Computed a total of 266 stabilizing places and 878 stable transitions
Computed a total of 266 stabilizing places and 878 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[true, p1]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94496 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94496 steps, saw 39602 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:05:39] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:05:39] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:05:39] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 23:05:39] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:40] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:05:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 23:05:40] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:41] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:05:41] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:05:41] [INFO ] After 196ms SMT Verify possible using 826 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:05:41] [INFO ] Deduced a trap composed of 68 places in 390 ms of which 0 ms to minimize.
[2022-05-17 23:05:42] [INFO ] Deduced a trap composed of 296 places in 376 ms of which 1 ms to minimize.
[2022-05-17 23:05:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 934 ms
[2022-05-17 23:05:42] [INFO ] After 1178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-17 23:05:42] [INFO ] After 2008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1082/1082 places, 2495/2495 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1081 transition count 2494
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 133 place count 1081 transition count 3443
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 264 place count 950 transition count 3443
Applied a total of 264 rules in 211 ms. Remains 950 /1082 variables (removed 132) and now considering 3443/2495 (removed -948) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/1082 places, 3443/2495 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85476 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85476 steps, saw 35611 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:05:45] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:05:45] [INFO ] Computed 41 place invariants in 29 ms
[2022-05-17 23:05:46] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-17 23:05:46] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:46] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:05:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-17 23:05:46] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:05:47] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:05:47] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:05:47] [INFO ] After 309ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:05:48] [INFO ] Deduced a trap composed of 56 places in 440 ms of which 1 ms to minimize.
[2022-05-17 23:05:48] [INFO ] Deduced a trap composed of 242 places in 398 ms of which 1 ms to minimize.
[2022-05-17 23:05:49] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 1 ms to minimize.
[2022-05-17 23:05:50] [INFO ] Deduced a trap composed of 137 places in 442 ms of which 1 ms to minimize.
[2022-05-17 23:05:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2074 ms
[2022-05-17 23:05:50] [INFO ] After 2447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-17 23:05:50] [INFO ] After 3478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 3443/3443 transitions.
Applied a total of 0 rules in 79 ms. Remains 950 /950 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 3443/3443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 3443/3443 transitions.
Applied a total of 0 rules in 82 ms. Remains 950 /950 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
[2022-05-17 23:05:50] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:05:50] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-17 23:05:51] [INFO ] Implicit Places using invariants in 967 ms returned []
[2022-05-17 23:05:51] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:05:51] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:05:52] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:06:08] [INFO ] Implicit Places using invariants and state equation in 16772 ms returned []
Implicit Place search using SMT with State Equation took 17740 ms to find 0 implicit places.
[2022-05-17 23:06:08] [INFO ] Redundant transitions in 134 ms returned []
[2022-05-17 23:06:08] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:06:08] [INFO ] Computed 41 place invariants in 26 ms
[2022-05-17 23:06:09] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 3443/3443 transitions.
Graph (trivial) has 1043 edges and 950 vertex of which 17 / 950 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3969 edges and 934 vertex of which 920 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1271.t1241 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 903 transition count 2674
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 806 transition count 2481
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 710 transition count 2313
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 638 transition count 2171
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 568 transition count 2051
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 147 rules applied. Total rules applied 1206 place count 518 transition count 1954
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1331 place count 471 transition count 1876
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1422 place count 440 transition count 1816
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 76 rules applied. Total rules applied 1498 place count 411 transition count 1769
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1550 place count 393 transition count 1735
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1590 place count 377 transition count 1711
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1612 place count 369 transition count 1697
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1626 place count 363 transition count 1689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1631 place count 361 transition count 1686
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1633 place count 360 transition count 1685
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 8 Pre rules applied. Total rules applied 1633 place count 360 transition count 1677
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 1649 place count 352 transition count 1677
Discarding 285 places :
Symmetric choice reduction at 15 with 285 rule applications. Total rules 1934 place count 67 transition count 316
Iterating global reduction 15 with 285 rules applied. Total rules applied 2219 place count 67 transition count 316
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 265 rules applied. Total rules applied 2484 place count 67 transition count 51
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2497 place count 55 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2498 place count 54 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2498 place count 54 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2500 place count 53 transition count 49
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2512 place count 41 transition count 37
Iterating global reduction 18 with 12 rules applied. Total rules applied 2524 place count 41 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2526 place count 40 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2527 place count 40 transition count 35
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 18 with 11 rules applied. Total rules applied 2538 place count 40 transition count 24
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 18 with 11 rules applied. Total rules applied 2549 place count 29 transition count 24
Applied a total of 2549 rules in 279 ms. Remains 29 /950 variables (removed 921) and now considering 24/3443 (removed 3419) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 29 cols
[2022-05-17 23:06:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:06:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:06:09] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:06:09] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 23:06:09] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 23:06:09] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 23:06:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:06:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:06:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11926966638783744641.gal : 0 ms
[2022-05-17 23:06:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3506056658020384166.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9234464250759244424;'/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/ReachabilityCardinality11926966638783744641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3506056658020384166.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/ReachabilityCardinality3506056658020384166.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 410
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,503,0.013408,3852,2,459,10,1517,7,0,130,1121,0
Total reachable state count : 503
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,2,0.013774,4292,2,33,10,1517,7,0,133,1121,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[true, p1]
Stuttering acceptance computed with spot in 36 ms :[true, p1]
Stuttering acceptance computed with spot in 42 ms :[true, p1]
Product exploration explored 100000 steps with 2727 reset in 473 ms.
Product exploration explored 100000 steps with 2728 reset in 488 ms.
Built C files in :
/tmp/ltsmin13922895611635388793
[2022-05-17 23:06:10] [INFO ] Too many transitions (2495) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:06:11] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13922895611635388793
Running compilation step : cd /tmp/ltsmin13922895611635388793;'/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/ltsmin13922895611635388793;'/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/ltsmin13922895611635388793;'/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 1082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1082/1082 places, 2495/2495 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1081 transition count 2494
Applied a total of 2 rules in 103 ms. Remains 1081 /1082 variables (removed 1) and now considering 2494/2495 (removed 1) transitions.
[2022-05-17 23:06:14] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:06:14] [INFO ] Computed 41 place invariants in 40 ms
[2022-05-17 23:06:15] [INFO ] Implicit Places using invariants in 993 ms returned []
[2022-05-17 23:06:15] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:06:15] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:06:15] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:06:23] [INFO ] Implicit Places using invariants and state equation in 8022 ms returned []
Implicit Place search using SMT with State Equation took 9018 ms to find 0 implicit places.
[2022-05-17 23:06:23] [INFO ] Redundant transitions in 69 ms returned []
[2022-05-17 23:06:23] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:06:23] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-17 23:06:24] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1082 places, 2494/2495 transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1082 places, 2494/2495 transitions.
Built C files in :
/tmp/ltsmin9426739177378665260
[2022-05-17 23:06:24] [INFO ] Too many transitions (2494) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:06:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9426739177378665260
Running compilation step : cd /tmp/ltsmin9426739177378665260;'/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/ltsmin9426739177378665260;'/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/ltsmin9426739177378665260;'/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-17 23:06:27] [INFO ] Flatten gal took : 62 ms
[2022-05-17 23:06:27] [INFO ] Flatten gal took : 57 ms
[2022-05-17 23:06:27] [INFO ] Time to serialize gal into /tmp/LTL50851979437007391.gal : 8 ms
[2022-05-17 23:06:27] [INFO ] Time to serialize properties into /tmp/LTL924656801197808039.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/LTL50851979437007391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL924656801197808039.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/LTL5085197...263
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode6>=1))"))||("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashO...273
Formula 0 simplified : !G(X("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode6>=1))" | G"((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode...260
Detected timeout of ITS tools.
[2022-05-17 23:06:43] [INFO ] Flatten gal took : 56 ms
[2022-05-17 23:06:43] [INFO ] Applying decomposition
[2022-05-17 23:06:43] [INFO ] Flatten gal took : 56 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/graph6606647949750869010.txt' '-o' '/tmp/graph6606647949750869010.bin' '-w' '/tmp/graph6606647949750869010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6606647949750869010.bin' '-l' '-1' '-v' '-w' '/tmp/graph6606647949750869010.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:06:43] [INFO ] Decomposing Gal with order
[2022-05-17 23:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:06:43] [INFO ] Removed a total of 2204 redundant transitions.
[2022-05-17 23:06:43] [INFO ] Flatten gal took : 248 ms
[2022-05-17 23:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1447 labels/synchronizations in 50 ms.
[2022-05-17 23:06:43] [INFO ] Time to serialize gal into /tmp/LTL1838238226266158309.gal : 13 ms
[2022-05-17 23:06:43] [INFO ] Time to serialize properties into /tmp/LTL4165290186572075799.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/LTL1838238226266158309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4165290186572075799.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1838238...245
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((u0.Node6IsTheNodeMaster>=1)&&(u123.Node15HasDetectedCrashOfNode6>=1))"))||("((u0.Node6IsTheNodeMaster>=1)&&(u123.Node15H...306
Formula 0 simplified : !G(X("((u0.Node6IsTheNodeMaster>=1)&&(u123.Node15HasDetectedCrashOfNode6>=1))" | G"((u0.Node6IsTheNodeMaster>=1)&&(u123.Node15HasDet...293
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11172390175130503683
[2022-05-17 23:06:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11172390175130503683
Running compilation step : cd /tmp/ltsmin11172390175130503683;'/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/ltsmin11172390175130503683;'/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/ltsmin11172390175130503683;'/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-S16C05-LTLFireability-13 finished in 140684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))&&F(X(X((!p1 U p1)))))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 1270 transition count 2815
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 1248 transition count 2815
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 100 place count 1230 transition count 2769
Iterating global reduction 2 with 18 rules applied. Total rules applied 118 place count 1230 transition count 2769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 1230 transition count 2768
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1229 transition count 2768
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 131 place count 1218 transition count 2713
Iterating global reduction 2 with 11 rules applied. Total rules applied 142 place count 1218 transition count 2713
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 206 place count 1186 transition count 2681
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 214 place count 1178 transition count 2673
Iterating global reduction 2 with 8 rules applied. Total rules applied 222 place count 1178 transition count 2673
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 1170 transition count 2633
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 1170 transition count 2633
Applied a total of 238 rules in 396 ms. Remains 1170 /1289 variables (removed 119) and now considering 2633/2856 (removed 223) transitions.
[2022-05-17 23:07:02] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1170 cols
[2022-05-17 23:07:02] [INFO ] Computed 67 place invariants in 41 ms
[2022-05-17 23:07:03] [INFO ] Implicit Places using invariants in 992 ms returned [9, 95, 225, 321, 322, 356, 422, 452, 480, 481, 531, 541, 557, 572, 597, 607, 651, 688, 737, 771, 798, 819, 1107]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1147/1289 places, 2633/2856 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1136 transition count 2622
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1136 transition count 2622
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1125 transition count 2611
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1125 transition count 2611
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1118 transition count 2576
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1118 transition count 2576
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 1110 transition count 2568
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1102 transition count 2560
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1102 transition count 2560
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 1093 transition count 2515
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 1093 transition count 2515
Applied a total of 108 rules in 342 ms. Remains 1093 /1147 variables (removed 54) and now considering 2515/2633 (removed 118) transitions.
[2022-05-17 23:07:03] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:07:03] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:07:04] [INFO ] Implicit Places using invariants in 807 ms returned []
[2022-05-17 23:07:04] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:07:04] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:07:05] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:07:13] [INFO ] Implicit Places using invariants and state equation in 8717 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9526 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1289 places, 2515/2856 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1092 transition count 2514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2514
Applied a total of 2 rules in 83 ms. Remains 1091 /1092 variables (removed 1) and now considering 2514/2515 (removed 1) transitions.
[2022-05-17 23:07:13] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2022-05-17 23:07:13] [INFO ] Computed 43 place invariants in 25 ms
[2022-05-17 23:07:13] [INFO ] Implicit Places using invariants in 835 ms returned []
[2022-05-17 23:07:13] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2022-05-17 23:07:13] [INFO ] Computed 43 place invariants in 17 ms
[2022-05-17 23:07:14] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:07:22] [INFO ] Implicit Places using invariants and state equation in 8425 ms returned []
Implicit Place search using SMT with State Equation took 9261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1289 places, 2514/2856 transitions.
Finished structural reductions, in 3 iterations. Remains : 1091/1289 places, 2514/2856 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s444 1) (GEQ s1076 1)), p1:(AND (GEQ s442 1) (GEQ s449 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 finished in 20736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1261 transition count 2796
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1261 transition count 2796
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 76 place count 1241 transition count 2728
Iterating global reduction 0 with 20 rules applied. Total rules applied 96 place count 1241 transition count 2728
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 1233 transition count 2688
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 1233 transition count 2688
Applied a total of 112 rules in 160 ms. Remains 1233 /1289 variables (removed 56) and now considering 2688/2856 (removed 168) transitions.
[2022-05-17 23:07:22] [INFO ] Flow matrix only has 2416 transitions (discarded 272 similar events)
// Phase 1: matrix 2416 rows 1233 cols
[2022-05-17 23:07:22] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-17 23:07:23] [INFO ] Implicit Places using invariants in 929 ms returned [11, 103, 246, 346, 347, 384, 452, 482, 483, 510, 511, 564, 592, 609, 636, 646, 694, 733, 784, 818, 847, 1159]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 931 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1211/1289 places, 2688/2856 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1191 transition count 2668
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1191 transition count 2668
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1171 transition count 2648
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1171 transition count 2648
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 1151 transition count 2628
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 1151 transition count 2628
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 137 place count 1134 transition count 2543
Iterating global reduction 0 with 17 rules applied. Total rules applied 154 place count 1134 transition count 2543
Applied a total of 154 rules in 191 ms. Remains 1134 /1211 variables (removed 77) and now considering 2543/2688 (removed 145) transitions.
[2022-05-17 23:07:23] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1134 cols
[2022-05-17 23:07:23] [INFO ] Computed 45 place invariants in 29 ms
[2022-05-17 23:07:24] [INFO ] Implicit Places using invariants in 825 ms returned []
[2022-05-17 23:07:24] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1134 cols
[2022-05-17 23:07:24] [INFO ] Computed 45 place invariants in 26 ms
[2022-05-17 23:07:25] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:07:33] [INFO ] Implicit Places using invariants and state equation in 9227 ms returned [1106, 1121]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10058 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1132/1289 places, 2543/2856 transitions.
Applied a total of 0 rules in 34 ms. Remains 1132 /1132 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1132/1289 places, 2543/2856 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s530 1) (LT s791 1) (LT s792 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7008 steps with 134 reset in 32 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 finished in 11501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!G(F(p0))&&F(!p1)&&!p2) U (p3 U p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a CL insensitive property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 38 place count 1270 transition count 2814
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 84 place count 1247 transition count 2814
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 103 place count 1228 transition count 2767
Iterating global reduction 2 with 19 rules applied. Total rules applied 122 place count 1228 transition count 2767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 1228 transition count 2765
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 1226 transition count 2765
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 138 place count 1214 transition count 2705
Iterating global reduction 2 with 12 rules applied. Total rules applied 150 place count 1214 transition count 2705
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 212 place count 1183 transition count 2674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 220 place count 1175 transition count 2666
Iterating global reduction 2 with 8 rules applied. Total rules applied 228 place count 1175 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 236 place count 1167 transition count 2626
Iterating global reduction 2 with 8 rules applied. Total rules applied 244 place count 1167 transition count 2626
Applied a total of 244 rules in 335 ms. Remains 1167 /1289 variables (removed 122) and now considering 2626/2856 (removed 230) transitions.
[2022-05-17 23:07:34] [INFO ] Flow matrix only has 2354 transitions (discarded 272 similar events)
// Phase 1: matrix 2354 rows 1167 cols
[2022-05-17 23:07:34] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-17 23:07:35] [INFO ] Implicit Places using invariants in 974 ms returned [9, 94, 224, 320, 321, 355, 421, 451, 452, 475, 476, 526, 536, 552, 567, 592, 602, 646, 683, 733, 767, 794, 815, 1103]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 981 ms to find 24 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1143/1289 places, 2626/2856 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1130 transition count 2613
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1130 transition count 2613
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1117 transition count 2600
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1117 transition count 2600
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1108 transition count 2555
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1108 transition count 2555
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1101 transition count 2548
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1094 transition count 2541
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1094 transition count 2541
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 1086 transition count 2501
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 1086 transition count 2501
Applied a total of 114 rules in 295 ms. Remains 1086 /1143 variables (removed 57) and now considering 2501/2626 (removed 125) transitions.
[2022-05-17 23:07:35] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1086 cols
[2022-05-17 23:07:35] [INFO ] Computed 43 place invariants in 26 ms
[2022-05-17 23:07:36] [INFO ] Implicit Places using invariants in 842 ms returned []
[2022-05-17 23:07:36] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1086 cols
[2022-05-17 23:07:36] [INFO ] Computed 43 place invariants in 28 ms
[2022-05-17 23:07:37] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:07:45] [INFO ] Implicit Places using invariants and state equation in 8574 ms returned [1064]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9418 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1085/1289 places, 2501/2856 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1085 transition count 2500
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1084 transition count 2500
Applied a total of 2 rules in 51 ms. Remains 1084 /1085 variables (removed 1) and now considering 2500/2501 (removed 1) transitions.
[2022-05-17 23:07:45] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:07:45] [INFO ] Computed 42 place invariants in 31 ms
[2022-05-17 23:07:46] [INFO ] Implicit Places using invariants in 823 ms returned []
[2022-05-17 23:07:46] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:07:46] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-17 23:07:46] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:07:55] [INFO ] Implicit Places using invariants and state equation in 9350 ms returned []
Implicit Place search using SMT with State Equation took 10177 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 1084/1289 places, 2500/2856 transitions.
Finished structural reductions, in 3 iterations. Remains : 1084/1289 places, 2500/2856 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 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=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s656 1) (LT s1075 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 992 ms.
Product exploration explored 100000 steps with 25000 reset in 1070 ms.
Computed a total of 269 stabilizing places and 884 stable transitions
Computed a total of 269 stabilizing places and 884 stable transitions
Detected a total of 269/1084 stabilizing places and 884/2500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 274 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5149 steps, run visited all 1 properties in 173 ms. (steps per millisecond=29 )
Probabilistic random walk after 5149 steps, saw 2246 distinct states, run finished after 174 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 386 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 2500/2500 transitions.
Applied a total of 0 rules in 39 ms. Remains 1084 /1084 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2022-05-17 23:07:58] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:07:59] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-17 23:07:59] [INFO ] Implicit Places using invariants in 824 ms returned []
[2022-05-17 23:07:59] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:07:59] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-17 23:08:00] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:08:08] [INFO ] Implicit Places using invariants and state equation in 8866 ms returned []
Implicit Place search using SMT with State Equation took 9690 ms to find 0 implicit places.
[2022-05-17 23:08:08] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:08:08] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-17 23:08:09] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/1084 places, 2500/2500 transitions.
Computed a total of 269 stabilizing places and 884 stable transitions
Computed a total of 269 stabilizing places and 884 stable transitions
Detected a total of 269/1084 stabilizing places and 884/2500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5149 steps, run visited all 1 properties in 164 ms. (steps per millisecond=31 )
Probabilistic random walk after 5149 steps, saw 2246 distinct states, run finished after 165 ms. (steps per millisecond=31 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 924 ms.
Product exploration explored 100000 steps with 25000 reset in 976 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 2500/2500 transitions.
Applied a total of 0 rules in 63 ms. Remains 1084 /1084 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2022-05-17 23:08:12] [INFO ] Redundant transitions in 72 ms returned []
[2022-05-17 23:08:12] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:08:12] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-17 23:08:13] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/1084 places, 2500/2500 transitions.
Product exploration explored 100000 steps with 25000 reset in 4327 ms.
Product exploration explored 100000 steps with 25000 reset in 4360 ms.
Built C files in :
/tmp/ltsmin959022833930136831
[2022-05-17 23:08:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin959022833930136831
Running compilation step : cd /tmp/ltsmin959022833930136831;'/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/ltsmin959022833930136831;'/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/ltsmin959022833930136831;'/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 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 2500/2500 transitions.
Applied a total of 0 rules in 39 ms. Remains 1084 /1084 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2022-05-17 23:08:26] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:08:26] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-17 23:08:27] [INFO ] Implicit Places using invariants in 839 ms returned []
[2022-05-17 23:08:27] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:08:27] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-17 23:08:28] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-17 23:08:36] [INFO ] Implicit Places using invariants and state equation in 8711 ms returned []
Implicit Place search using SMT with State Equation took 9551 ms to find 0 implicit places.
[2022-05-17 23:08:36] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2022-05-17 23:08:36] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-17 23:08:37] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/1084 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin11142371823506947612
[2022-05-17 23:08:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11142371823506947612
Running compilation step : cd /tmp/ltsmin11142371823506947612;'/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/ltsmin11142371823506947612;'/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/ltsmin11142371823506947612;'/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-17 23:08:40] [INFO ] Flatten gal took : 58 ms
[2022-05-17 23:08:40] [INFO ] Flatten gal took : 59 ms
[2022-05-17 23:08:40] [INFO ] Time to serialize gal into /tmp/LTL3728618387216944102.gal : 7 ms
[2022-05-17 23:08:40] [INFO ] Time to serialize properties into /tmp/LTL10259480871126336237.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/LTL3728618387216944102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10259480871126336237.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/LTL3728618...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((Node12ManageTheCrashOfNode9<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((Node12ManageTheCrashOfNode9<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2022-05-17 23:08:55] [INFO ] Flatten gal took : 56 ms
[2022-05-17 23:08:55] [INFO ] Applying decomposition
[2022-05-17 23:08:55] [INFO ] Flatten gal took : 84 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/graph3353796477810668609.txt' '-o' '/tmp/graph3353796477810668609.bin' '-w' '/tmp/graph3353796477810668609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3353796477810668609.bin' '-l' '-1' '-v' '-w' '/tmp/graph3353796477810668609.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:08:55] [INFO ] Decomposing Gal with order
[2022-05-17 23:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:08:55] [INFO ] Removed a total of 2237 redundant transitions.
[2022-05-17 23:08:55] [INFO ] Flatten gal took : 244 ms
[2022-05-17 23:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1460 labels/synchronizations in 46 ms.
[2022-05-17 23:08:56] [INFO ] Time to serialize gal into /tmp/LTL18126453608581727920.gal : 17 ms
[2022-05-17 23:08:56] [INFO ] Time to serialize properties into /tmp/LTL11234964124419126112.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/LTL18126453608581727920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11234964124419126112.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1812645...247
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i17.i0.u17.Node12ManageTheCrashOfNode9<1)||(i17.i3.u158.Rx3IsAtTheRightExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((i17.i0.u17.Node12ManageTheCrashOfNode9<1)||(i17.i3.u158.Rx3IsAtTheRightExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8713189752214528166
[2022-05-17 23:09:11] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8713189752214528166
Running compilation step : cd /tmp/ltsmin8713189752214528166;'/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/ltsmin8713189752214528166;'/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/ltsmin8713189752214528166;'/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-S16C05-LTLFireability-09 finished in 100002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))||X(!(p2 U p3))||p0))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Support contains 8 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 1270 transition count 2815
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 1248 transition count 2815
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 100 place count 1230 transition count 2769
Iterating global reduction 2 with 18 rules applied. Total rules applied 118 place count 1230 transition count 2769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 1230 transition count 2768
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1229 transition count 2768
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 131 place count 1218 transition count 2713
Iterating global reduction 2 with 11 rules applied. Total rules applied 142 place count 1218 transition count 2713
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 206 place count 1186 transition count 2681
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 214 place count 1178 transition count 2673
Iterating global reduction 2 with 8 rules applied. Total rules applied 222 place count 1178 transition count 2673
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 1170 transition count 2633
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 1170 transition count 2633
Applied a total of 238 rules in 327 ms. Remains 1170 /1289 variables (removed 119) and now considering 2633/2856 (removed 223) transitions.
[2022-05-17 23:09:14] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1170 cols
[2022-05-17 23:09:14] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-17 23:09:15] [INFO ] Implicit Places using invariants in 988 ms returned [9, 95, 324, 325, 359, 425, 455, 456, 479, 480, 530, 540, 556, 571, 596, 607, 651, 688, 737, 771, 798, 819, 1107]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 991 ms to find 23 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1147/1289 places, 2633/2856 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1136 transition count 2622
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1136 transition count 2622
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1125 transition count 2611
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1125 transition count 2611
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1118 transition count 2576
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1118 transition count 2576
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 1110 transition count 2568
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1102 transition count 2560
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1102 transition count 2560
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 1093 transition count 2515
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 1093 transition count 2515
Applied a total of 108 rules in 299 ms. Remains 1093 /1147 variables (removed 54) and now considering 2515/2633 (removed 118) transitions.
[2022-05-17 23:09:15] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:15] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:09:16] [INFO ] Implicit Places using invariants in 881 ms returned []
[2022-05-17 23:09:16] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:16] [INFO ] Computed 44 place invariants in 19 ms
[2022-05-17 23:09:17] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:09:25] [INFO ] Implicit Places using invariants and state equation in 8828 ms returned []
Implicit Place search using SMT with State Equation took 9710 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1093/1289 places, 2515/2856 transitions.
Finished structural reductions, in 2 iterations. Remains : 1093/1289 places, 2515/2856 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s511 1) (LT s593 1)), p2:(AND (GEQ s511 1) (GEQ s593 1)), p3:(OR (AND (GEQ s561 1) (GEQ s1064 1)) (AND (GEQ s551 1) (GEQ s931 1))), p1:(OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2720 reset in 467 ms.
Product exploration explored 100000 steps with 2721 reset in 483 ms.
Computed a total of 278 stabilizing places and 899 stable transitions
Computed a total of 278 stabilizing places and 899 stable transitions
Detected a total of 278/1093 stabilizing places and 899/2515 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 23:09:27] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:27] [INFO ] Computed 44 place invariants in 19 ms
[2022-05-17 23:09:27] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-17 23:09:27] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 11 ms returned sat
[2022-05-17 23:09:27] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-17 23:09:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-17 23:09:27] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-17 23:09:28] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-17 23:09:28] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:09:28] [INFO ] After 193ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-17 23:09:29] [INFO ] Deduced a trap composed of 86 places in 410 ms of which 1 ms to minimize.
[2022-05-17 23:09:29] [INFO ] Deduced a trap composed of 250 places in 421 ms of which 1 ms to minimize.
[2022-05-17 23:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1017 ms
[2022-05-17 23:09:30] [INFO ] Deduced a trap composed of 62 places in 429 ms of which 1 ms to minimize.
[2022-05-17 23:09:30] [INFO ] Deduced a trap composed of 68 places in 395 ms of which 1 ms to minimize.
[2022-05-17 23:09:31] [INFO ] Deduced a trap composed of 64 places in 388 ms of which 1 ms to minimize.
[2022-05-17 23:09:31] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 1 ms to minimize.
[2022-05-17 23:09:32] [INFO ] Deduced a trap composed of 80 places in 391 ms of which 1 ms to minimize.
[2022-05-17 23:09:32] [INFO ] Deduced a trap composed of 190 places in 437 ms of which 1 ms to minimize.
[2022-05-17 23:09:33] [INFO ] Deduced a trap composed of 72 places in 395 ms of which 0 ms to minimize.
[2022-05-17 23:09:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3514 ms
[2022-05-17 23:09:33] [INFO ] After 4843ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-05-17 23:09:33] [INFO ] After 5909ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1092 transition count 2510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1092 transition count 2510
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 0 with 132 rules applied. Total rules applied 134 place count 1092 transition count 3450
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 266 place count 960 transition count 3450
Applied a total of 266 rules in 200 ms. Remains 960 /1093 variables (removed 133) and now considering 3450/2515 (removed -935) transitions.
Finished structural reductions, in 1 iterations. Remains : 960/1093 places, 3450/2515 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:09:33] [INFO ] Flow matrix only has 3053 transitions (discarded 397 similar events)
// Phase 1: matrix 3053 rows 960 cols
[2022-05-17 23:09:33] [INFO ] Computed 44 place invariants in 31 ms
[2022-05-17 23:09:34] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 23:09:34] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 9 ms returned sat
[2022-05-17 23:09:34] [INFO ] After 692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 23:09:34] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:09:35] [INFO ] After 202ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:09:35] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:09:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-17 23:09:35] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 9 ms returned sat
[2022-05-17 23:09:35] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:09:37] [INFO ] After 1164ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:09:37] [INFO ] Deduced a trap composed of 177 places in 402 ms of which 1 ms to minimize.
[2022-05-17 23:09:38] [INFO ] Deduced a trap composed of 74 places in 465 ms of which 1 ms to minimize.
[2022-05-17 23:09:38] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 1 ms to minimize.
[2022-05-17 23:09:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1637 ms
[2022-05-17 23:09:38] [INFO ] After 2868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-17 23:09:38] [INFO ] After 3838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 960/960 places, 3450/3450 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 960 transition count 3449
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 959 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 958 transition count 3448
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 958 transition count 3448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 958 transition count 3448
Applied a total of 5 rules in 191 ms. Remains 958 /960 variables (removed 2) and now considering 3448/3450 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 958/960 places, 3448/3450 transitions.
Finished random walk after 8892 steps, including 303 resets, run visited all 1 properties in 114 ms. (steps per millisecond=78 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p3) p2)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p3)]
Knowledge based reduction with 9 factoid took 964 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Support contains 8 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 41 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-17 23:09:40] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:40] [INFO ] Computed 44 place invariants in 29 ms
[2022-05-17 23:09:41] [INFO ] Implicit Places using invariants in 900 ms returned []
[2022-05-17 23:09:41] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:41] [INFO ] Computed 44 place invariants in 22 ms
[2022-05-17 23:09:42] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:09:50] [INFO ] Implicit Places using invariants and state equation in 8773 ms returned []
Implicit Place search using SMT with State Equation took 9675 ms to find 0 implicit places.
[2022-05-17 23:09:50] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:50] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:09:51] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2515/2515 transitions.
Computed a total of 278 stabilizing places and 899 stable transitions
Computed a total of 278 stabilizing places and 899 stable transitions
Detected a total of 278/1093 stabilizing places and 899/2515 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:09:51] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:51] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:09:51] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-17 23:09:51] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-17 23:09:51] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:09:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-17 23:09:52] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-17 23:09:52] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:09:52] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:09:52] [INFO ] After 112ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:09:53] [INFO ] Deduced a trap composed of 277 places in 414 ms of which 1 ms to minimize.
[2022-05-17 23:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2022-05-17 23:09:53] [INFO ] After 683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-17 23:09:53] [INFO ] After 1524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2514
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 1090 transition count 2508
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1090 transition count 2508
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1089 transition count 2503
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1089 transition count 2503
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1089 transition count 3448
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 958 transition count 3448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 958 transition count 3448
Applied a total of 271 rules in 329 ms. Remains 958 /1093 variables (removed 135) and now considering 3448/2515 (removed -933) transitions.
Finished structural reductions, in 1 iterations. Remains : 958/1093 places, 3448/2515 transitions.
Finished random walk after 938 steps, including 31 resets, run visited all 1 properties in 12 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p0 (NOT p3) p1), (X p0), true, (X (X (NOT p3))), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F p3)]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2721 reset in 459 ms.
Product exploration explored 100000 steps with 2718 reset in 477 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 640 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Support contains 8 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 75 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-17 23:09:56] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-17 23:09:56] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:09:56] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-17 23:09:57] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2515/2515 transitions.
Product exploration explored 100000 steps with 2719 reset in 457 ms.
Product exploration explored 100000 steps with 2718 reset in 464 ms.
Built C files in :
/tmp/ltsmin3257074036774017770
[2022-05-17 23:09:58] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3257074036774017770
Running compilation step : cd /tmp/ltsmin3257074036774017770;'/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/ltsmin3257074036774017770;'/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/ltsmin3257074036774017770;'/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 8 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 38 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-17 23:10:01] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:10:01] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 23:10:02] [INFO ] Implicit Places using invariants in 845 ms returned []
[2022-05-17 23:10:02] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:10:02] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-17 23:10:03] [INFO ] State equation strengthened by 838 read => feed constraints.
[2022-05-17 23:10:11] [INFO ] Implicit Places using invariants and state equation in 9184 ms returned []
Implicit Place search using SMT with State Equation took 10031 ms to find 0 implicit places.
[2022-05-17 23:10:11] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2022-05-17 23:10:11] [INFO ] Computed 44 place invariants in 29 ms
[2022-05-17 23:10:12] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2515/2515 transitions.
Built C files in :
/tmp/ltsmin5618348161165532836
[2022-05-17 23:10:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5618348161165532836
Running compilation step : cd /tmp/ltsmin5618348161165532836;'/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/ltsmin5618348161165532836;'/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/ltsmin5618348161165532836;'/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-17 23:10:15] [INFO ] Flatten gal took : 55 ms
[2022-05-17 23:10:15] [INFO ] Flatten gal took : 56 ms
[2022-05-17 23:10:15] [INFO ] Time to serialize gal into /tmp/LTL8562898826412519796.gal : 6 ms
[2022-05-17 23:10:15] [INFO ] Time to serialize properties into /tmp/LTL16357280570807140734.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/LTL8562898826412519796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16357280570807140734.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/LTL8562898...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((F(G("((Node1HasAskedItsLeafSetToRx1ToReplaceNode15<1)||(LeafSetOfRx1IsSentToNode1<1))")))||(X(!(("((Node7NotifyThatHeIsActive...454
Formula 0 simplified : !XG("((Node7NotifyThatHeIsActive<1)||(Node10ThinksNode7ShouldBeNodeMasterToReplaceNode9<1))" | FG"((Node1HasAskedItsLeafSetToRx1ToRe...436
Detected timeout of ITS tools.
[2022-05-17 23:10:30] [INFO ] Flatten gal took : 57 ms
[2022-05-17 23:10:30] [INFO ] Applying decomposition
[2022-05-17 23:10:30] [INFO ] Flatten gal took : 68 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/graph20576837451762886.txt' '-o' '/tmp/graph20576837451762886.bin' '-w' '/tmp/graph20576837451762886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph20576837451762886.bin' '-l' '-1' '-v' '-w' '/tmp/graph20576837451762886.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:10:30] [INFO ] Decomposing Gal with order
[2022-05-17 23:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:10:31] [INFO ] Removed a total of 2259 redundant transitions.
[2022-05-17 23:10:31] [INFO ] Flatten gal took : 232 ms
[2022-05-17 23:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1230 labels/synchronizations in 42 ms.
[2022-05-17 23:10:31] [INFO ] Time to serialize gal into /tmp/LTL14529634185626825138.gal : 13 ms
[2022-05-17 23:10:31] [INFO ] Time to serialize properties into /tmp/LTL1140405247306959776.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/LTL14529634185626825138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1140405247306959776.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1452963...246
Read 1 LTL properties
Checking formula 0 : !((X(G(((F(G("((i18.i2.u37.Node1HasAskedItsLeafSetToRx1ToReplaceNode15<1)||(i18.i2.u37.LeafSetOfRx1IsSentToNode1<1))")))||(X(!(("((i7....533
Formula 0 simplified : !XG("((i7.u79.Node7NotifyThatHeIsActive<1)||(i7.u85.Node10ThinksNode7ShouldBeNodeMasterToReplaceNode9<1))" | FG"((i18.i2.u37.Node1Ha...515
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15812195468702592170
[2022-05-17 23:10:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15812195468702592170
Running compilation step : cd /tmp/ltsmin15812195468702592170;'/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/ltsmin15812195468702592170;'/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/ltsmin15812195468702592170;'/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-S16C05-LTLFireability-12 finished in 95137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)||p0)) U G(!p1))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
Stuttering acceptance computed with spot in 1270 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1289/1289 places, 2856/2856 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1289 transition count 2837
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1270 transition count 2837
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 38 place count 1270 transition count 2814
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 84 place count 1247 transition count 2814
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 104 place count 1227 transition count 2762
Iterating global reduction 2 with 20 rules applied. Total rules applied 124 place count 1227 transition count 2762
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 124 place count 1227 transition count 2760
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 1225 transition count 2760
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 140 place count 1213 transition count 2700
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 1213 transition count 2700
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 212 place count 1183 transition count 2670
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 220 place count 1175 transition count 2662
Iterating global reduction 2 with 8 rules applied. Total rules applied 228 place count 1175 transition count 2662
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 236 place count 1167 transition count 2622
Iterating global reduction 2 with 8 rules applied. Total rules applied 244 place count 1167 transition count 2622
Applied a total of 244 rules in 306 ms. Remains 1167 /1289 variables (removed 122) and now considering 2622/2856 (removed 234) transitions.
[2022-05-17 23:10:51] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1167 cols
[2022-05-17 23:10:51] [INFO ] Computed 67 place invariants in 32 ms
[2022-05-17 23:10:52] [INFO ] Implicit Places using invariants in 981 ms returned [9, 94, 224, 320, 321, 355, 421, 451, 452, 475, 476, 527, 537, 553, 568, 593, 603, 647, 684, 733, 767, 794, 815, 1103]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 984 ms to find 24 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1143/1289 places, 2622/2856 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1130 transition count 2609
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1130 transition count 2609
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1117 transition count 2596
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1117 transition count 2596
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1108 transition count 2551
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1108 transition count 2551
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1101 transition count 2544
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1094 transition count 2537
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1094 transition count 2537
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 1086 transition count 2497
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 1086 transition count 2497
Applied a total of 114 rules in 297 ms. Remains 1086 /1143 variables (removed 57) and now considering 2497/2622 (removed 125) transitions.
[2022-05-17 23:10:52] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1086 cols
[2022-05-17 23:10:52] [INFO ] Computed 43 place invariants in 25 ms
[2022-05-17 23:10:53] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-17 23:10:53] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1086 cols
[2022-05-17 23:10:53] [INFO ] Computed 43 place invariants in 18 ms
[2022-05-17 23:10:54] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:11:02] [INFO ] Implicit Places using invariants and state equation in 8730 ms returned [1064, 1077]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9611 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1084/1289 places, 2497/2856 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1084 transition count 2495
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1082 transition count 2495
Applied a total of 4 rules in 53 ms. Remains 1082 /1084 variables (removed 2) and now considering 2495/2497 (removed 2) transitions.
[2022-05-17 23:11:02] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:11:02] [INFO ] Computed 41 place invariants in 25 ms
[2022-05-17 23:11:03] [INFO ] Implicit Places using invariants in 848 ms returned []
[2022-05-17 23:11:03] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:11:03] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-17 23:11:03] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:11:11] [INFO ] Implicit Places using invariants and state equation in 8325 ms returned []
Implicit Place search using SMT with State Equation took 9179 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 1082/1289 places, 2495/2856 transitions.
Finished structural reductions, in 3 iterations. Remains : 1082/1289 places, 2495/2856 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s176 1) (GEQ s595 1)), p0:(AND (GEQ s480 1) (GEQ s845 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25011 reset in 928 ms.
Product exploration explored 100000 steps with 25013 reset in 914 ms.
Computed a total of 266 stabilizing places and 878 stable transitions
Computed a total of 266 stabilizing places and 878 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 500 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[p1, (AND (NOT p1) (NOT p0)), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 273 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 77202 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77202 steps, saw 32434 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-17 23:11:17] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:11:17] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-17 23:11:17] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-17 23:11:17] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:11:18] [INFO ] After 547ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2022-05-17 23:11:18] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:11:18] [INFO ] After 273ms SMT Verify possible using 826 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 23:11:18] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 23:11:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-17 23:11:18] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:11:19] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-17 23:11:20] [INFO ] After 489ms SMT Verify possible using 826 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-17 23:11:20] [INFO ] Deduced a trap composed of 294 places in 388 ms of which 1 ms to minimize.
[2022-05-17 23:11:20] [INFO ] Deduced a trap composed of 95 places in 380 ms of which 1 ms to minimize.
[2022-05-17 23:11:21] [INFO ] Deduced a trap composed of 71 places in 422 ms of which 1 ms to minimize.
[2022-05-17 23:11:21] [INFO ] Deduced a trap composed of 71 places in 398 ms of which 1 ms to minimize.
[2022-05-17 23:11:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1893 ms
[2022-05-17 23:11:22] [INFO ] Deduced a trap composed of 97 places in 394 ms of which 1 ms to minimize.
[2022-05-17 23:11:23] [INFO ] Deduced a trap composed of 124 places in 387 ms of which 0 ms to minimize.
[2022-05-17 23:11:23] [INFO ] Deduced a trap composed of 135 places in 391 ms of which 1 ms to minimize.
[2022-05-17 23:11:24] [INFO ] Deduced a trap composed of 130 places in 390 ms of which 1 ms to minimize.
[2022-05-17 23:11:24] [INFO ] Deduced a trap composed of 108 places in 398 ms of which 1 ms to minimize.
[2022-05-17 23:11:25] [INFO ] Deduced a trap composed of 93 places in 409 ms of which 1 ms to minimize.
[2022-05-17 23:11:25] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 1 ms to minimize.
[2022-05-17 23:11:26] [INFO ] Deduced a trap composed of 87 places in 419 ms of which 1 ms to minimize.
[2022-05-17 23:11:26] [INFO ] Deduced a trap composed of 314 places in 392 ms of which 1 ms to minimize.
[2022-05-17 23:11:27] [INFO ] Deduced a trap composed of 92 places in 425 ms of which 1 ms to minimize.
[2022-05-17 23:11:27] [INFO ] Deduced a trap composed of 96 places in 429 ms of which 1 ms to minimize.
[2022-05-17 23:11:28] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 1 ms to minimize.
[2022-05-17 23:11:28] [INFO ] Deduced a trap composed of 97 places in 426 ms of which 1 ms to minimize.
[2022-05-17 23:11:29] [INFO ] Deduced a trap composed of 117 places in 412 ms of which 1 ms to minimize.
[2022-05-17 23:11:29] [INFO ] Deduced a trap composed of 76 places in 400 ms of which 1 ms to minimize.
[2022-05-17 23:11:29] [INFO ] Deduced a trap composed of 86 places in 404 ms of which 1 ms to minimize.
[2022-05-17 23:11:30] [INFO ] Deduced a trap composed of 78 places in 396 ms of which 1 ms to minimize.
[2022-05-17 23:11:31] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 1 ms to minimize.
[2022-05-17 23:11:31] [INFO ] Deduced a trap composed of 66 places in 416 ms of which 1 ms to minimize.
[2022-05-17 23:11:32] [INFO ] Deduced a trap composed of 66 places in 408 ms of which 1 ms to minimize.
[2022-05-17 23:11:32] [INFO ] Deduced a trap composed of 239 places in 379 ms of which 0 ms to minimize.
[2022-05-17 23:11:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10324 ms
[2022-05-17 23:11:32] [INFO ] After 13086ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 348 ms.
[2022-05-17 23:11:33] [INFO ] After 14594ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1082/1082 places, 2495/2495 transitions.
Free-agglomeration rule (complex) applied 118 times.
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 1082 transition count 2917
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 236 place count 964 transition count 2917
Applied a total of 236 rules in 150 ms. Remains 964 /1082 variables (removed 118) and now considering 2917/2495 (removed -422) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/1082 places, 2917/2495 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73860 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73860 steps, saw 30899 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 23:11:36] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:11:36] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-17 23:11:36] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 23:11:36] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:11:37] [INFO ] After 1018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:11:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 23:11:37] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:11:39] [INFO ] After 1175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:11:39] [INFO ] State equation strengthened by 1366 read => feed constraints.
[2022-05-17 23:11:40] [INFO ] After 1099ms SMT Verify possible using 1366 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 23:11:40] [INFO ] Deduced a trap composed of 236 places in 379 ms of which 1 ms to minimize.
[2022-05-17 23:11:41] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 1 ms to minimize.
[2022-05-17 23:11:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 998 ms
[2022-05-17 23:11:41] [INFO ] Deduced a trap composed of 256 places in 400 ms of which 1 ms to minimize.
[2022-05-17 23:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2022-05-17 23:11:42] [INFO ] After 3181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 473 ms.
[2022-05-17 23:11:42] [INFO ] After 5059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 964 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 964/964 places, 2917/2917 transitions.
Applied a total of 0 rules in 64 ms. Remains 964 /964 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/964 places, 2917/2917 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 964/964 places, 2917/2917 transitions.
Applied a total of 0 rules in 64 ms. Remains 964 /964 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2022-05-17 23:11:42] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:11:42] [INFO ] Computed 41 place invariants in 29 ms
[2022-05-17 23:11:43] [INFO ] Implicit Places using invariants in 889 ms returned []
[2022-05-17 23:11:43] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:11:43] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-17 23:11:44] [INFO ] State equation strengthened by 1366 read => feed constraints.
[2022-05-17 23:11:59] [INFO ] Implicit Places using invariants and state equation in 15407 ms returned []
Implicit Place search using SMT with State Equation took 16298 ms to find 0 implicit places.
[2022-05-17 23:11:59] [INFO ] Redundant transitions in 90 ms returned []
[2022-05-17 23:11:59] [INFO ] Flow matrix only has 2531 transitions (discarded 386 similar events)
// Phase 1: matrix 2531 rows 964 cols
[2022-05-17 23:11:59] [INFO ] Computed 41 place invariants in 26 ms
[2022-05-17 23:12:00] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 964/964 places, 2917/2917 transitions.
Graph (trivial) has 1040 edges and 964 vertex of which 16 / 964 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 255 transitions
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 652 transitions.
Graph (complete) has 3471 edges and 949 vertex of which 935 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1622.t1589 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 98 rules applied. Total rules applied 100 place count 918 transition count 2167
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 1 with 274 rules applied. Total rules applied 374 place count 822 transition count 1989
Reduce places removed 89 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 2 with 241 rules applied. Total rules applied 615 place count 733 transition count 1837
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 192 rules applied. Total rules applied 807 place count 667 transition count 1711
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 167 rules applied. Total rules applied 974 place count 604 transition count 1607
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 5 with 125 rules applied. Total rules applied 1099 place count 560 transition count 1526
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 6 with 102 rules applied. Total rules applied 1201 place count 520 transition count 1464
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 69 rules applied. Total rules applied 1270 place count 495 transition count 1420
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 8 with 54 rules applied. Total rules applied 1324 place count 473 transition count 1388
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 9 with 33 rules applied. Total rules applied 1357 place count 460 transition count 1368
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 20 rules applied. Total rules applied 1377 place count 450 transition count 1358
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 11 with 14 rules applied. Total rules applied 1391 place count 447 transition count 1347
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 1403 place count 436 transition count 1346
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 4 Pre rules applied. Total rules applied 1403 place count 436 transition count 1342
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1411 place count 432 transition count 1342
Discarding 244 places :
Symmetric choice reduction at 13 with 244 rule applications. Total rules 1655 place count 188 transition count 623
Iterating global reduction 13 with 244 rules applied. Total rules applied 1899 place count 188 transition count 623
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 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 13 with 222 rules applied. Total rules applied 2121 place count 188 transition count 401
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 11 rules applied. Total rules applied 2132 place count 178 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2133 place count 177 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2133 place count 177 transition count 399
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2135 place count 176 transition count 399
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2145 place count 166 transition count 389
Iterating global reduction 16 with 10 rules applied. Total rules applied 2155 place count 166 transition count 389
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 16 with 140 rules applied. Total rules applied 2295 place count 96 transition count 319
Drop transitions removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 16 with 67 rules applied. Total rules applied 2362 place count 96 transition count 252
Discarding 31 places :
Symmetric choice reduction at 17 with 31 rule applications. Total rules 2393 place count 65 transition count 130
Iterating global reduction 17 with 31 rules applied. Total rules applied 2424 place count 65 transition count 130
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 17 with 27 rules applied. Total rules applied 2451 place count 65 transition count 103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 18 with 19 rules applied. Total rules applied 2470 place count 65 transition count 84
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 18 with 7 rules applied. Total rules applied 2477 place count 65 transition count 77
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 8 rules applied. Total rules applied 2485 place count 58 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 2486 place count 57 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 2486 place count 57 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 2488 place count 56 transition count 75
Discarding 9 places :
Symmetric choice reduction at 21 with 9 rule applications. Total rules 2497 place count 47 transition count 54
Iterating global reduction 21 with 9 rules applied. Total rules applied 2506 place count 47 transition count 54
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 21 with 13 rules applied. Total rules applied 2519 place count 47 transition count 41
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 2521 place count 45 transition count 39
Iterating global reduction 22 with 2 rules applied. Total rules applied 2523 place count 45 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 2525 place count 44 transition count 46
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 22 with 6 rules applied. Total rules applied 2531 place count 44 transition count 40
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2537 place count 38 transition count 40
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 23 with 10 rules applied. Total rules applied 2547 place count 38 transition count 40
Applied a total of 2547 rules in 361 ms. Remains 38 /964 variables (removed 926) and now considering 40/2917 (removed 2877) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 40 rows 38 cols
[2022-05-17 23:12:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:12:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:12:00] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:12:00] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-17 23:12:00] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 23:12:00] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2022-05-17 23:12:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:12:00] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:12:00] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:12:00] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 23:12:00] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 23:12:00] [INFO ] Flatten gal took : 2 ms
[2022-05-17 23:12:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:12:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4268660783961213085.gal : 1 ms
[2022-05-17 23:12:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18030816882060223287.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16880475639232211898;'/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/ReachabilityCardinality4268660783961213085.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18030816882060223287.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/ReachabilityCardinality18030816882060223287.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 40
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :40 after 473
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,1747,0.026729,4460,2,530,10,2362,10,0,192,1691,0
Total reachable state count : 1747
Verifying 4 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,35,0.027324,4460,2,176,10,2362,10,0,195,1691,0
Reachability property apf2 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
apf2,35,0.027916,4460,2,176,10,2362,10,0,198,1691,0
Reachability property apf3 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
apf3,35,0.028346,4460,2,176,10,2362,10,0,198,1691,0
Reachability property apf4 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
apf4,2,0.028781,4460,2,40,10,2362,10,0,201,1691,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 534 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[true, p1]
Stuttering acceptance computed with spot in 45 ms :[true, p1]
Support contains 2 out of 1082 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 : 1082/1082 places, 2495/2495 transitions.
Applied a total of 0 rules in 61 ms. Remains 1082 /1082 variables (removed 0) and now considering 2495/2495 (removed 0) transitions.
[2022-05-17 23:12:01] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:12:01] [INFO ] Computed 41 place invariants in 26 ms
[2022-05-17 23:12:02] [INFO ] Implicit Places using invariants in 827 ms returned []
[2022-05-17 23:12:02] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:12:02] [INFO ] Computed 41 place invariants in 18 ms
[2022-05-17 23:12:02] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:12:10] [INFO ] Implicit Places using invariants and state equation in 8121 ms returned []
Implicit Place search using SMT with State Equation took 8949 ms to find 0 implicit places.
[2022-05-17 23:12:10] [INFO ] Redundant transitions in 67 ms returned []
[2022-05-17 23:12:10] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:12:10] [INFO ] Computed 41 place invariants in 25 ms
[2022-05-17 23:12:11] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1082/1082 places, 2495/2495 transitions.
Computed a total of 266 stabilizing places and 878 stable transitions
Computed a total of 266 stabilizing places and 878 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[true, p1]
Incomplete random walk after 10000 steps, including 273 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97714 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97714 steps, saw 40960 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:12:14] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2022-05-17 23:12:14] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:12:14] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 23:12:14] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:12:15] [INFO ] After 616ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 23:12:15] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:12:15] [INFO ] After 115ms SMT Verify possible using 826 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:12:15] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:12:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 23:12:15] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2022-05-17 23:12:16] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:12:16] [INFO ] After 185ms SMT Verify possible using 826 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:12:16] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-17 23:12:16] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1082/1082 places, 2495/2495 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1081 transition count 2494
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 133 place count 1081 transition count 3443
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 264 place count 950 transition count 3443
Applied a total of 264 rules in 209 ms. Remains 950 /1082 variables (removed 132) and now considering 3443/2495 (removed -948) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/1082 places, 3443/2495 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86662 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86662 steps, saw 36088 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 23:12:20] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:12:20] [INFO ] Computed 41 place invariants in 27 ms
[2022-05-17 23:12:20] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 23:12:20] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 23:12:20] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:12:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 23:12:21] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 1 ms returned sat
[2022-05-17 23:12:21] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:12:21] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:12:22] [INFO ] After 322ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 23:12:22] [INFO ] Deduced a trap composed of 242 places in 408 ms of which 0 ms to minimize.
[2022-05-17 23:12:23] [INFO ] Deduced a trap composed of 56 places in 469 ms of which 1 ms to minimize.
[2022-05-17 23:12:23] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 1 ms to minimize.
[2022-05-17 23:12:24] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 1 ms to minimize.
[2022-05-17 23:12:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2158 ms
[2022-05-17 23:12:24] [INFO ] After 2544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-17 23:12:24] [INFO ] After 3485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 3443/3443 transitions.
Applied a total of 0 rules in 76 ms. Remains 950 /950 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 3443/3443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 3443/3443 transitions.
Applied a total of 0 rules in 91 ms. Remains 950 /950 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
[2022-05-17 23:12:24] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:12:24] [INFO ] Computed 41 place invariants in 27 ms
[2022-05-17 23:12:25] [INFO ] Implicit Places using invariants in 928 ms returned []
[2022-05-17 23:12:25] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:12:25] [INFO ] Computed 41 place invariants in 29 ms
[2022-05-17 23:12:26] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 23:12:41] [INFO ] Implicit Places using invariants and state equation in 15729 ms returned []
Implicit Place search using SMT with State Equation took 16658 ms to find 0 implicit places.
[2022-05-17 23:12:41] [INFO ] Redundant transitions in 125 ms returned []
[2022-05-17 23:12:41] [INFO ] Flow matrix only has 3045 transitions (discarded 398 similar events)
// Phase 1: matrix 3045 rows 950 cols
[2022-05-17 23:12:41] [INFO ] Computed 41 place invariants in 35 ms
[2022-05-17 23:12:42] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 3443/3443 transitions.
Graph (trivial) has 1043 edges and 950 vertex of which 17 / 950 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3969 edges and 934 vertex of which 920 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1271.t1241 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 903 transition count 2674
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 806 transition count 2481
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 710 transition count 2313
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 638 transition count 2171
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 568 transition count 2051
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 147 rules applied. Total rules applied 1206 place count 518 transition count 1954
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1331 place count 471 transition count 1876
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1422 place count 440 transition count 1816
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 76 rules applied. Total rules applied 1498 place count 411 transition count 1769
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1550 place count 393 transition count 1735
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1590 place count 377 transition count 1711
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1612 place count 369 transition count 1697
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1626 place count 363 transition count 1689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1631 place count 361 transition count 1686
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1633 place count 360 transition count 1685
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 8 Pre rules applied. Total rules applied 1633 place count 360 transition count 1677
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 1649 place count 352 transition count 1677
Discarding 285 places :
Symmetric choice reduction at 15 with 285 rule applications. Total rules 1934 place count 67 transition count 316
Iterating global reduction 15 with 285 rules applied. Total rules applied 2219 place count 67 transition count 316
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 265 rules applied. Total rules applied 2484 place count 67 transition count 51
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2497 place count 55 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2498 place count 54 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2498 place count 54 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2500 place count 53 transition count 49
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2512 place count 41 transition count 37
Iterating global reduction 18 with 12 rules applied. Total rules applied 2524 place count 41 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2526 place count 40 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2527 place count 40 transition count 35
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 18 with 11 rules applied. Total rules applied 2538 place count 40 transition count 24
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 18 with 11 rules applied. Total rules applied 2549 place count 29 transition count 24
Applied a total of 2549 rules in 280 ms. Remains 29 /950 variables (removed 921) and now considering 24/3443 (removed 3419) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 29 cols
[2022-05-17 23:12:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:12:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:12:42] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:12:42] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 23:12:42] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 23:12:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 23:12:42] [INFO ] Flatten gal took : 1 ms
[2022-05-17 23:12:42] [INFO ] Flatten gal took : 2 ms
[2022-05-17 23:12:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality85581668313077437.gal : 0 ms
[2022-05-17 23:12:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7689706209830367695.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17375822786477839840;'/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/ReachabilityCardinality85581668313077437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7689706209830367695.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...317
Loading property file /tmp/ReachabilityCardinality7689706209830367695.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 410
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,503,0.016581,3852,2,459,10,1517,7,0,130,1121,0
Total reachable state count : 503
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,2,0.017056,4292,2,33,10,1517,7,0,133,1121,0
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[true, p1]
Stuttering acceptance computed with spot in 34 ms :[true, p1]
Stuttering acceptance computed with spot in 35 ms :[true, p1]
Product exploration explored 100000 steps with 2728 reset in 455 ms.
Product exploration explored 100000 steps with 2730 reset in 487 ms.
Built C files in :
/tmp/ltsmin3598488313660532534
[2022-05-17 23:12:44] [INFO ] Too many transitions (2495) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:12:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3598488313660532534
Running compilation step : cd /tmp/ltsmin3598488313660532534;'/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/ltsmin3598488313660532534;'/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/ltsmin3598488313660532534;'/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 1082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1082/1082 places, 2495/2495 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1081 transition count 2494
Applied a total of 2 rules in 97 ms. Remains 1081 /1082 variables (removed 1) and now considering 2494/2495 (removed 1) transitions.
[2022-05-17 23:12:47] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:12:47] [INFO ] Computed 41 place invariants in 32 ms
[2022-05-17 23:12:48] [INFO ] Implicit Places using invariants in 861 ms returned []
[2022-05-17 23:12:48] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:12:48] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-17 23:12:48] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 23:12:56] [INFO ] Implicit Places using invariants and state equation in 8181 ms returned []
Implicit Place search using SMT with State Equation took 9046 ms to find 0 implicit places.
[2022-05-17 23:12:56] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-17 23:12:56] [INFO ] Flow matrix only has 2222 transitions (discarded 272 similar events)
// Phase 1: matrix 2222 rows 1081 cols
[2022-05-17 23:12:56] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-17 23:12:57] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1082 places, 2494/2495 transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1082 places, 2494/2495 transitions.
Built C files in :
/tmp/ltsmin819620004476430186
[2022-05-17 23:12:57] [INFO ] Too many transitions (2494) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:12:57] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin819620004476430186
Running compilation step : cd /tmp/ltsmin819620004476430186;'/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/ltsmin819620004476430186;'/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/ltsmin819620004476430186;'/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-17 23:13:00] [INFO ] Flatten gal took : 64 ms
[2022-05-17 23:13:00] [INFO ] Flatten gal took : 55 ms
[2022-05-17 23:13:00] [INFO ] Time to serialize gal into /tmp/LTL14848163748761136602.gal : 6 ms
[2022-05-17 23:13:00] [INFO ] Time to serialize properties into /tmp/LTL5415695885626130616.ltl : 156 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/LTL14848163748761136602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5415695885626130616.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/LTL1484816...267
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode6>=1))"))||("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashO...273
Formula 0 simplified : !G(X("((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode6>=1))" | G"((Node6IsTheNodeMaster>=1)&&(Node15HasDetectedCrashOfNode...260
Detected timeout of ITS tools.
[2022-05-17 23:13:15] [INFO ] Flatten gal took : 57 ms
[2022-05-17 23:13:15] [INFO ] Applying decomposition
[2022-05-17 23:13:15] [INFO ] Flatten gal took : 56 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/graph3737434174544684433.txt' '-o' '/tmp/graph3737434174544684433.bin' '-w' '/tmp/graph3737434174544684433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3737434174544684433.bin' '-l' '-1' '-v' '-w' '/tmp/graph3737434174544684433.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:13:15] [INFO ] Decomposing Gal with order
[2022-05-17 23:13:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:13:16] [INFO ] Removed a total of 2204 redundant transitions.
[2022-05-17 23:13:16] [INFO ] Flatten gal took : 227 ms
[2022-05-17 23:13:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1396 labels/synchronizations in 46 ms.
[2022-05-17 23:13:16] [INFO ] Time to serialize gal into /tmp/LTL13997352229794199342.gal : 593 ms
[2022-05-17 23:13:16] [INFO ] Time to serialize properties into /tmp/LTL5226971547821129888.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/LTL13997352229794199342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5226971547821129888.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1399735...246
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((u0.Node6IsTheNodeMaster>=1)&&(i11.u121.Node15HasDetectedCrashOfNode6>=1))"))||("((u0.Node6IsTheNodeMaster>=1)&&(i11.u121...312
Formula 0 simplified : !G(X("((u0.Node6IsTheNodeMaster>=1)&&(i11.u121.Node15HasDetectedCrashOfNode6>=1))" | G"((u0.Node6IsTheNodeMaster>=1)&&(i11.u121.Node...299
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13800564741451575269
[2022-05-17 23:13:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13800564741451575269
Running compilation step : cd /tmp/ltsmin13800564741451575269;'/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/ltsmin13800564741451575269;'/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/ltsmin13800564741451575269;'/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-S16C05-LTLFireability-13 finished in 165672 ms.
[2022-05-17 23:13:34] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1666586632978150676
[2022-05-17 23:13:35] [INFO ] Too many transitions (2856) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:13:35] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1666586632978150676
[2022-05-17 23:13:35] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin1666586632978150676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 23:13:35] [INFO ] Flatten gal took : 73 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/graph10211794956477517967.txt' '-o' '/tmp/graph10211794956477517967.bin' '-w' '/tmp/graph10211794956477517967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10211794956477517967.bin' '-l' '-1' '-v' '-w' '/tmp/graph10211794956477517967.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:13:35] [INFO ] Decomposing Gal with order
[2022-05-17 23:13:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:13:35] [INFO ] Removed a total of 2337 redundant transitions.
[2022-05-17 23:13:35] [INFO ] Flatten gal took : 169 ms
[2022-05-17 23:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1350 labels/synchronizations in 62 ms.
[2022-05-17 23:13:35] [INFO ] Time to serialize gal into /tmp/LTLFireability2590336376369306873.gal : 13 ms
[2022-05-17 23:13:35] [INFO ] Time to serialize properties into /tmp/LTLFireability12609774983068617734.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/LTLFireability2590336376369306873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12609774983068617734.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !(((((!(G(F("((i0.i1.u14.Node6HasAskedItsLeafSetToRx3ToReplaceNode14>=1)&&(i0.i1.u104.LeafSetOfRx3IsSentToNode6>=1))"))))&&(F(!("((i0....715
Formula 0 simplified : !((!"(((u0.ThereIsAMasterInTheLeafSet>=1)&&(u0.NoNodeManageTheCrashOfNode13>=1))&&((u0.Node16WantsToManageTheCrashOfNode13>=1)&&(i2....697
Compilation finished in 6489 ms.
Running link step : cd /tmp/ltsmin1666586632978150676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1666586632978150676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(())&&<>(!(LTLAPp1==true))&&!(LTLAPp2==true)) U ((LTLAPp3==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 429730 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1666586632978150676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
LTSmin run took 519 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1666586632978150676;'/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([]((<>([]((LTLAPp6==true)))||X(!((LTLAPp7==true) U (LTLAPp8==true)))||(LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 263571 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1666586632978150676;'/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(([]((LTLAPp9==true))||(LTLAPp9==true))) U [](!(LTLAPp10==true))))' '--buchi-type=spotba'
LTSmin run took 523698 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2325721 ms.
BK_STOP 1652830439797
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;