About the Execution of ITS-Tools for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8430.075 | 3600000.00 | 10594854.00 | 11872.50 | FFFFTF??FF?FFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r064-tall-162038396800141.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396800141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K May 5 16:51 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 DES-PT-50b-00
FORMULA_NAME DES-PT-50b-01
FORMULA_NAME DES-PT-50b-02
FORMULA_NAME DES-PT-50b-03
FORMULA_NAME DES-PT-50b-04
FORMULA_NAME DES-PT-50b-05
FORMULA_NAME DES-PT-50b-06
FORMULA_NAME DES-PT-50b-07
FORMULA_NAME DES-PT-50b-08
FORMULA_NAME DES-PT-50b-09
FORMULA_NAME DES-PT-50b-10
FORMULA_NAME DES-PT-50b-11
FORMULA_NAME DES-PT-50b-12
FORMULA_NAME DES-PT-50b-13
FORMULA_NAME DES-PT-50b-14
FORMULA_NAME DES-PT-50b-15
=== Now, execution of the tool begins
BK_START 1620481566085
Running Version 0
[2021-05-08 13:46:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 13:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 13:46:09] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-08 13:46:09] [INFO ] Transformed 479 places.
[2021-05-08 13:46:09] [INFO ] Transformed 430 transitions.
[2021-05-08 13:46:09] [INFO ] Found NUPN structural information;
[2021-05-08 13:46:09] [INFO ] Parsed PT model containing 479 places and 430 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 13:46:09] [INFO ] Initial state test concluded for 3 properties.
FORMULA DES-PT-50b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 453 transition count 407
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 453 transition count 407
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 439 transition count 393
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 439 transition count 393
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 439 transition count 382
Applied a total of 88 rules in 109 ms. Remains 439 /479 variables (removed 40) and now considering 382/430 (removed 48) transitions.
// Phase 1: matrix 382 rows 439 cols
[2021-05-08 13:46:09] [INFO ] Computed 62 place invariants in 47 ms
[2021-05-08 13:46:10] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 382 rows 439 cols
[2021-05-08 13:46:10] [INFO ] Computed 62 place invariants in 18 ms
[2021-05-08 13:46:10] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 439 cols
[2021-05-08 13:46:10] [INFO ] Computed 62 place invariants in 15 ms
[2021-05-08 13:46:10] [INFO ] Dead Transitions using invariants and state equation in 216 ms returned []
Finished structural reductions, in 1 iterations. Remains : 439/479 places, 382/430 transitions.
[2021-05-08 13:46:11] [INFO ] Flatten gal took : 64 ms
[2021-05-08 13:46:11] [INFO ] Flatten gal took : 31 ms
[2021-05-08 13:46:11] [INFO ] Input system was already deterministic with 382 transitions.
Incomplete random walk after 100000 steps, including 878 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 33) seen :17
Running SMT prover for 16 properties.
// Phase 1: matrix 382 rows 439 cols
[2021-05-08 13:46:11] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:46:11] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:11] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 13:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:11] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-08 13:46:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 13:46:11] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-08 13:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:12] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-08 13:46:12] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 4 ms to minimize.
[2021-05-08 13:46:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2021-05-08 13:46:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2021-05-08 13:46:12] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-08 13:46:14] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2021-05-08 13:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2021-05-08 13:46:14] [INFO ] Added : 257 causal constraints over 52 iterations in 1621 ms. Result :sat
[2021-05-08 13:46:14] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 13:46:14] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 13:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:14] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 13:46:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 13:46:14] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-08 13:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:14] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-08 13:46:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2021-05-08 13:46:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2021-05-08 13:46:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2021-05-08 13:46:14] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 31 ms.
[2021-05-08 13:46:16] [INFO ] Added : 281 causal constraints over 57 iterations in 1536 ms. Result :sat
[2021-05-08 13:46:16] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 13:46:16] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:16] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-08 13:46:16] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2021-05-08 13:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-08 13:46:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:16] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-08 13:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:16] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-08 13:46:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2021-05-08 13:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-08 13:46:16] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-08 13:46:18] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2021-05-08 13:46:18] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2021-05-08 13:46:18] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2021-05-08 13:46:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 385 ms
[2021-05-08 13:46:19] [INFO ] Added : 305 causal constraints over 62 iterations in 2118 ms. Result :sat
[2021-05-08 13:46:19] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:19] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:19] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-08 13:46:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-08 13:46:19] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:19] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-08 13:46:19] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-08 13:46:20] [INFO ] Added : 189 causal constraints over 38 iterations in 1181 ms. Result :sat
[2021-05-08 13:46:20] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:20] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-08 13:46:21] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2021-05-08 13:46:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2021-05-08 13:46:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2021-05-08 13:46:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2021-05-08 13:46:21] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 46 ms returned sat
[2021-05-08 13:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:21] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-08 13:46:21] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2021-05-08 13:46:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2021-05-08 13:46:21] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2021-05-08 13:46:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2021-05-08 13:46:21] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-08 13:46:22] [INFO ] Added : 229 causal constraints over 47 iterations in 1144 ms. Result :sat
[2021-05-08 13:46:22] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 13:46:22] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-08 13:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:23] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-08 13:46:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:23] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:23] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-08 13:46:23] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-08 13:46:24] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-08 13:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2021-05-08 13:46:25] [INFO ] Added : 221 causal constraints over 45 iterations in 1626 ms. Result :sat
[2021-05-08 13:46:25] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:25] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:25] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-08 13:46:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:25] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:25] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-08 13:46:25] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2021-05-08 13:46:25] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2021-05-08 13:46:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2021-05-08 13:46:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2021-05-08 13:46:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2021-05-08 13:46:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 294 ms
[2021-05-08 13:46:25] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-08 13:46:27] [INFO ] Added : 295 causal constraints over 59 iterations in 1585 ms. Result :sat
[2021-05-08 13:46:27] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:27] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-08 13:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:27] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 13:46:27] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:27] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2021-05-08 13:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2021-05-08 13:46:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 13:46:27] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:28] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-08 13:46:28] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 13:46:29] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2021-05-08 13:46:29] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 0 ms to minimize.
[2021-05-08 13:46:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2021-05-08 13:46:30] [INFO ] Added : 294 causal constraints over 60 iterations in 1864 ms. Result :sat
[2021-05-08 13:46:30] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:30] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:30] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-08 13:46:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 13:46:30] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-08 13:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:30] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-08 13:46:30] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-08 13:46:32] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2021-05-08 13:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2021-05-08 13:46:32] [INFO ] Added : 288 causal constraints over 58 iterations in 1610 ms. Result :sat
[2021-05-08 13:46:32] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:32] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:32] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-08 13:46:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:32] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:32] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-08 13:46:32] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2021-05-08 13:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-08 13:46:32] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 13:46:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2021-05-08 13:46:33] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2021-05-08 13:46:33] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-08 13:46:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 854 ms
[2021-05-08 13:46:34] [INFO ] Added : 211 causal constraints over 43 iterations in 1949 ms. Result :sat
[2021-05-08 13:46:34] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:34] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:34] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-08 13:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:34] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:35] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2021-05-08 13:46:35] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2021-05-08 13:46:36] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2021-05-08 13:46:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 972 ms
[2021-05-08 13:46:36] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 13:46:37] [INFO ] Added : 265 causal constraints over 53 iterations in 1446 ms. Result :sat
[2021-05-08 13:46:37] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:37] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:37] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-08 13:46:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:37] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:37] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 13:46:38] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2021-05-08 13:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2021-05-08 13:46:38] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-08 13:46:39] [INFO ] Added : 182 causal constraints over 37 iterations in 949 ms. Result :sat
[2021-05-08 13:46:39] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:39] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-08 13:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:39] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-08 13:46:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:39] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:39] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2021-05-08 13:46:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2021-05-08 13:46:39] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 13:46:41] [INFO ] Added : 222 causal constraints over 45 iterations in 1178 ms. Result :sat
[2021-05-08 13:46:41] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:41] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:41] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-08 13:46:41] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2021-05-08 13:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-08 13:46:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:41] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-08 13:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:41] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-08 13:46:41] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2021-05-08 13:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-08 13:46:41] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 13:46:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2021-05-08 13:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2021-05-08 13:46:43] [INFO ] Added : 329 causal constraints over 66 iterations in 1771 ms. Result :sat
[2021-05-08 13:46:43] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:43] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-08 13:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:43] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-08 13:46:43] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-08 13:46:43] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2021-05-08 13:46:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2021-05-08 13:46:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 13:46:43] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:43] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-08 13:46:43] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2021-05-08 13:46:43] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
[2021-05-08 13:46:44] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2021-05-08 13:46:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2021-05-08 13:46:44] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 13:46:45] [INFO ] Added : 304 causal constraints over 61 iterations in 1444 ms. Result :sat
[2021-05-08 13:46:45] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:45] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-08 13:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:45] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-08 13:46:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:46:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 13:46:45] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-08 13:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:46:45] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-08 13:46:45] [INFO ] Computed and/alt/rep : 376/841/376 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-08 13:46:47] [INFO ] Added : 226 causal constraints over 46 iterations in 1143 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 48 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:47] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 13:46:47] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:47] [INFO ] Computed 62 place invariants in 9 ms
[2021-05-08 13:46:47] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:47] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-08 13:46:48] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 746 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s289 1)), p0:(EQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 3 ms.
FORMULA DES-PT-50b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-00 finished in 1780 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U X(X(X(G(p1))))) U X(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 434 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 434 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 434 transition count 375
Applied a total of 12 rules in 33 ms. Remains 434 /439 variables (removed 5) and now considering 375/382 (removed 7) transitions.
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:48] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 13:46:49] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:49] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:49] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:49] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:49] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 434/439 places, 375/382 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-50b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 7}, { cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s226 0), p2:(EQ s226 1), p1:(AND (EQ s27 1) (EQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 2 ms.
FORMULA DES-PT-50b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-01 finished in 1189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p1&&X(p2))||p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 434 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 434 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 434 transition count 375
Applied a total of 12 rules in 24 ms. Remains 434 /439 variables (removed 5) and now considering 375/382 (removed 7) transitions.
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:50] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:50] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:50] [INFO ] Computed 62 place invariants in 9 ms
[2021-05-08 13:46:50] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
// Phase 1: matrix 375 rows 434 cols
[2021-05-08 13:46:50] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 13:46:51] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 434/439 places, 375/382 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : DES-PT-50b-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s232 0) (EQ s397 0)), p1:(EQ s273 0), p2:(OR (NEQ s280 1) (NEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1125 steps with 9 reset in 15 ms.
FORMULA DES-PT-50b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-02 finished in 1019 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0 U X(G((p1&&F(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 32 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:51] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:51] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:51] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:51] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:51] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:46:52] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DES-PT-50b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s404 1), p0:(AND (EQ s348 1) (EQ s379 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-03 finished in 1117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((p0 U ((p0 U (p2||G(p0)))||p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 26 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:52] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:52] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:52] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:46:52] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:46:52] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:46:53] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s64 1) (NEQ s425 1)), p1:(OR (NEQ s345 1) (NEQ s377 1)), p2:(AND (OR (NEQ s345 1) (NEQ s377 1)) (OR (NEQ s64 1) (NEQ s425 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
[2021-05-08 13:46:54] [INFO ] Flatten gal took : 28 ms
[2021-05-08 13:46:55] [INFO ] Flatten gal took : 25 ms
[2021-05-08 13:46:55] [INFO ] Time to serialize gal into /tmp/LTL9596311848816521641.gal : 20 ms
[2021-05-08 13:46:55] [INFO ] Time to serialize properties into /tmp/LTL11133478274677333438.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9596311848816521641.gal, -t, CGAL, -LTL, /tmp/LTL11133478274677333438.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9596311848816521641.gal -t CGAL -LTL /tmp/LTL11133478274677333438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(("((p65!=1)||(p471!=1))")U(("((p386!=1)||(p418!=1))")||(("((p65!=1)||(p471!=1))")U(("(((p386!=1)||(p418!=1))&&((p65!=1)||(p471!=1)))")||(G("((p65!=1)||(p471!=1))")))))))&&("((p65!=1)||(p471!=1))"))))
Formula 0 simplified : !F("((p65!=1)||(p471!=1))" & X("((p65!=1)||(p471!=1))" U ("((p386!=1)||(p418!=1))" | ("((p65!=1)||(p471!=1))" U ("(((p386!=1)||(p418!=1))&&((p65!=1)||(p471!=1)))" | G"((p65!=1)||(p471!=1))")))))
Detected timeout of ITS tools.
[2021-05-08 13:47:10] [INFO ] Flatten gal took : 23 ms
[2021-05-08 13:47:10] [INFO ] Applying decomposition
[2021-05-08 13:47:10] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6734784486923849234.txt, -o, /tmp/graph6734784486923849234.bin, -w, /tmp/graph6734784486923849234.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6734784486923849234.bin, -l, -1, -v, -w, /tmp/graph6734784486923849234.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:47:10] [INFO ] Decomposing Gal with order
[2021-05-08 13:47:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:47:10] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-08 13:47:10] [INFO ] Flatten gal took : 56 ms
[2021-05-08 13:47:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2021-05-08 13:47:10] [INFO ] Time to serialize gal into /tmp/LTL10543205023732620909.gal : 7 ms
[2021-05-08 13:47:10] [INFO ] Time to serialize properties into /tmp/LTL13924108581702973489.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10543205023732620909.gal, -t, CGAL, -LTL, /tmp/LTL13924108581702973489.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10543205023732620909.gal -t CGAL -LTL /tmp/LTL13924108581702973489.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(("((u72.p65!=1)||(u72.p471!=1))")U(("((i7.i1.i1.u47.p386!=1)||(i7.i1.i5.u58.p418!=1))")||(("((u72.p65!=1)||(u72.p471!=1))")U(("(((i7.i1.i1.u47.p386!=1)||(i7.i1.i5.u58.p418!=1))&&((u72.p65!=1)||(u72.p471!=1)))")||(G("((u72.p65!=1)||(u72.p471!=1))")))))))&&("((u72.p65!=1)||(u72.p471!=1))"))))
Formula 0 simplified : !F("((u72.p65!=1)||(u72.p471!=1))" & X("((u72.p65!=1)||(u72.p471!=1))" U ("((i7.i1.i1.u47.p386!=1)||(i7.i1.i5.u58.p418!=1))" | ("((u72.p65!=1)||(u72.p471!=1))" U ("(((i7.i1.i1.u47.p386!=1)||(i7.i1.i5.u58.p418!=1))&&((u72.p65!=1)||(u72.p471!=1)))" | G"((u72.p65!=1)||(u72.p471!=1))")))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10024115367968167819
[2021-05-08 13:47:25] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10024115367968167819
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10024115367968167819]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10024115367968167819] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10024115367968167819] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-50b-04 finished in 34169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 438 transition count 365
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 422 transition count 365
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 422 transition count 354
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 411 transition count 354
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 408 transition count 351
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 408 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 408 transition count 350
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 406 transition count 348
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 406 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 406 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 406 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 405 transition count 346
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 224 place count 327 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 326 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 325 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 324 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 323 transition count 266
Applied a total of 229 rules in 164 ms. Remains 323 /439 variables (removed 116) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 323 cols
[2021-05-08 13:47:26] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:47:26] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 266 rows 323 cols
[2021-05-08 13:47:26] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:47:27] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2021-05-08 13:47:27] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 266 rows 323 cols
[2021-05-08 13:47:27] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:47:27] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/439 places, 266/382 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 71 steps with 6 reset in 1 ms.
FORMULA DES-PT-50b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-05 finished in 949 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 29 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:47:27] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:47:27] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:47:27] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:47:28] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:47:28] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:47:28] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50b-06 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s241 1), p1:(OR (EQ s139 0) (EQ s282 0) (EQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8065 reset in 177 ms.
Product exploration explored 100000 steps with 8028 reset in 181 ms.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8104 reset in 168 ms.
Product exploration explored 100000 steps with 8041 reset in 181 ms.
[2021-05-08 13:47:29] [INFO ] Flatten gal took : 20 ms
[2021-05-08 13:47:29] [INFO ] Flatten gal took : 20 ms
[2021-05-08 13:47:29] [INFO ] Time to serialize gal into /tmp/LTL9611854684142703986.gal : 3 ms
[2021-05-08 13:47:29] [INFO ] Time to serialize properties into /tmp/LTL5947146209971234676.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9611854684142703986.gal, -t, CGAL, -LTL, /tmp/LTL5947146209971234676.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9611854684142703986.gal -t CGAL -LTL /tmp/LTL5947146209971234676.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p268==1)")&&(X("(((p140==0)||(p323==0))||(p468==1))"))))))
Formula 0 simplified : !XF("(p268==1)" & X"(((p140==0)||(p323==0))||(p468==1))")
Detected timeout of ITS tools.
[2021-05-08 13:47:44] [INFO ] Flatten gal took : 19 ms
[2021-05-08 13:47:44] [INFO ] Applying decomposition
[2021-05-08 13:47:44] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11368893537312360867.txt, -o, /tmp/graph11368893537312360867.bin, -w, /tmp/graph11368893537312360867.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11368893537312360867.bin, -l, -1, -v, -w, /tmp/graph11368893537312360867.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:47:44] [INFO ] Decomposing Gal with order
[2021-05-08 13:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:47:44] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-08 13:47:44] [INFO ] Flatten gal took : 29 ms
[2021-05-08 13:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2021-05-08 13:47:44] [INFO ] Time to serialize gal into /tmp/LTL16295955765824119763.gal : 5 ms
[2021-05-08 13:47:44] [INFO ] Time to serialize properties into /tmp/LTL14722253039429445174.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16295955765824119763.gal, -t, CGAL, -LTL, /tmp/LTL14722253039429445174.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16295955765824119763.gal -t CGAL -LTL /tmp/LTL14722253039429445174.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i5.u5.p268==1)")&&(X("(((u31.p140==0)||(u31.p323==0))||(i8.i1.i1.u72.p468==1))"))))))
Formula 0 simplified : !XF("(i5.u5.p268==1)" & X"(((u31.p140==0)||(u31.p323==0))||(i8.i1.i1.u72.p468==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17609875410509077226
[2021-05-08 13:47:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17609875410509077226
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17609875410509077226]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17609875410509077226] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17609875410509077226] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-50b-06 finished in 33306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 438 transition count 365
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 422 transition count 364
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 422 transition count 353
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 411 transition count 353
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 408 transition count 350
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 408 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 408 transition count 349
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 406 transition count 347
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 406 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 406 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 406 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 405 transition count 345
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 223 place count 328 transition count 268
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 4 with 4 rules applied. Total rules applied 227 place count 326 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 323 transition count 268
Applied a total of 230 rules in 115 ms. Remains 323 /439 variables (removed 116) and now considering 268/382 (removed 114) transitions.
// Phase 1: matrix 268 rows 323 cols
[2021-05-08 13:48:00] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:48:00] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 268 rows 323 cols
[2021-05-08 13:48:00] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:48:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 13:48:01] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2021-05-08 13:48:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 268 rows 323 cols
[2021-05-08 13:48:01] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:48:01] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/439 places, 268/382 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s182 1) (NEQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4928 reset in 271 ms.
Product exploration explored 100000 steps with 4922 reset in 284 ms.
Graph (complete) has 1116 edges and 323 vertex of which 319 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4875 reset in 245 ms.
Product exploration explored 100000 steps with 4902 reset in 263 ms.
[2021-05-08 13:48:02] [INFO ] Flatten gal took : 17 ms
[2021-05-08 13:48:02] [INFO ] Flatten gal took : 15 ms
[2021-05-08 13:48:02] [INFO ] Time to serialize gal into /tmp/LTL4983371505273707816.gal : 2 ms
[2021-05-08 13:48:02] [INFO ] Time to serialize properties into /tmp/LTL2118060354230745295.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4983371505273707816.gal, -t, CGAL, -LTL, /tmp/LTL2118060354230745295.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4983371505273707816.gal -t CGAL -LTL /tmp/LTL2118060354230745295.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p187!=1)||(p229!=1))"))))
Formula 0 simplified : !GF"((p187!=1)||(p229!=1))"
Detected timeout of ITS tools.
[2021-05-08 13:48:17] [INFO ] Flatten gal took : 19 ms
[2021-05-08 13:48:17] [INFO ] Applying decomposition
[2021-05-08 13:48:17] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9517084863165518431.txt, -o, /tmp/graph9517084863165518431.bin, -w, /tmp/graph9517084863165518431.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9517084863165518431.bin, -l, -1, -v, -w, /tmp/graph9517084863165518431.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:48:18] [INFO ] Decomposing Gal with order
[2021-05-08 13:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:48:18] [INFO ] Removed a total of 88 redundant transitions.
[2021-05-08 13:48:18] [INFO ] Flatten gal took : 24 ms
[2021-05-08 13:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2021-05-08 13:48:18] [INFO ] Time to serialize gal into /tmp/LTL14365947185319811951.gal : 3 ms
[2021-05-08 13:48:18] [INFO ] Time to serialize properties into /tmp/LTL4805623939552000942.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14365947185319811951.gal, -t, CGAL, -LTL, /tmp/LTL4805623939552000942.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14365947185319811951.gal -t CGAL -LTL /tmp/LTL4805623939552000942.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u2.p187!=1)||(u2.p229!=1))"))))
Formula 0 simplified : !GF"((u2.p187!=1)||(u2.p229!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16430568082386041658
[2021-05-08 13:48:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16430568082386041658
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16430568082386041658]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16430568082386041658] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16430568082386041658] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-50b-07 finished in 33457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||F(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 25 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:34] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:48:34] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:34] [INFO ] Computed 62 place invariants in 12 ms
[2021-05-08 13:48:34] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:34] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:48:35] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-50b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s75 1) (EQ s425 1)), p0:(AND (EQ s111 1) (EQ s282 1) (EQ s217 1)), p1:(OR (AND (EQ s75 1) (EQ s425 1)) (AND (EQ s111 1) (EQ s282 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-09 finished in 1092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(G((F(p2)||(p3 U X(p4)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 433 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 23 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:35] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:48:35] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:35] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:48:35] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2021-05-08 13:48:35] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:48:36] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p3 (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p3 (NOT p4)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p4)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s120 1) (EQ s282 1)), p0:(AND (EQ s76 1) (EQ s425 1)), p2:(OR (EQ s120 0) (EQ s282 0)), p3:(AND (EQ s101 1) (EQ s425 1)), p4:(OR (NEQ s88 1) (NEQ s425 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 887 reset in 277 ms.
Product exploration explored 100000 steps with 881 reset in 226 ms.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), (NOT p0), p2, (NOT p3), p4]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 874 reset in 214 ms.
Product exploration explored 100000 steps with 887 reset in 243 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 433/433 places, 373/373 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 433 transition count 373
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 15 place count 433 transition count 423
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 433 transition count 423
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 428 transition count 418
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 428 transition count 418
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 111 place count 428 transition count 421
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 122 place count 417 transition count 410
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 133 place count 417 transition count 410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 139 place count 417 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 415 transition count 432
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 415 transition count 432
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 143 rules in 134 ms. Remains 415 /433 variables (removed 18) and now considering 432/373 (removed -59) transitions.
[2021-05-08 13:48:38] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2021-05-08 13:48:38] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 13:48:38] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/433 places, 432/373 transitions.
Product exploration explored 100000 steps with 873 reset in 242 ms.
Product exploration explored 100000 steps with 861 reset in 274 ms.
[2021-05-08 13:48:39] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:48:39] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:48:39] [INFO ] Time to serialize gal into /tmp/LTL2137093171759364128.gal : 2 ms
[2021-05-08 13:48:39] [INFO ] Time to serialize properties into /tmp/LTL7796381822981935698.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2137093171759364128.gal, -t, CGAL, -LTL, /tmp/LTL7796381822981935698.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2137093171759364128.gal -t CGAL -LTL /tmp/LTL7796381822981935698.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((p77==1)&&(p471==1))")U("((p121==1)&&(p323==1))"))||(X(G((F("((p121==0)||(p323==0))"))||(("((p102==1)&&(p471==1))")U(X("((p89!=1)||(p471!=1))"))))))))
Formula 0 simplified : !(("((p77==1)&&(p471==1))" U "((p121==1)&&(p323==1))") | XG(F"((p121==0)||(p323==0))" | ("((p102==1)&&(p471==1))" U X"((p89!=1)||(p471!=1))")))
Detected timeout of ITS tools.
[2021-05-08 13:48:54] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:48:54] [INFO ] Applying decomposition
[2021-05-08 13:48:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17819159108728534736.txt, -o, /tmp/graph17819159108728534736.bin, -w, /tmp/graph17819159108728534736.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17819159108728534736.bin, -l, -1, -v, -w, /tmp/graph17819159108728534736.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:48:54] [INFO ] Decomposing Gal with order
[2021-05-08 13:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:48:54] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-08 13:48:54] [INFO ] Flatten gal took : 25 ms
[2021-05-08 13:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2021-05-08 13:48:54] [INFO ] Time to serialize gal into /tmp/LTL6284640004718273384.gal : 66 ms
[2021-05-08 13:48:54] [INFO ] Time to serialize properties into /tmp/LTL9783530690440677283.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6284640004718273384.gal, -t, CGAL, -LTL, /tmp/LTL9783530690440677283.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6284640004718273384.gal -t CGAL -LTL /tmp/LTL9783530690440677283.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("((i9.u76.p77==1)&&(i9.u76.p471==1))")U("((u31.p121==1)&&(u31.p323==1))"))||(X(G((F("((u31.p121==0)||(u31.p323==0))"))||(("((i9.u76.p102==1)&&(i9.u76.p471==1))")U(X("((i9.u76.p89!=1)||(i9.u76.p471!=1))"))))))))
Formula 0 simplified : !(("((i9.u76.p77==1)&&(i9.u76.p471==1))" U "((u31.p121==1)&&(u31.p323==1))") | XG(F"((u31.p121==0)||(u31.p323==0))" | ("((i9.u76.p102==1)&&(i9.u76.p471==1))" U X"((i9.u76.p89!=1)||(i9.u76.p471!=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9515777502103789186
[2021-05-08 13:49:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9515777502103789186
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9515777502103789186]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9515777502103789186] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9515777502103789186] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-50b-10 finished in 35335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 438 transition count 365
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 422 transition count 364
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 422 transition count 352
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 410 transition count 352
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 408 transition count 350
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 408 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 408 transition count 349
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 407 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 407 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 407 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 407 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 406 transition count 346
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 217 place count 331 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 329 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 328 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 327 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 326 transition count 271
Applied a total of 224 rules in 123 ms. Remains 326 /439 variables (removed 113) and now considering 271/382 (removed 111) transitions.
// Phase 1: matrix 271 rows 326 cols
[2021-05-08 13:49:10] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:49:10] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 271 rows 326 cols
[2021-05-08 13:49:10] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 13:49:11] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2021-05-08 13:49:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 271 rows 326 cols
[2021-05-08 13:49:11] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:49:11] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 326/439 places, 271/382 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-50b-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s245 1), p0:(OR (AND (NEQ s318 1) (OR (NEQ s93 1) (NEQ s321 1))) (NEQ s245 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 170 steps with 6 reset in 1 ms.
FORMULA DES-PT-50b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-12 finished in 942 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G((G(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 436 transition count 377
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 435 transition count 376
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 435 transition count 376
Applied a total of 10 rules in 17 ms. Remains 435 /439 variables (removed 4) and now considering 376/382 (removed 6) transitions.
// Phase 1: matrix 376 rows 435 cols
[2021-05-08 13:49:11] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:49:11] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 376 rows 435 cols
[2021-05-08 13:49:11] [INFO ] Computed 62 place invariants in 9 ms
[2021-05-08 13:49:12] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 435 cols
[2021-05-08 13:49:12] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:49:12] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 435/439 places, 376/382 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-50b-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s173 1) (NEQ s222 1)), p2:(OR (NEQ s173 1) (NEQ s222 1)), p0:(AND (EQ s167 1) (EQ s222 1) (EQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 794 steps with 6 reset in 4 ms.
FORMULA DES-PT-50b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-13 finished in 997 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 435 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 434 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 434 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 434 transition count 374
Applied a total of 13 rules in 16 ms. Remains 434 /439 variables (removed 5) and now considering 374/382 (removed 8) transitions.
// Phase 1: matrix 374 rows 434 cols
[2021-05-08 13:49:12] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 13:49:12] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 374 rows 434 cols
[2021-05-08 13:49:12] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:49:13] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 374 rows 434 cols
[2021-05-08 13:49:13] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 13:49:13] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 434/439 places, 374/382 transitions.
Stuttering acceptance computed with spot in 6044 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-50b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s302 1) (EQ s421 1) (EQ s287 1)), p1:(EQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-14 finished in 6964 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0)||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 438 transition count 365
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 422 transition count 364
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 422 transition count 353
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 411 transition count 353
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 408 transition count 350
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 408 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 408 transition count 349
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 406 transition count 347
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 406 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 406 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 406 transition count 345
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 405 transition count 345
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 330 transition count 270
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 4 with 4 rules applied. Total rules applied 223 place count 328 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 327 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 326 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 325 transition count 270
Applied a total of 226 rules in 54 ms. Remains 325 /439 variables (removed 114) and now considering 270/382 (removed 112) transitions.
// Phase 1: matrix 270 rows 325 cols
[2021-05-08 13:49:19] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:49:19] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 270 rows 325 cols
[2021-05-08 13:49:19] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:49:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 13:49:20] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2021-05-08 13:49:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 270 rows 325 cols
[2021-05-08 13:49:20] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 13:49:20] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 325/439 places, 270/382 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s246 1), p0:(OR (EQ s185 0) (EQ s208 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4452 reset in 233 ms.
Product exploration explored 100000 steps with 4497 reset in 258 ms.
Graph (complete) has 1136 edges and 325 vertex of which 321 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4428 reset in 232 ms.
Product exploration explored 100000 steps with 4435 reset in 258 ms.
[2021-05-08 13:49:21] [INFO ] Flatten gal took : 12 ms
[2021-05-08 13:49:21] [INFO ] Flatten gal took : 12 ms
[2021-05-08 13:49:21] [INFO ] Time to serialize gal into /tmp/LTL7052054803015192849.gal : 2 ms
[2021-05-08 13:49:21] [INFO ] Time to serialize properties into /tmp/LTL12505311201396957315.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7052054803015192849.gal, -t, CGAL, -LTL, /tmp/LTL12505311201396957315.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7052054803015192849.gal -t CGAL -LTL /tmp/LTL12505311201396957315.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((p190==0)||(p229==0))"))||(X("(p346==1)"))))))
Formula 0 simplified : !FG(F"((p190==0)||(p229==0))" | X"(p346==1)")
Detected timeout of ITS tools.
[2021-05-08 13:49:36] [INFO ] Flatten gal took : 11 ms
[2021-05-08 13:49:36] [INFO ] Applying decomposition
[2021-05-08 13:49:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2868932888227823817.txt, -o, /tmp/graph2868932888227823817.bin, -w, /tmp/graph2868932888227823817.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2868932888227823817.bin, -l, -1, -v, -w, /tmp/graph2868932888227823817.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:49:36] [INFO ] Decomposing Gal with order
[2021-05-08 13:49:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:49:36] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-08 13:49:36] [INFO ] Flatten gal took : 20 ms
[2021-05-08 13:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2021-05-08 13:49:36] [INFO ] Time to serialize gal into /tmp/LTL14791773624061969569.gal : 1 ms
[2021-05-08 13:49:36] [INFO ] Time to serialize properties into /tmp/LTL17212686703250444403.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14791773624061969569.gal, -t, CGAL, -LTL, /tmp/LTL17212686703250444403.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14791773624061969569.gal -t CGAL -LTL /tmp/LTL17212686703250444403.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((u2.p190==0)||(u2.p229==0))"))||(X("(i5.i8.u13.p346==1)"))))))
Formula 0 simplified : !FG(F"((u2.p190==0)||(u2.p229==0))" | X"(i5.i8.u13.p346==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin220498410097334318
[2021-05-08 13:49:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin220498410097334318
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin220498410097334318]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin220498410097334318] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin220498410097334318] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-50b-15 finished in 33081 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12437388256249540034
[2021-05-08 13:49:52] [INFO ] Applying decomposition
[2021-05-08 13:49:52] [INFO ] Computing symmetric may disable matrix : 382 transitions.
[2021-05-08 13:49:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 13:49:52] [INFO ] Flatten gal took : 12 ms
[2021-05-08 13:49:52] [INFO ] Computing symmetric may enable matrix : 382 transitions.
[2021-05-08 13:49:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14654479659785666090.txt, -o, /tmp/graph14654479659785666090.bin, -w, /tmp/graph14654479659785666090.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14654479659785666090.bin, -l, -1, -v, -w, /tmp/graph14654479659785666090.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:49:52] [INFO ] Decomposing Gal with order
[2021-05-08 13:49:52] [INFO ] Computing Do-Not-Accords matrix : 382 transitions.
[2021-05-08 13:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:49:52] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 13:49:52] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12437388256249540034
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12437388256249540034]
[2021-05-08 13:49:52] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-08 13:49:52] [INFO ] Flatten gal took : 23 ms
[2021-05-08 13:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-08 13:49:52] [INFO ] Time to serialize gal into /tmp/LTLFireability16424428155146008955.gal : 3 ms
[2021-05-08 13:49:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10553021846880906110.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16424428155146008955.gal, -t, CGAL, -LTL, /tmp/LTLFireability10553021846880906110.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16424428155146008955.gal -t CGAL -LTL /tmp/LTLFireability10553021846880906110.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((F((!("((i10.u76.p65==1)&&(i10.u76.p471==1))"))&&(X((!("((i10.u76.p65==1)&&(i10.u76.p471==1))"))U(((!("((i8.i4.u51.p386==1)&&(i8.i4.u63.p418==1))"))||(G(!("((i10.u76.p65==1)&&(i10.u76.p471==1))"))))||((!("((i10.u76.p65==1)&&(i10.u76.p471==1))"))U(("((!((i8.i4.u51.p386==1)&&(i8.i4.u63.p418==1)))&&(!((i10.u76.p65==1)&&(i10.u76.p471==1))))")||(G(!("((i10.u76.p65==1)&&(i10.u76.p471==1))")))))))))))
Formula 0 simplified : !F(!"((i10.u76.p65==1)&&(i10.u76.p471==1))" & X(!"((i10.u76.p65==1)&&(i10.u76.p471==1))" U (!"((i8.i4.u51.p386==1)&&(i8.i4.u63.p418==1))" | G!"((i10.u76.p65==1)&&(i10.u76.p471==1))" | (!"((i10.u76.p65==1)&&(i10.u76.p471==1))" U ("((!((i8.i4.u51.p386==1)&&(i8.i4.u63.p418==1)))&&(!((i10.u76.p65==1)&&(i10.u76.p471==1))))" | G!"((i10.u76.p65==1)&&(i10.u76.p471==1))")))))
Compilation finished in 11834 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12437388256249540034]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true))))||(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
LTSmin run took 363 ms.
FORMULA DES-PT-50b-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp6==true) U (LTLAPp7==true))||X([]((<>((LTLAPp8==true))||((LTLAPp9==true) U X((LTLAPp10==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp6==true) U (LTLAPp7==true))||X([]((<>((LTLAPp8==true))||((LTLAPp9==true) U X((LTLAPp10==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((<>((LTLAPp11==true))||X((LTLAPp12==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((<>((LTLAPp11==true))||X((LTLAPp12==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
Detected timeout of ITS tools.
[2021-05-08 14:11:06] [INFO ] Applying decomposition
[2021-05-08 14:11:06] [INFO ] Flatten gal took : 36 ms
[2021-05-08 14:11:06] [INFO ] Decomposing Gal with order
[2021-05-08 14:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:11:07] [INFO ] Removed a total of 206 redundant transitions.
[2021-05-08 14:11:07] [INFO ] Flatten gal took : 78 ms
[2021-05-08 14:11:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 681 labels/synchronizations in 48 ms.
[2021-05-08 14:11:07] [INFO ] Time to serialize gal into /tmp/LTLFireability12289243812634589097.gal : 3 ms
[2021-05-08 14:11:07] [INFO ] Time to serialize properties into /tmp/LTLFireability11640705001784649622.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12289243812634589097.gal, -t, CGAL, -LTL, /tmp/LTLFireability11640705001784649622.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12289243812634589097.gal -t CGAL -LTL /tmp/LTLFireability11640705001784649622.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(F(("(i1.i0.i1.i0.u129.p268==1)")&&(X("(((i0.i0.u6.p140==0)||(i1.i0.i1.u35.p323==0))||(i1.i1.i0.i1.u103.p468==1))"))))))
Formula 0 simplified : !XF("(i1.i0.i1.i0.u129.p268==1)" & X"(((i0.i0.u6.p140==0)||(i1.i0.i1.u35.p323==0))||(i1.i1.i0.i1.u103.p468==1))")
Detected timeout of ITS tools.
[2021-05-08 14:32:21] [INFO ] Flatten gal took : 20 ms
[2021-05-08 14:32:21] [INFO ] Input system was already deterministic with 382 transitions.
[2021-05-08 14:32:21] [INFO ] Transformed 439 places.
[2021-05-08 14:32:21] [INFO ] Transformed 382 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 14:32:21] [INFO ] Time to serialize gal into /tmp/LTLFireability13893415863452184946.gal : 2 ms
[2021-05-08 14:32:21] [INFO ] Time to serialize properties into /tmp/LTLFireability10539272162050875245.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13893415863452184946.gal, -t, CGAL, -LTL, /tmp/LTLFireability10539272162050875245.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13893415863452184946.gal -t CGAL -LTL /tmp/LTLFireability10539272162050875245.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p268==1)")&&(X("(((p140==0)||(p323==0))||(p468==1))"))))))
Formula 0 simplified : !XF("(p268==1)" & X"(((p140==0)||(p323==0))||(p468==1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.118: LTL layer: formula: X(<>(((LTLAPp3==true)&&X((LTLAPp4==true)))))
pins2lts-mc-linux64( 0/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.123: "X(<>(((LTLAPp3==true)&&X((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.124: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.138: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.367: DFS-FIFO for weak LTL, using special progress label 396
pins2lts-mc-linux64( 0/ 8), 0.367: There are 397 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.367: State length is 440, there are 387 groups
pins2lts-mc-linux64( 0/ 8), 0.367: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.367: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.367: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.367: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.478: ~66 levels ~960 states ~3120 transitions
pins2lts-mc-linux64( 7/ 8), 0.481: ~70 levels ~1920 states ~3920 transitions
pins2lts-mc-linux64( 3/ 8), 0.500: ~76 levels ~3840 states ~7752 transitions
pins2lts-mc-linux64( 7/ 8), 0.524: ~80 levels ~7680 states ~12080 transitions
pins2lts-mc-linux64( 7/ 8), 0.575: ~80 levels ~15360 states ~25216 transitions
pins2lts-mc-linux64( 7/ 8), 0.689: ~80 levels ~30720 states ~55104 transitions
pins2lts-mc-linux64( 6/ 8), 0.937: ~79 levels ~61440 states ~122408 transitions
pins2lts-mc-linux64( 6/ 8), 1.397: ~79 levels ~122880 states ~252936 transitions
pins2lts-mc-linux64( 6/ 8), 2.406: ~79 levels ~245760 states ~541704 transitions
pins2lts-mc-linux64( 6/ 8), 4.468: ~79 levels ~491520 states ~1179392 transitions
pins2lts-mc-linux64( 6/ 8), 8.897: ~79 levels ~983040 states ~2553224 transitions
pins2lts-mc-linux64( 6/ 8), 18.243: ~79 levels ~1966080 states ~5225936 transitions
pins2lts-mc-linux64( 0/ 8), 38.055: ~77 levels ~3932160 states ~10716696 transitions
pins2lts-mc-linux64( 5/ 8), 78.563: ~88 levels ~7864320 states ~22481952 transitions
pins2lts-mc-linux64( 5/ 8), 160.515: ~88 levels ~15728640 states ~48174288 transitions
pins2lts-mc-linux64( 6/ 8), 325.465: ~80 levels ~31457280 states ~98919656 transitions
pins2lts-mc-linux64( 1/ 8), 658.742: ~152 levels ~62914560 states ~200407048 transitions
pins2lts-mc-linux64( 7/ 8), 1362.265: ~124 levels ~125829120 states ~417275504 transitions
pins2lts-mc-linux64( 4/ 8), 1513.687: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1513.736:
pins2lts-mc-linux64( 0/ 8), 1513.736: mean standard work distribution: 2.3% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1513.736:
pins2lts-mc-linux64( 0/ 8), 1513.736: Explored 134221163 states 465666479 transitions, fanout: 3.469
pins2lts-mc-linux64( 0/ 8), 1513.736: Total exploration time 1513.370 sec (1513.310 sec minimum, 1513.334 sec on average)
pins2lts-mc-linux64( 0/ 8), 1513.736: States per second: 88690, Transitions per second: 307702
pins2lts-mc-linux64( 0/ 8), 1513.736:
pins2lts-mc-linux64( 0/ 8), 1513.736: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1513.736: Redundant explorations: 0.0028
pins2lts-mc-linux64( 0/ 8), 1513.736:
pins2lts-mc-linux64( 0/ 8), 1513.736: Queue width: 8B, total height: 885, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1513.736: Tree memory: 1036.8MB, 8.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1513.736: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1513.736: Stored 535 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1513.736: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1513.736: Est. total memory use: 1036.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12437388256249540034]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DES-PT-50b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-50b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038396800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;