About the Execution of ITS-Tools for LeafsetExtension-PT-S16C4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1739.815 | 109676.00 | 266094.00 | 2655.30 | TFTFFFFFTFFTTFTF | 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-165271821000491.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 LeafsetExtension-PT-S16C4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000491
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 16K Apr 29 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 29 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 905K 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 LeafsetExtension-PT-S16C4-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652795970967
Running Version 202205111006
[2022-05-17 13:59:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:59:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:59:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2022-05-17 13:59:32] [INFO ] Transformed 1542 places.
[2022-05-17 13:59:32] [INFO ] Transformed 1449 transitions.
[2022-05-17 13:59:32] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 284 places and 0 transitions.
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 1258 transition count 1449
Discarding 258 places :
Symmetric choice reduction at 1 with 258 rule applications. Total rules 542 place count 1000 transition count 1191
Iterating global reduction 1 with 258 rules applied. Total rules applied 800 place count 1000 transition count 1191
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 1019 place count 781 transition count 972
Iterating global reduction 1 with 219 rules applied. Total rules applied 1238 place count 781 transition count 972
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 1449 place count 570 transition count 761
Iterating global reduction 1 with 211 rules applied. Total rules applied 1660 place count 570 transition count 761
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 1 with 14 rules applied. Total rules applied 1674 place count 556 transition count 761
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1686 place count 544 transition count 749
Iterating global reduction 2 with 12 rules applied. Total rules applied 1698 place count 544 transition count 749
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1710 place count 532 transition count 737
Iterating global reduction 2 with 12 rules applied. Total rules applied 1722 place count 532 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1733 place count 521 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 1744 place count 521 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1755 place count 510 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 1766 place count 510 transition count 715
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 1834 place count 442 transition count 647
Iterating global reduction 2 with 68 rules applied. Total rules applied 1902 place count 442 transition count 647
Applied a total of 1902 rules in 363 ms. Remains 442 /1542 variables (removed 1100) and now considering 647/1449 (removed 802) transitions.
[2022-05-17 13:59:32] [INFO ] Flow matrix only has 579 transitions (discarded 68 similar events)
// Phase 1: matrix 579 rows 442 cols
[2022-05-17 13:59:32] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-17 13:59:33] [INFO ] Implicit Places using invariants in 500 ms returned [33, 37, 60, 88, 103, 122, 127, 155, 177, 192, 209, 211, 230, 250, 278, 299, 304, 316, 334, 348, 358, 362, 376, 413]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 534 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 418/1542 places, 647/1449 transitions.
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 147 place count 271 transition count 500
Iterating global reduction 0 with 147 rules applied. Total rules applied 294 place count 271 transition count 500
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 300 place count 265 transition count 494
Iterating global reduction 0 with 6 rules applied. Total rules applied 306 place count 265 transition count 494
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 312 place count 259 transition count 488
Iterating global reduction 0 with 6 rules applied. Total rules applied 318 place count 259 transition count 488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 324 place count 253 transition count 482
Iterating global reduction 0 with 6 rules applied. Total rules applied 330 place count 253 transition count 482
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 336 place count 247 transition count 476
Iterating global reduction 0 with 6 rules applied. Total rules applied 342 place count 247 transition count 476
Applied a total of 342 rules in 42 ms. Remains 247 /418 variables (removed 171) and now considering 476/647 (removed 171) transitions.
[2022-05-17 13:59:33] [INFO ] Flow matrix only has 359 transitions (discarded 117 similar events)
// Phase 1: matrix 359 rows 247 cols
[2022-05-17 13:59:33] [INFO ] Computed 18 place invariants in 10 ms
[2022-05-17 13:59:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-05-17 13:59:33] [INFO ] Flow matrix only has 359 transitions (discarded 117 similar events)
// Phase 1: matrix 359 rows 247 cols
[2022-05-17 13:59:33] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-17 13:59:33] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 247/1542 places, 476/1449 transitions.
Finished structural reductions, in 2 iterations. Remains : 247/1542 places, 476/1449 transitions.
Support contains 48 out of 247 places after structural reductions.
[2022-05-17 13:59:34] [INFO ] Flatten gal took : 60 ms
[2022-05-17 13:59:34] [INFO ] Flatten gal took : 29 ms
[2022-05-17 13:59:34] [INFO ] Input system was already deterministic with 476 transitions.
Support contains 44 out of 247 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 281 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 26) seen :18
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-17 13:59:35] [INFO ] Flow matrix only has 359 transitions (discarded 117 similar events)
// Phase 1: matrix 359 rows 247 cols
[2022-05-17 13:59:35] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-17 13:59:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 13:59:35] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 5 ms returned sat
[2022-05-17 13:59:35] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 247 stabilizing places and 476 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 476
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X(p1)||p1)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 238 transition count 476
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 48 place count 199 transition count 437
Iterating global reduction 1 with 39 rules applied. Total rules applied 87 place count 199 transition count 437
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 113 place count 173 transition count 411
Iterating global reduction 1 with 26 rules applied. Total rules applied 139 place count 173 transition count 411
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 142 place count 170 transition count 411
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 165 place count 147 transition count 388
Iterating global reduction 2 with 23 rules applied. Total rules applied 188 place count 147 transition count 388
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 198 place count 137 transition count 388
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 223 place count 112 transition count 363
Iterating global reduction 3 with 25 rules applied. Total rules applied 248 place count 112 transition count 363
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 261 place count 99 transition count 350
Iterating global reduction 3 with 13 rules applied. Total rules applied 274 place count 99 transition count 350
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 287 place count 86 transition count 337
Iterating global reduction 3 with 13 rules applied. Total rules applied 300 place count 86 transition count 337
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 313 place count 73 transition count 324
Iterating global reduction 3 with 13 rules applied. Total rules applied 326 place count 73 transition count 324
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 336 place count 63 transition count 314
Iterating global reduction 3 with 10 rules applied. Total rules applied 346 place count 63 transition count 314
Applied a total of 346 rules in 35 ms. Remains 63 /247 variables (removed 184) and now considering 314/476 (removed 162) transitions.
[2022-05-17 13:59:35] [INFO ] Flow matrix only has 72 transitions (discarded 242 similar events)
// Phase 1: matrix 72 rows 63 cols
[2022-05-17 13:59:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:59:35] [INFO ] Implicit Places using invariants in 54 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/247 places, 314/476 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 58 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 58 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 309
Applied a total of 10 rules in 9 ms. Remains 57 /62 variables (removed 5) and now considering 309/314 (removed 5) transitions.
[2022-05-17 13:59:35] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 57 cols
[2022-05-17 13:59:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 57 cols
[2022-05-17 13:59:36] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/247 places, 309/476 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/247 places, 309/476 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-03 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s41), p1:(LEQ s29 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-03 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p0) U p1)&&p2))))'
Support contains 6 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Graph (complete) has 857 edges and 247 vertex of which 237 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 237 transition count 425
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 188 transition count 425
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 99 place count 188 transition count 404
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 141 place count 167 transition count 404
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 168 place count 140 transition count 377
Iterating global reduction 2 with 27 rules applied. Total rules applied 195 place count 140 transition count 377
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 133 transition count 370
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 133 transition count 370
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 211 place count 131 transition count 370
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 211 place count 131 transition count 368
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 129 transition count 368
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 127 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 127 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 125 transition count 364
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 125 transition count 364
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 281 place count 96 transition count 335
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 290 place count 87 transition count 326
Iterating global reduction 3 with 9 rules applied. Total rules applied 299 place count 87 transition count 326
Applied a total of 299 rules in 80 ms. Remains 87 /247 variables (removed 160) and now considering 326/476 (removed 150) transitions.
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 170 transitions (discarded 156 similar events)
// Phase 1: matrix 170 rows 87 cols
[2022-05-17 13:59:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants in 79 ms returned [12, 25, 29, 37, 41, 46, 50, 56, 64]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 82 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/247 places, 326/476 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 319
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 319
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 64 transition count 312
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 64 transition count 312
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 62 transition count 310
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 60 transition count 308
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 60 transition count 308
Applied a total of 36 rules in 20 ms. Remains 60 /78 variables (removed 18) and now considering 308/326 (removed 18) transitions.
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 80 transitions (discarded 228 similar events)
// Phase 1: matrix 80 rows 60 cols
[2022-05-17 13:59:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 80 transitions (discarded 228 similar events)
// Phase 1: matrix 80 rows 60 cols
[2022-05-17 13:59:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/247 places, 308/476 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/247 places, 308/476 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s33 s8), p2:(LEQ s5 s49), p0:(LEQ s19 s26)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 179 steps with 11 reset in 4 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-04 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||(p0 U p1)||p2)))'
Support contains 6 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 240 transition count 476
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 44 place count 203 transition count 439
Iterating global reduction 1 with 37 rules applied. Total rules applied 81 place count 203 transition count 439
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 105 place count 179 transition count 415
Iterating global reduction 1 with 24 rules applied. Total rules applied 129 place count 179 transition count 415
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 176 transition count 415
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 155 transition count 394
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 155 transition count 394
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 183 place count 146 transition count 394
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 205 place count 124 transition count 372
Iterating global reduction 3 with 22 rules applied. Total rules applied 227 place count 124 transition count 372
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 239 place count 112 transition count 360
Iterating global reduction 3 with 12 rules applied. Total rules applied 251 place count 112 transition count 360
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 263 place count 100 transition count 348
Iterating global reduction 3 with 12 rules applied. Total rules applied 275 place count 100 transition count 348
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 287 place count 88 transition count 336
Iterating global reduction 3 with 12 rules applied. Total rules applied 299 place count 88 transition count 336
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 308 place count 79 transition count 327
Iterating global reduction 3 with 9 rules applied. Total rules applied 317 place count 79 transition count 327
Applied a total of 317 rules in 36 ms. Remains 79 /247 variables (removed 168) and now considering 327/476 (removed 149) transitions.
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-17 13:59:36] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:59:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-17 13:59:37] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:37] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/247 places, 327/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/247 places, 327/476 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(LEQ s54 s39), p1:(LEQ s66 s15), p0:(LEQ s59 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3050 reset in 376 ms.
Product exploration explored 100000 steps with 3035 reset in 216 ms.
Computed a total of 79 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 327
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 866 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 257 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 13:59:39] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:39] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 13:59:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 13:59:39] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-17 13:59:39] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 13:59:39] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-17 13:59:39] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 327/327 transitions.
Graph (complete) has 175 edges and 79 vertex of which 49 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Drop transitions removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 49 transition count 137
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 175 place count 42 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 177 place count 40 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 40 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 37 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 33 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 33 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 31 transition count 108
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 211 place count 31 transition count 92
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 220 place count 31 transition count 83
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 229 place count 22 transition count 83
Applied a total of 229 rules in 12 ms. Remains 22 /79 variables (removed 57) and now considering 83/327 (removed 244) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/79 places, 83/327 transitions.
Finished random walk after 3396 steps, including 554 resets, run visited all 1 properties in 9 ms. (steps per millisecond=377 )
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 15 factoid took 1048 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 327/327 transitions.
Applied a total of 0 rules in 12 ms. Remains 79 /79 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2022-05-17 13:59:40] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-17 13:59:40] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:59:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-05-17 13:59:41] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:41] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 327/327 transitions.
Computed a total of 79 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 327
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 874 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 256 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 13:59:42] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 13:59:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 13:59:42] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 13:59:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 13:59:42] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 13:59:42] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 13:59:42] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 13:59:42] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 327/327 transitions.
Graph (complete) has 175 edges and 79 vertex of which 49 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Drop transitions removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 49 transition count 137
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 175 place count 42 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 177 place count 40 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 40 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 37 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 33 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 33 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 31 transition count 108
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 211 place count 31 transition count 92
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 220 place count 31 transition count 83
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 229 place count 22 transition count 83
Applied a total of 229 rules in 12 ms. Remains 22 /79 variables (removed 57) and now considering 83/327 (removed 244) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/79 places, 83/327 transitions.
Finished random walk after 9665 steps, including 1562 resets, run visited all 3 properties in 75 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 15 factoid took 1121 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3045 reset in 193 ms.
Product exploration explored 100000 steps with 3037 reset in 304 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 327/327 transitions.
Graph (complete) has 470 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 78 transition count 326
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 9 place count 78 transition count 328
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 78 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 77 transition count 327
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 77 transition count 327
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 77 transition count 327
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 69 transition count 319
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 69 transition count 319
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 39 rules in 22 ms. Remains 69 /79 variables (removed 10) and now considering 319/327 (removed 8) transitions.
[2022-05-17 13:59:45] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-17 13:59:45] [INFO ] Flow matrix only has 84 transitions (discarded 235 similar events)
// Phase 1: matrix 84 rows 69 cols
[2022-05-17 13:59:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:59:45] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/79 places, 319/327 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/79 places, 319/327 transitions.
Product exploration explored 100000 steps with 3044 reset in 192 ms.
Product exploration explored 100000 steps with 3040 reset in 206 ms.
Built C files in :
/tmp/ltsmin12008900677210901837
[2022-05-17 13:59:46] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12008900677210901837
Running compilation step : cd /tmp/ltsmin12008900677210901837;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin12008900677210901837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12008900677210901837;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16620788501651511900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 327/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 79 /79 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2022-05-17 14:00:01] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 14:00:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 14:00:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-17 14:00:01] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 14:00:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:00:01] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-17 14:00:01] [INFO ] Flow matrix only has 94 transitions (discarded 233 similar events)
// Phase 1: matrix 94 rows 79 cols
[2022-05-17 14:00:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:00:01] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 327/327 transitions.
Built C files in :
/tmp/ltsmin13495625829086505996
[2022-05-17 14:00:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13495625829086505996
Running compilation step : cd /tmp/ltsmin13495625829086505996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin13495625829086505996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13495625829086505996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16448902561124390148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 14:00:16] [INFO ] Flatten gal took : 15 ms
[2022-05-17 14:00:16] [INFO ] Flatten gal took : 15 ms
[2022-05-17 14:00:16] [INFO ] Time to serialize gal into /tmp/LTL10741662254834250120.gal : 17 ms
[2022-05-17 14:00:16] [INFO ] Time to serialize properties into /tmp/LTL15794717016668732605.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/LTL10741662254834250120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15794717016668732605.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/LTL1074166...268
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("(Node12Failure<=Node6ManageTheBreakDownOfNode9)"))))||(("(Node12Failure<=Node6ManageTheBreakDownOfNode9)")U("(Node15Want...301
Formula 0 simplified : !G("(Node10FailureProcessedByNode11<=Node10HasTheLeafSetOfRxToReplaceNode8)" | XGX"(Node12Failure<=Node6ManageTheBreakDownOfNode9)" ...287
Detected timeout of ITS tools.
[2022-05-17 14:00:31] [INFO ] Flatten gal took : 14 ms
[2022-05-17 14:00:31] [INFO ] Applying decomposition
[2022-05-17 14:00:31] [INFO ] Flatten gal took : 14 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/graph6192115100703540846.txt' '-o' '/tmp/graph6192115100703540846.bin' '-w' '/tmp/graph6192115100703540846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6192115100703540846.bin' '-l' '-1' '-v' '-w' '/tmp/graph6192115100703540846.weights' '-q' '0' '-e' '0.001'
[2022-05-17 14:00:32] [INFO ] Decomposing Gal with order
[2022-05-17 14:00:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 14:00:32] [INFO ] Removed a total of 242 redundant transitions.
[2022-05-17 14:00:32] [INFO ] Flatten gal took : 76 ms
[2022-05-17 14:00:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 6 ms.
[2022-05-17 14:00:32] [INFO ] Time to serialize gal into /tmp/LTL2907968731317992246.gal : 3 ms
[2022-05-17 14:00:32] [INFO ] Time to serialize properties into /tmp/LTL15938520191761101942.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/LTL2907968731317992246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15938520191761101942.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/LTL2907968...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("(gu5.Node12Failure<=gu5.Node6ManageTheBreakDownOfNode9)"))))||(("(gu5.Node12Failure<=gu5.Node6ManageTheBreakDownOfNode9)...337
Formula 0 simplified : !G("(gu11.Node10FailureProcessedByNode11<=gu11.Node10HasTheLeafSetOfRxToReplaceNode8)" | XGX"(gu5.Node12Failure<=gu5.Node6ManageTheB...323
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7590874100966940388
[2022-05-17 14:00:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7590874100966940388
Running compilation step : cd /tmp/ltsmin7590874100966940388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 703 ms.
Running link step : cd /tmp/ltsmin7590874100966940388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7590874100966940388;'/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((LTLAPp0==true))))||((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-05 finished in 85884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 239 transition count 476
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 48 place count 199 transition count 436
Iterating global reduction 1 with 40 rules applied. Total rules applied 88 place count 199 transition count 436
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 115 place count 172 transition count 409
Iterating global reduction 1 with 27 rules applied. Total rules applied 142 place count 172 transition count 409
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 145 place count 169 transition count 409
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 167 place count 147 transition count 387
Iterating global reduction 2 with 22 rules applied. Total rules applied 189 place count 147 transition count 387
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 199 place count 137 transition count 387
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 223 place count 113 transition count 363
Iterating global reduction 3 with 24 rules applied. Total rules applied 247 place count 113 transition count 363
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 260 place count 100 transition count 350
Iterating global reduction 3 with 13 rules applied. Total rules applied 273 place count 100 transition count 350
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 286 place count 87 transition count 337
Iterating global reduction 3 with 13 rules applied. Total rules applied 299 place count 87 transition count 337
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 312 place count 74 transition count 324
Iterating global reduction 3 with 13 rules applied. Total rules applied 325 place count 74 transition count 324
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 335 place count 64 transition count 314
Iterating global reduction 3 with 10 rules applied. Total rules applied 345 place count 64 transition count 314
Applied a total of 345 rules in 21 ms. Remains 64 /247 variables (removed 183) and now considering 314/476 (removed 162) transitions.
[2022-05-17 14:01:02] [INFO ] Flow matrix only has 70 transitions (discarded 244 similar events)
// Phase 1: matrix 70 rows 64 cols
[2022-05-17 14:01:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-17 14:01:02] [INFO ] Flow matrix only has 70 transitions (discarded 244 similar events)
// Phase 1: matrix 70 rows 64 cols
[2022-05-17 14:01:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:02] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-17 14:01:02] [INFO ] Flow matrix only has 70 transitions (discarded 244 similar events)
// Phase 1: matrix 70 rows 64 cols
[2022-05-17 14:01:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:03] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/247 places, 314/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/247 places, 314/476 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s39 s55)], 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 0 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-07 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 238 transition count 476
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 49 place count 198 transition count 436
Iterating global reduction 1 with 40 rules applied. Total rules applied 89 place count 198 transition count 436
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 116 place count 171 transition count 409
Iterating global reduction 1 with 27 rules applied. Total rules applied 143 place count 171 transition count 409
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 145 place count 169 transition count 409
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 166 place count 148 transition count 388
Iterating global reduction 2 with 21 rules applied. Total rules applied 187 place count 148 transition count 388
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 198 place count 137 transition count 388
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 223 place count 112 transition count 363
Iterating global reduction 3 with 25 rules applied. Total rules applied 248 place count 112 transition count 363
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 261 place count 99 transition count 350
Iterating global reduction 3 with 13 rules applied. Total rules applied 274 place count 99 transition count 350
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 287 place count 86 transition count 337
Iterating global reduction 3 with 13 rules applied. Total rules applied 300 place count 86 transition count 337
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 313 place count 73 transition count 324
Iterating global reduction 3 with 13 rules applied. Total rules applied 326 place count 73 transition count 324
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 337 place count 62 transition count 313
Iterating global reduction 3 with 11 rules applied. Total rules applied 348 place count 62 transition count 313
Applied a total of 348 rules in 22 ms. Remains 62 /247 variables (removed 185) and now considering 313/476 (removed 163) transitions.
[2022-05-17 14:01:03] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2022-05-17 14:01:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 14:01:03] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2022-05-17 14:01:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-05-17 14:01:03] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2022-05-17 14:01:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:03] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/247 places, 313/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/247 places, 313/476 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s31 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Computed a total of 62 stabilizing places and 313 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 313
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-08 finished in 982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(p1))))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 239 transition count 476
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 46 place count 201 transition count 438
Iterating global reduction 1 with 38 rules applied. Total rules applied 84 place count 201 transition count 438
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 109 place count 176 transition count 413
Iterating global reduction 1 with 25 rules applied. Total rules applied 134 place count 176 transition count 413
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 173 transition count 413
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 157 place count 153 transition count 393
Iterating global reduction 2 with 20 rules applied. Total rules applied 177 place count 153 transition count 393
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 185 place count 145 transition count 393
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 207 place count 123 transition count 371
Iterating global reduction 3 with 22 rules applied. Total rules applied 229 place count 123 transition count 371
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 240 place count 112 transition count 360
Iterating global reduction 3 with 11 rules applied. Total rules applied 251 place count 112 transition count 360
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 262 place count 101 transition count 349
Iterating global reduction 3 with 11 rules applied. Total rules applied 273 place count 101 transition count 349
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 284 place count 90 transition count 338
Iterating global reduction 3 with 11 rules applied. Total rules applied 295 place count 90 transition count 338
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 303 place count 82 transition count 330
Iterating global reduction 3 with 8 rules applied. Total rules applied 311 place count 82 transition count 330
Applied a total of 311 rules in 23 ms. Remains 82 /247 variables (removed 165) and now considering 330/476 (removed 146) transitions.
[2022-05-17 14:01:04] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-17 14:01:04] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:04] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-17 14:01:04] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:04] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/247 places, 330/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/247 places, 330/476 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LEQ s29 s39), p0:(LEQ s68 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 250 ms.
Product exploration explored 100000 steps with 20000 reset in 228 ms.
Computed a total of 82 stabilizing places and 330 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 330
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Finished random walk after 414 steps, including 10 resets, run visited all 2 properties in 5 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 507 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 330/330 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2022-05-17 14:01:06] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 14:01:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-17 14:01:06] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-05-17 14:01:06] [INFO ] Flow matrix only has 103 transitions (discarded 227 similar events)
// Phase 1: matrix 103 rows 82 cols
[2022-05-17 14:01:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:06] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 330/330 transitions.
Computed a total of 82 stabilizing places and 330 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 330
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Finished random walk after 449 steps, including 12 resets, run visited all 2 properties in 6 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 20000 reset in 210 ms.
Product exploration explored 100000 steps with 20000 reset in 229 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 688 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 330/330 transitions.
Graph (complete) has 480 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 81 transition count 329
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 81 transition count 332
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 81 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 80 transition count 331
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 80 transition count 331
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 80 transition count 331
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 73 transition count 324
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 73 transition count 324
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 40 rules in 20 ms. Remains 73 /82 variables (removed 9) and now considering 324/330 (removed 6) transitions.
[2022-05-17 14:01:09] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 14:01:09] [INFO ] Flow matrix only has 95 transitions (discarded 229 similar events)
// Phase 1: matrix 95 rows 73 cols
[2022-05-17 14:01:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:09] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/82 places, 324/330 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/82 places, 324/330 transitions.
Product exploration explored 100000 steps with 20000 reset in 568 ms.
Product exploration explored 100000 steps with 20000 reset in 567 ms.
Built C files in :
/tmp/ltsmin2798908793792384202
[2022-05-17 14:01:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2798908793792384202
Running compilation step : cd /tmp/ltsmin2798908793792384202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 454 ms.
Running link step : cd /tmp/ltsmin2798908793792384202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2798908793792384202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1219270487442347085.hoa' '--buchi-type=spotba'
LTSmin run took 400 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-11 finished in 7024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(F(p0))))||F(X(F(p1)))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 238 transition count 476
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 47 place count 200 transition count 438
Iterating global reduction 1 with 38 rules applied. Total rules applied 85 place count 200 transition count 438
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 110 place count 175 transition count 413
Iterating global reduction 1 with 25 rules applied. Total rules applied 135 place count 175 transition count 413
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 173 transition count 413
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 156 place count 154 transition count 394
Iterating global reduction 2 with 19 rules applied. Total rules applied 175 place count 154 transition count 394
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 184 place count 145 transition count 394
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 207 place count 122 transition count 371
Iterating global reduction 3 with 23 rules applied. Total rules applied 230 place count 122 transition count 371
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 241 place count 111 transition count 360
Iterating global reduction 3 with 11 rules applied. Total rules applied 252 place count 111 transition count 360
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 263 place count 100 transition count 349
Iterating global reduction 3 with 11 rules applied. Total rules applied 274 place count 100 transition count 349
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 285 place count 89 transition count 338
Iterating global reduction 3 with 11 rules applied. Total rules applied 296 place count 89 transition count 338
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 305 place count 80 transition count 329
Iterating global reduction 3 with 9 rules applied. Total rules applied 314 place count 80 transition count 329
Applied a total of 314 rules in 10 ms. Remains 80 /247 variables (removed 167) and now considering 329/476 (removed 147) transitions.
[2022-05-17 14:01:11] [INFO ] Flow matrix only has 102 transitions (discarded 227 similar events)
// Phase 1: matrix 102 rows 80 cols
[2022-05-17 14:01:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-17 14:01:11] [INFO ] Flow matrix only has 102 transitions (discarded 227 similar events)
// Phase 1: matrix 102 rows 80 cols
[2022-05-17 14:01:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 14:01:11] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-05-17 14:01:11] [INFO ] Flow matrix only has 102 transitions (discarded 227 similar events)
// Phase 1: matrix 102 rows 80 cols
[2022-05-17 14:01:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:11] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/247 places, 329/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/247 places, 329/476 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s56 s8), p0:(LEQ s37 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 80 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 329
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-12 finished in 935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Graph (complete) has 857 edges and 247 vertex of which 236 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 0 with 50 rules applied. Total rules applied 51 place count 236 transition count 424
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 186 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 185 transition count 423
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 103 place count 185 transition count 400
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 149 place count 162 transition count 400
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 177 place count 134 transition count 372
Iterating global reduction 3 with 28 rules applied. Total rules applied 205 place count 134 transition count 372
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 212 place count 127 transition count 365
Iterating global reduction 3 with 7 rules applied. Total rules applied 219 place count 127 transition count 365
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 124 transition count 365
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 222 place count 124 transition count 362
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 121 transition count 362
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 118 transition count 359
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 118 transition count 359
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 237 place count 115 transition count 356
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 115 transition count 356
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 292 place count 89 transition count 330
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 303 place count 78 transition count 319
Iterating global reduction 4 with 11 rules applied. Total rules applied 314 place count 78 transition count 319
Applied a total of 314 rules in 35 ms. Remains 78 /247 variables (removed 169) and now considering 319/476 (removed 157) transitions.
[2022-05-17 14:01:12] [INFO ] Flow matrix only has 161 transitions (discarded 158 similar events)
// Phase 1: matrix 161 rows 78 cols
[2022-05-17 14:01:12] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-17 14:01:12] [INFO ] Implicit Places using invariants in 56 ms returned [8, 16, 20, 24, 30, 34, 44, 50, 58, 59]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 57 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/247 places, 319/476 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 311
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 52 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 52 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 50 transition count 301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 48 transition count 299
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 48 transition count 299
Applied a total of 40 rules in 8 ms. Remains 48 /68 variables (removed 20) and now considering 299/319 (removed 20) transitions.
[2022-05-17 14:01:12] [INFO ] Flow matrix only has 61 transitions (discarded 238 similar events)
// Phase 1: matrix 61 rows 48 cols
[2022-05-17 14:01:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 14:01:12] [INFO ] Flow matrix only has 61 transitions (discarded 238 similar events)
// Phase 1: matrix 61 rows 48 cols
[2022-05-17 14:01:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:01:12] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/247 places, 299/476 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/247 places, 299/476 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s9 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-13 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||(p0 U p1)||p2)))'
Found a SL insensitive property : LeafsetExtension-PT-S16C4-LTLCardinality-05
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 247 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 247/247 places, 476/476 transitions.
Graph (complete) has 857 edges and 247 vertex of which 238 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 238 transition count 425
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 189 transition count 425
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 99 place count 189 transition count 406
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 137 place count 170 transition count 406
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 163 place count 144 transition count 380
Iterating global reduction 2 with 26 rules applied. Total rules applied 189 place count 144 transition count 380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 137 transition count 373
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 137 transition count 373
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 206 place count 134 transition count 373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 206 place count 134 transition count 370
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 212 place count 131 transition count 370
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 128 transition count 367
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 128 transition count 367
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 221 place count 125 transition count 364
Iterating global reduction 3 with 3 rules applied. Total rules applied 224 place count 125 transition count 364
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 284 place count 95 transition count 334
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 294 place count 85 transition count 324
Iterating global reduction 3 with 10 rules applied. Total rules applied 304 place count 85 transition count 324
Applied a total of 304 rules in 38 ms. Remains 85 /247 variables (removed 162) and now considering 324/476 (removed 152) transitions.
[2022-05-17 14:01:12] [INFO ] Flow matrix only has 161 transitions (discarded 163 similar events)
// Phase 1: matrix 161 rows 85 cols
[2022-05-17 14:01:12] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 14:01:12] [INFO ] Implicit Places using invariants in 67 ms returned [10, 16, 20, 24, 32, 36, 56, 65, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 68 ms to find 9 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 76/247 places, 324/476 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 317
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 317
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 62 transition count 310
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 62 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 60 transition count 308
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 58 transition count 306
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 58 transition count 306
Applied a total of 36 rules in 7 ms. Remains 58 /76 variables (removed 18) and now considering 306/324 (removed 18) transitions.
[2022-05-17 14:01:12] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-17 14:01:13] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:13] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 58/247 places, 306/476 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/247 places, 306/476 transitions.
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(LEQ s37 s29), p1:(LEQ s48 s7), p0:(LEQ s41 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6635 reset in 196 ms.
Product exploration explored 100000 steps with 6634 reset in 210 ms.
Computed a total of 58 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 306
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 929 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 608 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 14:01:14] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 14:01:14] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 14:01:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 14:01:14] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 14:01:15] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 14:01:15] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 14:01:15] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 306/306 transitions.
Graph (complete) has 154 edges and 58 vertex of which 39 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Drop transitions removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 39 transition count 131
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 165 place count 36 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 165 place count 36 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 33 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 33 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 175 place count 31 transition count 108
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 31 transition count 92
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 200 place count 31 transition count 83
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 209 place count 22 transition count 83
Applied a total of 209 rules in 13 ms. Remains 22 /58 variables (removed 36) and now considering 83/306 (removed 223) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/58 places, 83/306 transitions.
Finished random walk after 7302 steps, including 1182 resets, run visited all 3 properties in 17 ms. (steps per millisecond=429 )
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 15 factoid took 1164 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 306/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2022-05-17 14:01:16] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 14:01:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-17 14:01:16] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-17 14:01:16] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:01:16] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 306/306 transitions.
Computed a total of 58 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 306
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 762 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 616 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 14:01:18] [INFO ] Flow matrix only has 71 transitions (discarded 235 similar events)
// Phase 1: matrix 71 rows 58 cols
[2022-05-17 14:01:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:18] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 14:01:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 14:01:18] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-17 14:01:18] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 14:01:18] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 14:01:18] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 306/306 transitions.
Graph (complete) has 154 edges and 58 vertex of which 39 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Drop transitions removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 39 transition count 131
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 165 place count 36 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 165 place count 36 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 33 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 33 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 175 place count 31 transition count 108
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 31 transition count 92
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 200 place count 31 transition count 83
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 209 place count 22 transition count 83
Applied a total of 209 rules in 13 ms. Remains 22 /58 variables (removed 36) and now considering 83/306 (removed 223) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/58 places, 83/306 transitions.
Finished random walk after 1152 steps, including 187 resets, run visited all 3 properties in 18 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 15 factoid took 947 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6617 reset in 224 ms.
Entered a terminal (fully accepting) state of product in 607 steps with 39 reset in 1 ms.
Treatment of property LeafsetExtension-PT-S16C4-LTLCardinality-05 finished in 7581 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLCardinality-05 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-17 14:01:20] [INFO ] Flatten gal took : 21 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 108075 ms.
BK_STOP 1652796080643
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S16C4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821000491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S16C4.tgz
mv LeafsetExtension-PT-S16C4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;