About the Execution of ITS-Tools for HypertorusGrid-PT-d3k3p2b06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.888 | 3600000.00 | 3517532.00 | 529554.60 | FF?FF?FFF?FFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820300052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HypertorusGrid-PT-d3k3p2b06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820300052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K Apr 30 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 09:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 09:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 522K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-00
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-01
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-02
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-03
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-04
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-05
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-06
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-07
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-08
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-09
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-10
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-11
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-12
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-13
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-14
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652738369725
Running Version 202205111006
[2022-05-16 21:59:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 21:59:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 21:59:31] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-05-16 21:59:31] [INFO ] Transformed 513 places.
[2022-05-16 21:59:31] [INFO ] Transformed 972 transitions.
[2022-05-16 21:59:31] [INFO ] Parsed PT model containing 513 places and 972 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 56 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:31] [INFO ] Computed 190 place invariants in 39 ms
[2022-05-16 21:59:31] [INFO ] Implicit Places using invariants in 487 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:31] [INFO ] Computed 190 place invariants in 20 ms
[2022-05-16 21:59:32] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:32] [INFO ] Computed 190 place invariants in 16 ms
[2022-05-16 21:59:32] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Support contains 60 out of 513 places after structural reductions.
[2022-05-16 21:59:32] [INFO ] Flatten gal took : 104 ms
[2022-05-16 21:59:33] [INFO ] Flatten gal took : 67 ms
[2022-05-16 21:59:33] [INFO ] Input system was already deterministic with 972 transitions.
Finished random walk after 6517 steps, including 1 resets, run visited all 34 properties in 353 ms. (steps per millisecond=18 )
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&G(X(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:33] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:59:34] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:34] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:59:34] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:34] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:59:35] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s164 1) (GEQ s245 1)), p0:(OR (LT s183 1) (LT s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-01 finished in 1512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(G(F(p0))))&&(F(p2)||p1))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:35] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 21:59:35] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:35] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 21:59:36] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2022-05-16 21:59:36] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:36] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 21:59:36] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s170 1) (LT s197 1)), p1:(OR (LT s132 1) (LT s510 1)), p2:(AND (GEQ s170 1) (GEQ s197 1) (GEQ s162 1) (GEQ s406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 98 reset in 3156 ms.
Product exploration explored 100000 steps with 68 reset in 3080 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 1271 steps, including 0 resets, run visited all 3 properties in 46 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 318 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:44] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:59:44] [INFO ] [Real]Absence check using 189 positive place invariants in 134 ms returned sat
[2022-05-16 21:59:44] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 21:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:59:45] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2022-05-16 21:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:59:45] [INFO ] [Nat]Absence check using 189 positive place invariants in 77 ms returned sat
[2022-05-16 21:59:45] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 24 ms returned sat
[2022-05-16 21:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:59:46] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2022-05-16 21:59:46] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-16 21:59:47] [INFO ] Added : 160 causal constraints over 32 iterations in 1674 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 24 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:47] [INFO ] Computed 190 place invariants in 12 ms
[2022-05-16 21:59:48] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:48] [INFO ] Computed 190 place invariants in 14 ms
[2022-05-16 21:59:48] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2022-05-16 21:59:48] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:48] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 21:59:49] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 2374 steps, including 0 resets, run visited all 3 properties in 82 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 344 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:59:50] [INFO ] Computed 190 place invariants in 28 ms
[2022-05-16 21:59:50] [INFO ] [Real]Absence check using 189 positive place invariants in 141 ms returned sat
[2022-05-16 21:59:50] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 21:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:59:51] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2022-05-16 21:59:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:59:51] [INFO ] [Nat]Absence check using 189 positive place invariants in 76 ms returned sat
[2022-05-16 21:59:51] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 18 ms returned sat
[2022-05-16 21:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:59:52] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-05-16 21:59:52] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 47 ms.
[2022-05-16 21:59:53] [INFO ] Added : 160 causal constraints over 32 iterations in 1544 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 81 reset in 2919 ms.
Product exploration explored 100000 steps with 67 reset in 3048 ms.
Built C files in :
/tmp/ltsmin8356191817279491364
[2022-05-16 21:59:59] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:59:59] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:59:59] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:59:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:00:00] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:00:00] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:00:00] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8356191817279491364
Running compilation step : cd /tmp/ltsmin8356191817279491364;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2715 ms.
Running link step : cd /tmp/ltsmin8356191817279491364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin8356191817279491364;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3220728479454925167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 29 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:00:15] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:00:15] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:00:15] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:00:15] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2022-05-16 22:00:15] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:00:15] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:00:16] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin13908361368085430978
[2022-05-16 22:00:16] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:00:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:00:16] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:00:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:00:16] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:00:16] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:00:16] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13908361368085430978
Running compilation step : cd /tmp/ltsmin13908361368085430978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2746 ms.
Running link step : cd /tmp/ltsmin13908361368085430978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13908361368085430978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12681993056611220490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:00:31] [INFO ] Flatten gal took : 64 ms
[2022-05-16 22:00:31] [INFO ] Flatten gal took : 51 ms
[2022-05-16 22:00:31] [INFO ] Time to serialize gal into /tmp/LTL4997784187066035007.gal : 8 ms
[2022-05-16 22:00:31] [INFO ] Time to serialize properties into /tmp/LTL14027178758501082939.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4997784187066035007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14027178758501082939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4997784...267
Read 1 LTL properties
Checking formula 0 : !((G((G(X(G(F("((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))")))))&&(((F("(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=1))&&((pbl_1_1_1>=1)&&(po_d3_n1_1_1...220
Formula 0 simplified : !G(GXGF"((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))" & ("(pb_d3_n1_3_3_1<1)" | "(pol_d3_n1_3_3_1<1)" | F"(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=...201
Detected timeout of ITS tools.
[2022-05-16 22:00:46] [INFO ] Flatten gal took : 45 ms
[2022-05-16 22:00:46] [INFO ] Applying decomposition
[2022-05-16 22:00:46] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2285174739342894314.txt' '-o' '/tmp/graph2285174739342894314.bin' '-w' '/tmp/graph2285174739342894314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2285174739342894314.bin' '-l' '-1' '-v' '-w' '/tmp/graph2285174739342894314.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:00:46] [INFO ] Decomposing Gal with order
[2022-05-16 22:00:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:00:47] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:00:47] [INFO ] Flatten gal took : 139 ms
[2022-05-16 22:00:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-16 22:00:47] [INFO ] Time to serialize gal into /tmp/LTL16259219665572313090.gal : 10 ms
[2022-05-16 22:00:47] [INFO ] Time to serialize properties into /tmp/LTL2463449372437837462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16259219665572313090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2463449372437837462.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1625921...246
Read 1 LTL properties
Checking formula 0 : !((G((G(X(G(F("((i5.u10.pbl_1_3_3<1)||(i5.u74.pi_d1_n1_1_3_3<1))")))))&&(((F("(((i5.u10.pbl_1_3_3>=1)&&(i5.u74.pi_d1_n1_1_3_3>=1))&&((...281
Formula 0 simplified : !G(GXGF"((i5.u10.pbl_1_3_3<1)||(i5.u74.pi_d1_n1_1_3_3<1))" & ("(i17.u186.pol_d3_n1_3_3_1<1)" | "(i23.u24.pb_d3_n1_3_3_1<1)" | F"(((i...262
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12011030858054097284
[2022-05-16 22:01:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12011030858054097284
Running compilation step : cd /tmp/ltsmin12011030858054097284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1531 ms.
Running link step : cd /tmp/ltsmin12011030858054097284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12011030858054097284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-02 finished in 102035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:17] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:01:17] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:17] [INFO ] Computed 190 place invariants in 17 ms
[2022-05-16 22:01:18] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:18] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:01:18] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s179 1) (GEQ s377 1)), p0:(AND (GEQ s171 1) (GEQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-03 finished in 1387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0))) U (F(p2)&&p1)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:18] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:01:19] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:19] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:01:19] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:19] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:01:19] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s169 1) (GEQ s223 1)), p2:(AND (GEQ s169 1) (GEQ s223 1)), p0:(AND (GEQ s187 1) (GEQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-04 finished in 1354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F(G(F(p0))))))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 28 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:20] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:01:20] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:20] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:01:20] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2022-05-16 22:01:20] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:21] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:01:21] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s177 1) (LT s387 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 340 reset in 3310 ms.
Product exploration explored 100000 steps with 361 reset in 3437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 335 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=25 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:28] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:01:29] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:29] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:01:29] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2022-05-16 22:01:29] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:29] [INFO ] Computed 190 place invariants in 13 ms
[2022-05-16 22:01:29] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 120 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 312 reset in 3141 ms.
Product exploration explored 100000 steps with 337 reset in 3305 ms.
Built C files in :
/tmp/ltsmin3816930722926621807
[2022-05-16 22:01:37] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:01:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:37] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:01:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:37] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:01:37] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:37] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3816930722926621807
Running compilation step : cd /tmp/ltsmin3816930722926621807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2633 ms.
Running link step : cd /tmp/ltsmin3816930722926621807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3816930722926621807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased131725429530345668.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 20 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:52] [INFO ] Computed 190 place invariants in 12 ms
[2022-05-16 22:01:52] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:52] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:01:53] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2022-05-16 22:01:53] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:01:53] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:01:53] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin18424062011185630821
[2022-05-16 22:01:53] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:01:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:53] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:01:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:53] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:01:53] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:01:53] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18424062011185630821
Running compilation step : cd /tmp/ltsmin18424062011185630821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2640 ms.
Running link step : cd /tmp/ltsmin18424062011185630821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin18424062011185630821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7656392424471474969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:02:08] [INFO ] Flatten gal took : 36 ms
[2022-05-16 22:02:08] [INFO ] Flatten gal took : 34 ms
[2022-05-16 22:02:08] [INFO ] Time to serialize gal into /tmp/LTL2235851300468722586.gal : 6 ms
[2022-05-16 22:02:08] [INFO ] Time to serialize properties into /tmp/LTL14175040638220593180.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2235851300468722586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14175040638220593180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2235851...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F(G(F(G(F("((pbl_2_3_1<1)||(po_d2_n1_2_1_1<1))")))))))))
Formula 0 simplified : !GXFGFGF"((pbl_2_3_1<1)||(po_d2_n1_2_1_1<1))"
Detected timeout of ITS tools.
[2022-05-16 22:02:23] [INFO ] Flatten gal took : 35 ms
[2022-05-16 22:02:23] [INFO ] Applying decomposition
[2022-05-16 22:02:23] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5359915277257288689.txt' '-o' '/tmp/graph5359915277257288689.bin' '-w' '/tmp/graph5359915277257288689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5359915277257288689.bin' '-l' '-1' '-v' '-w' '/tmp/graph5359915277257288689.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:02:23] [INFO ] Decomposing Gal with order
[2022-05-16 22:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:02:23] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:02:23] [INFO ] Flatten gal took : 63 ms
[2022-05-16 22:02:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 22:02:24] [INFO ] Time to serialize gal into /tmp/LTL16403320420352289032.gal : 7 ms
[2022-05-16 22:02:24] [INFO ] Time to serialize properties into /tmp/LTL8578626172817115619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16403320420352289032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8578626172817115619.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1640332...246
Read 1 LTL properties
Checking formula 0 : !((G(X(F(G(F(G(F("((i21.u16.pbl_2_3_1<1)||(i21.u129.po_d2_n1_2_1_1<1))")))))))))
Formula 0 simplified : !GXFGFGF"((i21.u16.pbl_2_3_1<1)||(i21.u129.po_d2_n1_2_1_1<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5622578033691802265
[2022-05-16 22:02:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5622578033691802265
Running compilation step : cd /tmp/ltsmin5622578033691802265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1536 ms.
Running link step : cd /tmp/ltsmin5622578033691802265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5622578033691802265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>([](<>([](<>((LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-05 finished in 94021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 26 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:02:54] [INFO ] Computed 190 place invariants in 11 ms
[2022-05-16 22:02:54] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:02:54] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:02:55] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2022-05-16 22:02:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:02:55] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:02:55] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s178 1) (LT s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 2605 ms.
Product exploration explored 100000 steps with 1 reset in 2896 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 164 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=13 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:01] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:03:01] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:01] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:03:02] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2022-05-16 22:03:02] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:02] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:03:02] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=10 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 2583 ms.
Product exploration explored 100000 steps with 3 reset in 2726 ms.
Built C files in :
/tmp/ltsmin16385507996355429600
[2022-05-16 22:03:08] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:03:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:08] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:03:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:08] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:03:08] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:08] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16385507996355429600
Running compilation step : cd /tmp/ltsmin16385507996355429600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2827 ms.
Running link step : cd /tmp/ltsmin16385507996355429600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin16385507996355429600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10596302822181738970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:23] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:03:24] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:24] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:03:24] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2022-05-16 22:03:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:03:24] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:03:25] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin4181324305518037431
[2022-05-16 22:03:25] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:03:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:25] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:03:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:25] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:03:25] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:03:25] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4181324305518037431
Running compilation step : cd /tmp/ltsmin4181324305518037431;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2642 ms.
Running link step : cd /tmp/ltsmin4181324305518037431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4181324305518037431;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased681478653922805469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:03:40] [INFO ] Flatten gal took : 37 ms
[2022-05-16 22:03:40] [INFO ] Flatten gal took : 30 ms
[2022-05-16 22:03:40] [INFO ] Time to serialize gal into /tmp/LTL15902408216549258790.gal : 5 ms
[2022-05-16 22:03:40] [INFO ] Time to serialize properties into /tmp/LTL2930975670559396184.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15902408216549258790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2930975670559396184.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1590240...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((pbl_2_3_2<1)||(po_d3_n1_2_3_3<1))"))))
Formula 0 simplified : !FG"((pbl_2_3_2<1)||(po_d3_n1_2_3_3<1))"
Detected timeout of ITS tools.
[2022-05-16 22:03:55] [INFO ] Flatten gal took : 30 ms
[2022-05-16 22:03:55] [INFO ] Applying decomposition
[2022-05-16 22:03:55] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9448701001609155651.txt' '-o' '/tmp/graph9448701001609155651.bin' '-w' '/tmp/graph9448701001609155651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9448701001609155651.bin' '-l' '-1' '-v' '-w' '/tmp/graph9448701001609155651.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:03:55] [INFO ] Decomposing Gal with order
[2022-05-16 22:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:03:55] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:03:55] [INFO ] Flatten gal took : 60 ms
[2022-05-16 22:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 22:03:55] [INFO ] Time to serialize gal into /tmp/LTL1685595619758061613.gal : 7 ms
[2022-05-16 22:03:55] [INFO ] Time to serialize properties into /tmp/LTL10194847614897931376.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1685595619758061613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10194847614897931376.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1685595...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i19.u17.pbl_2_3_2<1)||(i19.u184.po_d3_n1_2_3_3<1))"))))
Formula 0 simplified : !FG"((i19.u17.pbl_2_3_2<1)||(i19.u184.po_d3_n1_2_3_3<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin98865924455708050
[2022-05-16 22:04:10] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin98865924455708050
Running compilation step : cd /tmp/ltsmin98865924455708050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1539 ms.
Running link step : cd /tmp/ltsmin98865924455708050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin98865924455708050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 2757 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-06 finished in 80856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(((p1 U p2)||p3))&&p0)))||G(p4)))'
Support contains 7 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:15] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:04:15] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:15] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:04:15] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:15] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:04:16] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p4)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p4) p0), acceptance={} source=2 dest: 1}, { cond=(AND p4 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p4 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND p4 (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p4 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 8}], [{ cond=p4, acceptance={} source=6 dest: 2}, { cond=(NOT p4), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p4, acceptance={} source=9 dest: 6}, { cond=(NOT p4), acceptance={} source=9 dest: 7}], [{ cond=(NOT p4), acceptance={} source=10 dest: 8}, { cond=p4, acceptance={} source=10 dest: 10}]], initial=9, aps=[p2:(AND (GEQ s177 1) (GEQ s258 1)), p1:(AND (GEQ s177 1) (GEQ s204 1)), p3:(AND (GEQ s179 1) (GEQ s420 1)), p4:(AND (GEQ s168 1) (GEQ s222 1)), p0:(AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-07 finished in 1711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X((F(!p1)||p2)) U p3))))'
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:16] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:04:17] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:17] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:04:17] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:17] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:04:17] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND p1 (NOT p2))), p1]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s173 1) (GEQ s371 1) (GEQ s78 1) (GEQ s483 1)), p0:(OR (AND (GEQ s169 1) (GEQ s250 1)) (AND (GEQ s153 1) (GEQ s343 1))), p2:(AND (GEQ s69 1) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 374 reset in 3232 ms.
Product exploration explored 100000 steps with 348 reset in 3387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p2 p1)]
False Knowledge obtained : [(X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 1 factoid took 277 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 4 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND p1 (NOT p2))), p1]
Finished random walk after 822 steps, including 0 resets, run visited all 5 properties in 48 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p3) p0 p2 p1)]
False Knowledge obtained : [(X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 1 factoid took 362 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 4 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND p1 (NOT p2))), p1]
Stuttering acceptance computed with spot in 143 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND p1 (NOT p2))), p1]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:26] [INFO ] Computed 190 place invariants in 5 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) p0 p2 p1)]
False Knowledge obtained : [(X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (AND (NOT p0) (NOT p3))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 1 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-08 finished in 9947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U ((X(p0) U X(p3))&&p2)))'
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:26] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:04:26] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:26] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:04:27] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:27] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:04:27] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s181 1) (GEQ s208 1) (NOT (AND (GEQ s71 1) (GEQ s476 1)))), p1:(AND (GEQ s177 1) (GEQ s421 1)), p0:(AND (GEQ s172 1) (GEQ s226 1)), p3:(AND (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 401 reset in 3209 ms.
Product exploration explored 100000 steps with 422 reset in 3354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p1)), (X p1), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 1082 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Finished random walk after 6375 steps, including 1 resets, run visited all 14 properties in 241 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p1)), (X p1), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p1 (NOT p0) (NOT p3))), (F p1), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3)))]
Knowledge based reduction with 9 factoid took 1727 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:38] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:04:39] [INFO ] [Real]Absence check using 189 positive place invariants in 196 ms returned sat
[2022-05-16 22:04:39] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:04:39] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2022-05-16 22:04:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:04:40] [INFO ] [Nat]Absence check using 189 positive place invariants in 90 ms returned sat
[2022-05-16 22:04:40] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:04:40] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-05-16 22:04:40] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-16 22:04:42] [INFO ] Added : 157 causal constraints over 32 iterations in 1498 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:42] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:04:42] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:42] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:04:42] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:42] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
Knowledge based reduction with 9 factoid took 1278 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Finished random walk after 5660 steps, including 1 resets, run visited all 14 properties in 233 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (F (AND p1 (NOT p0) (NOT p3))), (F p1), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (OR (AND p2 (NOT p3)) (AND p0 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3)))]
Knowledge based reduction with 9 factoid took 1555 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:47] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:04:47] [INFO ] [Real]Absence check using 189 positive place invariants in 196 ms returned sat
[2022-05-16 22:04:47] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:04:48] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2022-05-16 22:04:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:04:48] [INFO ] [Nat]Absence check using 189 positive place invariants in 93 ms returned sat
[2022-05-16 22:04:48] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:04:49] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2022-05-16 22:04:49] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-16 22:04:50] [INFO ] Added : 157 causal constraints over 32 iterations in 1512 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 398 reset in 3229 ms.
Product exploration explored 100000 steps with 421 reset in 3372 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p3)]
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 47 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2022-05-16 22:04:58] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:04:58] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:04:58] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Product exploration explored 100000 steps with 404 reset in 3335 ms.
Product exploration explored 100000 steps with 424 reset in 3474 ms.
Built C files in :
/tmp/ltsmin7394151409785537958
[2022-05-16 22:05:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7394151409785537958
Running compilation step : cd /tmp/ltsmin7394151409785537958;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1624 ms.
Running link step : cd /tmp/ltsmin7394151409785537958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7394151409785537958;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased275513985603373734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:05:20] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:05:20] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:05:20] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:05:21] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:05:21] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:05:21] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin6664956043136099707
[2022-05-16 22:05:21] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6664956043136099707
Running compilation step : cd /tmp/ltsmin6664956043136099707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1650 ms.
Running link step : cd /tmp/ltsmin6664956043136099707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6664956043136099707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11199011870786899538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:05:36] [INFO ] Flatten gal took : 30 ms
[2022-05-16 22:05:36] [INFO ] Flatten gal took : 34 ms
[2022-05-16 22:05:36] [INFO ] Time to serialize gal into /tmp/LTL3071699395858615107.gal : 7 ms
[2022-05-16 22:05:36] [INFO ] Time to serialize properties into /tmp/LTL10250431318079433934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3071699395858615107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10250431318079433934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3071699...267
Read 1 LTL properties
Checking formula 0 : !((((F("((pbl_2_1_2>=1)&&(pi_d2_n1_2_1_2>=1))"))U("((pbl_2_3_1>=1)&&(po_d3_n1_2_3_2>=1))"))U((((X("((pbl_2_1_2>=1)&&(pi_d2_n1_2_1_2>=1...311
Formula 0 simplified : !((F"((pbl_2_1_2>=1)&&(pi_d2_n1_2_1_2>=1))" U "((pbl_2_3_1>=1)&&(po_d3_n1_2_3_2>=1))") U ("((pi_d1_n1_3_1_2>=1)&&(!((pb_d2_n1_2_3_3>...299
Detected timeout of ITS tools.
[2022-05-16 22:05:51] [INFO ] Flatten gal took : 29 ms
[2022-05-16 22:05:51] [INFO ] Applying decomposition
[2022-05-16 22:05:51] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5646956279480328762.txt' '-o' '/tmp/graph5646956279480328762.bin' '-w' '/tmp/graph5646956279480328762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5646956279480328762.bin' '-l' '-1' '-v' '-w' '/tmp/graph5646956279480328762.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:05:52] [INFO ] Decomposing Gal with order
[2022-05-16 22:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:05:52] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:05:52] [INFO ] Flatten gal took : 64 ms
[2022-05-16 22:05:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 22:05:52] [INFO ] Time to serialize gal into /tmp/LTL4484440878261938102.gal : 5 ms
[2022-05-16 22:05:52] [INFO ] Time to serialize properties into /tmp/LTL8286475425329044691.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4484440878261938102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8286475425329044691.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4484440...245
Read 1 LTL properties
Checking formula 0 : !((((F("((i9.u13.pbl_2_1_2>=1)&&(i9.u88.pi_d2_n1_2_1_2>=1))"))U("((i19.u18.pbl_2_3_1>=1)&&(i19.u149.po_d3_n1_2_3_2>=1))"))U((((X("((i9...405
Formula 0 simplified : !((F"((i9.u13.pbl_2_1_2>=1)&&(i9.u88.pi_d2_n1_2_1_2>=1))" U "((i19.u18.pbl_2_3_1>=1)&&(i19.u149.po_d3_n1_2_3_2>=1))") U ("((i14.u37....393
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10462781790817687101
[2022-05-16 22:06:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10462781790817687101
Running compilation step : cd /tmp/ltsmin10462781790817687101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1527 ms.
Running link step : cd /tmp/ltsmin10462781790817687101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10462781790817687101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true)) U ((X((LTLAPp0==true)) U X((LTLAPp3==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-09 finished in 115627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(((X(p1)||F(p2))&&p0)))))'
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:22] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:06:22] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:22] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:06:23] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2022-05-16 22:06:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:23] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s162 1) (GEQ s360 1)), p2:(AND (GEQ s121 1) (GEQ s499 1)), p1:(AND (OR (LT s127 1) (LT s505 1)) (GEQ s175 1) (GEQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 93 reset in 3086 ms.
Product exploration explored 100000 steps with 119 reset in 3276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 307 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 1487 steps, including 0 resets, run visited all 5 properties in 68 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 480 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:31] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:06:31] [INFO ] [Real]Absence check using 189 positive place invariants in 86 ms returned sat
[2022-05-16 22:06:31] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 66 ms returned sat
[2022-05-16 22:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:06:32] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2022-05-16 22:06:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:06:32] [INFO ] [Nat]Absence check using 189 positive place invariants in 105 ms returned sat
[2022-05-16 22:06:32] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:06:33] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2022-05-16 22:06:33] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-16 22:06:35] [INFO ] Added : 161 causal constraints over 33 iterations in 1596 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:35] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:06:35] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:35] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:06:35] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2022-05-16 22:06:35] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:35] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:06:36] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 374 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 1103 steps, including 0 resets, run visited all 5 properties in 50 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 458 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:06:37] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:06:38] [INFO ] [Real]Absence check using 189 positive place invariants in 88 ms returned sat
[2022-05-16 22:06:38] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 69 ms returned sat
[2022-05-16 22:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:06:38] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2022-05-16 22:06:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:06:39] [INFO ] [Nat]Absence check using 189 positive place invariants in 171 ms returned sat
[2022-05-16 22:06:39] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 22:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:06:40] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2022-05-16 22:06:40] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 96 ms.
[2022-05-16 22:06:42] [INFO ] Added : 161 causal constraints over 33 iterations in 1698 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 92 reset in 3060 ms.
Product exploration explored 100000 steps with 98 reset in 3203 ms.
Built C files in :
/tmp/ltsmin11486535165862502276
[2022-05-16 22:06:48] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:06:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:06:48] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:06:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:06:48] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:06:48] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:06:48] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11486535165862502276
Running compilation step : cd /tmp/ltsmin11486535165862502276;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2623 ms.
Running link step : cd /tmp/ltsmin11486535165862502276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11486535165862502276;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8567076018143685951.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:03] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:07:04] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:04] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:07:04] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2022-05-16 22:07:04] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:04] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 22:07:05] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin10689751869463085471
[2022-05-16 22:07:05] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:07:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:07:05] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:07:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:07:05] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:07:05] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:07:05] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10689751869463085471
Running compilation step : cd /tmp/ltsmin10689751869463085471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2618 ms.
Running link step : cd /tmp/ltsmin10689751869463085471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin10689751869463085471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18122938851025279870.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:07:20] [INFO ] Flatten gal took : 28 ms
[2022-05-16 22:07:20] [INFO ] Flatten gal took : 28 ms
[2022-05-16 22:07:20] [INFO ] Time to serialize gal into /tmp/LTL12026613028856573850.gal : 6 ms
[2022-05-16 22:07:20] [INFO ] Time to serialize properties into /tmp/LTL4134591433552247564.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12026613028856573850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4134591433552247564.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1202661...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G(("((pbl_1_1_1>=1)&&(po_d1_n1_2_1_1>=1))")&&((X("((((pb_d3_n1_3_1_2<1)||(pol_d3_n1_3_1_2<1))&&(pbl_2_2_2>=1))&&(pi_d2_n1_2_2_2...221
Formula 0 simplified : !FXG("((pbl_1_1_1>=1)&&(po_d1_n1_2_1_1>=1))" & (X"((((pb_d3_n1_3_1_2<1)||(pol_d3_n1_3_1_2<1))&&(pbl_2_2_2>=1))&&(pi_d2_n1_2_2_2>=1))...207
Detected timeout of ITS tools.
[2022-05-16 22:07:35] [INFO ] Flatten gal took : 30 ms
[2022-05-16 22:07:35] [INFO ] Applying decomposition
[2022-05-16 22:07:35] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12211655829411366725.txt' '-o' '/tmp/graph12211655829411366725.bin' '-w' '/tmp/graph12211655829411366725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12211655829411366725.bin' '-l' '-1' '-v' '-w' '/tmp/graph12211655829411366725.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:07:35] [INFO ] Decomposing Gal with order
[2022-05-16 22:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:07:35] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:07:35] [INFO ] Flatten gal took : 48 ms
[2022-05-16 22:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 22:07:35] [INFO ] Time to serialize gal into /tmp/LTL15502498768517279530.gal : 5 ms
[2022-05-16 22:07:35] [INFO ] Time to serialize properties into /tmp/LTL11462574924548051781.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15502498768517279530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11462574924548051781.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1550249...247
Read 1 LTL properties
Checking formula 0 : !((F(X(G(("((i2.u3.pbl_1_1_1>=1)&&(i2.u115.po_d1_n1_2_1_1>=1))")&&((X("((((i18.u19.pb_d3_n1_3_1_2<1)||(i11.u185.pol_d3_n1_3_1_2<1))&&(...281
Formula 0 simplified : !FXG("((i2.u3.pbl_1_1_1>=1)&&(i2.u115.po_d1_n1_2_1_1>=1))" & (X"((((i18.u19.pb_d3_n1_3_1_2<1)||(i11.u185.pol_d3_n1_3_1_2<1))&&(i8.u1...267
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3914288129029712113
[2022-05-16 22:07:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3914288129029712113
Running compilation step : cd /tmp/ltsmin3914288129029712113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1520 ms.
Running link step : cd /tmp/ltsmin3914288129029712113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3914288129029712113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](((X((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 1538 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-10 finished in 91429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:53] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 22:07:54] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:54] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:07:54] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2022-05-16 22:07:54] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:07:54] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:07:54] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s166 1) (LT s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 2406 ms.
Product exploration explored 100000 steps with 2 reset in 2747 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:00] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:08:00] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:00] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:08:01] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2022-05-16 22:08:01] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:01] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 279 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=13 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 2540 ms.
Product exploration explored 100000 steps with 1 reset in 2713 ms.
Built C files in :
/tmp/ltsmin12272628781114616572
[2022-05-16 22:08:07] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:08:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:07] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:08:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:07] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:08:07] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:07] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12272628781114616572
Running compilation step : cd /tmp/ltsmin12272628781114616572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2649 ms.
Running link step : cd /tmp/ltsmin12272628781114616572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12272628781114616572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10332224118170705088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:22] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:08:23] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:23] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 22:08:23] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2022-05-16 22:08:23] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:08:23] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:08:24] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin15887240151012606429
[2022-05-16 22:08:24] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:08:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:24] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:08:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:24] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 22:08:24] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:08:24] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15887240151012606429
Running compilation step : cd /tmp/ltsmin15887240151012606429;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2635 ms.
Running link step : cd /tmp/ltsmin15887240151012606429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15887240151012606429;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16974005745783730103.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:08:39] [INFO ] Flatten gal took : 27 ms
[2022-05-16 22:08:39] [INFO ] Flatten gal took : 27 ms
[2022-05-16 22:08:39] [INFO ] Time to serialize gal into /tmp/LTL2779932203649143798.gal : 3 ms
[2022-05-16 22:08:39] [INFO ] Time to serialize properties into /tmp/LTL17176879980679139178.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2779932203649143798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17176879980679139178.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2779932...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G("((pbl_1_2_2<1)||(po_d3_n1_1_2_3<1))")))))
Formula 0 simplified : !FXG"((pbl_1_2_2<1)||(po_d3_n1_1_2_3<1))"
Detected timeout of ITS tools.
[2022-05-16 22:08:54] [INFO ] Flatten gal took : 32 ms
[2022-05-16 22:08:54] [INFO ] Applying decomposition
[2022-05-16 22:08:54] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7584228885566479672.txt' '-o' '/tmp/graph7584228885566479672.bin' '-w' '/tmp/graph7584228885566479672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7584228885566479672.bin' '-l' '-1' '-v' '-w' '/tmp/graph7584228885566479672.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:08:54] [INFO ] Decomposing Gal with order
[2022-05-16 22:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:08:54] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:08:54] [INFO ] Flatten gal took : 53 ms
[2022-05-16 22:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 22:08:54] [INFO ] Time to serialize gal into /tmp/LTL12327727789066055744.gal : 5 ms
[2022-05-16 22:08:54] [INFO ] Time to serialize properties into /tmp/LTL17708063693014713546.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12327727789066055744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17708063693014713546.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1232772...247
Read 1 LTL properties
Checking formula 0 : !((F(X(G("((i4.u6.pbl_1_2_2<1)||(i4.u180.po_d3_n1_1_2_3<1))")))))
Formula 0 simplified : !FXG"((i4.u6.pbl_1_2_2<1)||(i4.u180.po_d3_n1_1_2_3<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12109089975271926626
[2022-05-16 22:09:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12109089975271926626
Running compilation step : cd /tmp/ltsmin12109089975271926626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1530 ms.
Running link step : cd /tmp/ltsmin12109089975271926626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12109089975271926626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 2864 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-11 finished in 80428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X((F(p0)&&p1)))&&F(p2))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:14] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:09:14] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:14] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:09:15] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2022-05-16 22:09:15] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:15] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:09:15] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s185 1) (GEQ s239 1)), p1:(OR (LT s185 1) (LT s239 1) (LT s178 1) (LT s259 1)), p0:(AND (GEQ s178 1) (GEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 424 reset in 3146 ms.
Product exploration explored 100000 steps with 428 reset in 3328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 351 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:23] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 22:09:23] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 422 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:23] [INFO ] Computed 190 place invariants in 11 ms
[2022-05-16 22:09:24] [INFO ] [Real]Absence check using 189 positive place invariants in 83 ms returned sat
[2022-05-16 22:09:24] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 111 ms returned sat
[2022-05-16 22:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:24] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-05-16 22:09:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:09:25] [INFO ] [Nat]Absence check using 189 positive place invariants in 86 ms returned sat
[2022-05-16 22:09:25] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 26 ms returned sat
[2022-05-16 22:09:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:25] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2022-05-16 22:09:26] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-16 22:09:27] [INFO ] Added : 157 causal constraints over 32 iterations in 1608 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:27] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:09:28] [INFO ] [Real]Absence check using 189 positive place invariants in 85 ms returned sat
[2022-05-16 22:09:28] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 77 ms returned sat
[2022-05-16 22:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:28] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2022-05-16 22:09:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:09:29] [INFO ] [Nat]Absence check using 189 positive place invariants in 82 ms returned sat
[2022-05-16 22:09:29] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 46 ms returned sat
[2022-05-16 22:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:29] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-05-16 22:09:29] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-16 22:09:31] [INFO ] Added : 150 causal constraints over 30 iterations in 1513 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:31] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 22:09:31] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:31] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:09:32] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:32] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:09:32] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3723 steps, including 1 resets, run visited all 4 properties in 115 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p0), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 355 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:33] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:09:34] [INFO ] [Real]Absence check using 189 positive place invariants in 82 ms returned sat
[2022-05-16 22:09:34] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 114 ms returned sat
[2022-05-16 22:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:34] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2022-05-16 22:09:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:09:35] [INFO ] [Nat]Absence check using 189 positive place invariants in 85 ms returned sat
[2022-05-16 22:09:35] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 30 ms returned sat
[2022-05-16 22:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:35] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2022-05-16 22:09:36] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 68 ms.
[2022-05-16 22:09:37] [INFO ] Added : 157 causal constraints over 32 iterations in 1624 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:37] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:09:37] [INFO ] [Real]Absence check using 189 positive place invariants in 85 ms returned sat
[2022-05-16 22:09:38] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 70 ms returned sat
[2022-05-16 22:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:38] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2022-05-16 22:09:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:09:39] [INFO ] [Nat]Absence check using 189 positive place invariants in 86 ms returned sat
[2022-05-16 22:09:39] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 44 ms returned sat
[2022-05-16 22:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:09:39] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-05-16 22:09:39] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-16 22:09:41] [INFO ] Added : 150 causal constraints over 30 iterations in 1399 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 433 reset in 3236 ms.
Product exploration explored 100000 steps with 346 reset in 3378 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2022-05-16 22:09:48] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:48] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 22:09:48] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Product exploration explored 100000 steps with 415 reset in 3308 ms.
Product exploration explored 100000 steps with 408 reset in 3469 ms.
Built C files in :
/tmp/ltsmin8317283482786675510
[2022-05-16 22:09:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8317283482786675510
Running compilation step : cd /tmp/ltsmin8317283482786675510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1797 ms.
Running link step : cd /tmp/ltsmin8317283482786675510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8317283482786675510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11640800216335604969.hoa' '--buchi-type=spotba'
LTSmin run took 1943 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-12 finished in 44872 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:59] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 22:09:59] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:59] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:09:59] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 22:09:59] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 22:10:00] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s187 1) (GEQ s241 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLFireability-14 finished in 1351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(G(F(p0))))&&(F(p2)||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F(G(F(p0))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U ((X(p0) U X(p3))&&p2)))'
[2022-05-16 22:10:00] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15446482681618916723
[2022-05-16 22:10:00] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 22:10:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:10:00] [INFO ] Applying decomposition
[2022-05-16 22:10:00] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 22:10:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:10:00] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10464026988159802502.txt' '-o' '/tmp/graph10464026988159802502.bin' '-w' '/tmp/graph10464026988159802502.weights'
[2022-05-16 22:10:00] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10464026988159802502.bin' '-l' '-1' '-v' '-w' '/tmp/graph10464026988159802502.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:10:00] [INFO ] Decomposing Gal with order
[2022-05-16 22:10:00] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:10:00] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15446482681618916723
Running compilation step : cd /tmp/ltsmin15446482681618916723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 22:10:00] [INFO ] Removed a total of 1296 redundant transitions.
[2022-05-16 22:10:00] [INFO ] Flatten gal took : 47 ms
[2022-05-16 22:10:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 22:10:00] [INFO ] Time to serialize gal into /tmp/LTLFireability4047844092484844946.gal : 5 ms
[2022-05-16 22:10:00] [INFO ] Time to serialize properties into /tmp/LTLFireability14595300340763210790.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4047844092484844946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14595300340763210790.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((G((G(X(G(F("((i1.u1.pbl_1_3_3<1)||(i1.u72.pi_d1_n1_1_3_3<1))")))))&&(((F("(((i1.u1.pbl_1_3_3>=1)&&(i1.u72.pi_d1_n1_1_3_3>=1))&&((i4...277
Formula 0 simplified : !G(GXGF"((i1.u1.pbl_1_3_3<1)||(i1.u72.pi_d1_n1_1_3_3<1))" & ("(i19.u24.pb_d3_n1_3_3_1<1)" | "(i21.u186.pol_d3_n1_3_3_1<1)" | F"(((i1...258
Compilation finished in 3155 ms.
Running link step : cd /tmp/ltsmin15446482681618916723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15446482681618916723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.223: LTL layer: formula: [](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.223: "[](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.223: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.238: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.268: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.275: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.275: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.303: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.385: DFS-FIFO for weak LTL, using special progress label 981
pins2lts-mc-linux64( 0/ 8), 0.385: There are 982 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.385: State length is 514, there are 977 groups
pins2lts-mc-linux64( 0/ 8), 0.385: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.385: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.385: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.385: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.862: ~120 levels ~960 states ~211960 transitions
pins2lts-mc-linux64( 4/ 8), 2.845: ~239 levels ~1920 states ~456112 transitions
pins2lts-mc-linux64( 4/ 8), 4.177: ~479 levels ~3840 states ~893920 transitions
pins2lts-mc-linux64( 3/ 8), 6.126: ~960 levels ~7680 states ~1706520 transitions
pins2lts-mc-linux64( 1/ 8), 9.744: ~1918 levels ~15360 states ~3274904 transitions
pins2lts-mc-linux64( 4/ 8), 17.127: ~3835 levels ~30720 states ~5957112 transitions
pins2lts-mc-linux64( 2/ 8), 22.023: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 27.587:
pins2lts-mc-linux64( 0/ 8), 27.587: mean standard work distribution: 2.0% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 27.587:
pins2lts-mc-linux64( 0/ 8), 27.587: Explored 33346 states 6707743 transitions, fanout: 201.156
pins2lts-mc-linux64( 0/ 8), 27.587: Total exploration time 27.160 sec (21.740 sec minimum, 24.296 sec on average)
pins2lts-mc-linux64( 0/ 8), 27.587: States per second: 1228, Transitions per second: 246971
pins2lts-mc-linux64( 0/ 8), 27.587:
pins2lts-mc-linux64( 0/ 8), 27.587: Progress states detected: 17
pins2lts-mc-linux64( 0/ 8), 27.587: Redundant explorations: -99.5027
pins2lts-mc-linux64( 0/ 8), 27.587:
pins2lts-mc-linux64( 0/ 8), 27.587: Queue width: 8B, total height: 33479, memory: 0.26MB
pins2lts-mc-linux64( 0/ 8), 27.587: Tree memory: 307.2MB, 48.0 B/state, compr.: 2.3%
pins2lts-mc-linux64( 0/ 8), 27.587: Tree fill ratio (roots/leafs): 4.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 27.587: Stored 981 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 27.587: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 27.587: Est. total memory use: 307.4MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15446482681618916723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15446482681618916723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X([](<>((LTLAPp0==true)))))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 22:33:34] [INFO ] Flatten gal took : 193 ms
[2022-05-16 22:33:34] [INFO ] Time to serialize gal into /tmp/LTLFireability8964400335788187522.gal : 35 ms
[2022-05-16 22:33:35] [INFO ] Time to serialize properties into /tmp/LTLFireability15945616609738038421.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8964400335788187522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15945616609738038421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 3 LTL properties
Checking formula 0 : !((G((G(X(G(F("((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))")))))&&(((F("(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=1))&&((pbl_1_1_1>=1)&&(po_d3_n1_1_1...220
Formula 0 simplified : !G(GXGF"((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))" & ("(pb_d3_n1_3_3_1<1)" | "(pol_d3_n1_3_3_1<1)" | F"(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=...201
Detected timeout of ITS tools.
[2022-05-16 22:57:08] [INFO ] Flatten gal took : 226 ms
[2022-05-16 22:57:09] [INFO ] Input system was already deterministic with 972 transitions.
[2022-05-16 22:57:09] [INFO ] Transformed 513 places.
[2022-05-16 22:57:09] [INFO ] Transformed 972 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 22:57:10] [INFO ] Time to serialize gal into /tmp/LTLFireability15085099446823375675.gal : 6 ms
[2022-05-16 22:57:10] [INFO ] Time to serialize properties into /tmp/LTLFireability12647914100265003386.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15085099446823375675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12647914100265003386.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G(X(G(F("((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))")))))&&(((F("(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=1))&&((pbl_1_1_1>=1)&&(po_d3_n1_1_1...220
Formula 0 simplified : !G(GXGF"((pbl_1_3_3<1)||(pi_d1_n1_1_3_3<1))" & ("(pb_d3_n1_3_3_1<1)" | "(pol_d3_n1_3_3_1<1)" | F"(((pbl_1_3_3>=1)&&(pi_d1_n1_1_3_3>=...201
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d3k3p2b06"
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 HypertorusGrid-PT-d3k3p2b06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820300052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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 ;