About the Execution of ITS-Tools for ShieldPPPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.220 | 3600000.00 | 12095662.00 | 134383.80 | ?FFFFFF?FTFFF?TF | 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.r222-tall-165286025300508.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 ShieldPPPs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300508
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.2K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 888K 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 ShieldPPPs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653007402552
Running Version 202205111006
[2022-05-20 00:43:23] [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-20 00:43:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 00:43:24] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-05-20 00:43:24] [INFO ] Transformed 3403 places.
[2022-05-20 00:43:24] [INFO ] Transformed 3153 transitions.
[2022-05-20 00:43:24] [INFO ] Found NUPN structural information;
[2022-05-20 00:43:24] [INFO ] Parsed PT model containing 3403 places and 3153 transitions in 475 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-050B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 340 places :
Symmetric choice reduction at 0 with 340 rule applications. Total rules 340 place count 3063 transition count 2813
Iterating global reduction 0 with 340 rules applied. Total rules applied 680 place count 3063 transition count 2813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 681 place count 3062 transition count 2812
Iterating global reduction 0 with 1 rules applied. Total rules applied 682 place count 3062 transition count 2812
Applied a total of 682 rules in 1141 ms. Remains 3062 /3403 variables (removed 341) and now considering 2812/3153 (removed 341) transitions.
// Phase 1: matrix 2812 rows 3062 cols
[2022-05-20 00:43:25] [INFO ] Computed 551 place invariants in 43 ms
[2022-05-20 00:43:26] [INFO ] Implicit Places using invariants in 1057 ms returned []
// Phase 1: matrix 2812 rows 3062 cols
[2022-05-20 00:43:26] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:43:30] [INFO ] Implicit Places using invariants and state equation in 3760 ms returned []
Implicit Place search using SMT with State Equation took 4846 ms to find 0 implicit places.
// Phase 1: matrix 2812 rows 3062 cols
[2022-05-20 00:43:30] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3062/3403 places, 2812/3153 transitions.
Finished structural reductions, in 1 iterations. Remains : 3062/3403 places, 2812/3153 transitions.
Support contains 53 out of 3062 places after structural reductions.
[2022-05-20 00:43:32] [INFO ] Flatten gal took : 206 ms
[2022-05-20 00:43:32] [INFO ] Flatten gal took : 136 ms
[2022-05-20 00:43:32] [INFO ] Input system was already deterministic with 2812 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 44) seen :21
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 2812 rows 3062 cols
[2022-05-20 00:43:33] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:43:35] [INFO ] [Real]Absence check using 551 positive place invariants in 195 ms returned sat
[2022-05-20 00:43:35] [INFO ] After 1971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 00:43:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 197 ms returned sat
[2022-05-20 00:43:41] [INFO ] After 3642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 00:43:42] [INFO ] Deduced a trap composed of 27 places in 827 ms of which 14 ms to minimize.
[2022-05-20 00:43:43] [INFO ] Deduced a trap composed of 22 places in 837 ms of which 2 ms to minimize.
[2022-05-20 00:43:44] [INFO ] Deduced a trap composed of 16 places in 796 ms of which 4 ms to minimize.
[2022-05-20 00:43:45] [INFO ] Deduced a trap composed of 20 places in 787 ms of which 3 ms to minimize.
[2022-05-20 00:43:46] [INFO ] Deduced a trap composed of 22 places in 851 ms of which 2 ms to minimize.
[2022-05-20 00:43:47] [INFO ] Deduced a trap composed of 23 places in 807 ms of which 4 ms to minimize.
[2022-05-20 00:43:48] [INFO ] Deduced a trap composed of 21 places in 739 ms of which 2 ms to minimize.
[2022-05-20 00:43:49] [INFO ] Deduced a trap composed of 23 places in 742 ms of which 2 ms to minimize.
[2022-05-20 00:43:49] [INFO ] Deduced a trap composed of 19 places in 752 ms of which 1 ms to minimize.
[2022-05-20 00:43:50] [INFO ] Deduced a trap composed of 26 places in 791 ms of which 2 ms to minimize.
[2022-05-20 00:43:51] [INFO ] Deduced a trap composed of 29 places in 771 ms of which 2 ms to minimize.
[2022-05-20 00:43:52] [INFO ] Deduced a trap composed of 22 places in 759 ms of which 2 ms to minimize.
[2022-05-20 00:43:53] [INFO ] Deduced a trap composed of 19 places in 748 ms of which 2 ms to minimize.
[2022-05-20 00:43:54] [INFO ] Deduced a trap composed of 12 places in 758 ms of which 1 ms to minimize.
[2022-05-20 00:43:55] [INFO ] Deduced a trap composed of 19 places in 706 ms of which 1 ms to minimize.
[2022-05-20 00:43:55] [INFO ] Deduced a trap composed of 23 places in 740 ms of which 2 ms to minimize.
[2022-05-20 00:43:56] [INFO ] Deduced a trap composed of 20 places in 752 ms of which 2 ms to minimize.
[2022-05-20 00:43:57] [INFO ] Deduced a trap composed of 23 places in 743 ms of which 1 ms to minimize.
[2022-05-20 00:43:58] [INFO ] Deduced a trap composed of 21 places in 724 ms of which 2 ms to minimize.
[2022-05-20 00:43:59] [INFO ] Deduced a trap composed of 31 places in 692 ms of which 2 ms to minimize.
[2022-05-20 00:44:00] [INFO ] Deduced a trap composed of 26 places in 683 ms of which 1 ms to minimize.
[2022-05-20 00:44:00] [INFO ] Deduced a trap composed of 32 places in 679 ms of which 1 ms to minimize.
[2022-05-20 00:44:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:44:00] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2313 ms.
Support contains 31 out of 3062 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 3062 transition count 2466
Reduce places removed 346 places and 0 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 692 place count 2716 transition count 2466
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 692 place count 2716 transition count 2219
Deduced a syphon composed of 247 places in 5 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 1186 place count 2469 transition count 2219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1192 place count 2463 transition count 2213
Iterating global reduction 2 with 6 rules applied. Total rules applied 1198 place count 2463 transition count 2213
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1198 place count 2463 transition count 2209
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1206 place count 2459 transition count 2209
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 2 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 2 with 1766 rules applied. Total rules applied 2972 place count 1576 transition count 1326
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 435 times.
Drop transitions removed 435 transitions
Iterating global reduction 2 with 435 rules applied. Total rules applied 3407 place count 1576 transition count 1326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3408 place count 1575 transition count 1325
Applied a total of 3408 rules in 1252 ms. Remains 1575 /3062 variables (removed 1487) and now considering 1325/2812 (removed 1487) transitions.
Finished structural reductions, in 1 iterations. Remains : 1575/3062 places, 1325/2812 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1325 rows 1575 cols
[2022-05-20 00:44:05] [INFO ] Computed 551 place invariants in 75 ms
[2022-05-20 00:44:05] [INFO ] [Real]Absence check using 522 positive place invariants in 87 ms returned sat
[2022-05-20 00:44:05] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-20 00:44:06] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 00:44:06] [INFO ] [Nat]Absence check using 522 positive place invariants in 88 ms returned sat
[2022-05-20 00:44:06] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-20 00:44:07] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 00:44:07] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2022-05-20 00:44:08] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2022-05-20 00:44:09] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-05-20 00:44:09] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2022-05-20 00:44:09] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2022-05-20 00:44:09] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-20 00:44:09] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 2 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-05-20 00:44:10] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-05-20 00:44:11] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2022-05-20 00:44:12] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 4 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-20 00:44:13] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-05-20 00:44:14] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-05-20 00:44:14] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 6539 ms
[2022-05-20 00:44:14] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-20 00:44:14] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-05-20 00:44:15] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2022-05-20 00:44:15] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2022-05-20 00:44:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
[2022-05-20 00:44:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 716 ms
[2022-05-20 00:44:15] [INFO ] After 8870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 416 ms.
[2022-05-20 00:44:15] [INFO ] After 9894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 8 out of 1575 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1575/1575 places, 1325/1325 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1575 transition count 1323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1573 transition count 1323
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 1573 transition count 1319
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 1569 transition count 1319
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 34 place count 1558 transition count 1308
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 1558 transition count 1308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 1557 transition count 1307
Applied a total of 39 rules in 249 ms. Remains 1557 /1575 variables (removed 18) and now considering 1307/1325 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/1575 places, 1307/1325 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:17] [INFO ] Computed 551 place invariants in 29 ms
[2022-05-20 00:44:17] [INFO ] [Real]Absence check using 521 positive place invariants in 79 ms returned sat
[2022-05-20 00:44:17] [INFO ] [Real]Absence check using 521 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-20 00:44:18] [INFO ] After 1434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 00:44:19] [INFO ] [Nat]Absence check using 521 positive place invariants in 77 ms returned sat
[2022-05-20 00:44:19] [INFO ] [Nat]Absence check using 521 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-20 00:44:20] [INFO ] After 855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 00:44:20] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2022-05-20 00:44:20] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-05-20 00:44:20] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-05-20 00:44:20] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2022-05-20 00:44:20] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-20 00:44:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-20 00:44:22] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-20 00:44:23] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-05-20 00:44:23] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2833 ms
[2022-05-20 00:44:23] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 00:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-20 00:44:23] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2022-05-20 00:44:23] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2022-05-20 00:44:24] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2022-05-20 00:44:24] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2022-05-20 00:44:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 645 ms
[2022-05-20 00:44:24] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2022-05-20 00:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-20 00:44:24] [INFO ] After 5160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 358 ms.
[2022-05-20 00:44:24] [INFO ] After 6080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 273 ms.
Support contains 6 out of 1557 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1557/1557 places, 1307/1307 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1556 transition count 1306
Applied a total of 2 rules in 95 ms. Remains 1556 /1557 variables (removed 1) and now considering 1306/1307 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1556/1557 places, 1306/1307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1306 rows 1556 cols
[2022-05-20 00:44:26] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:44:26] [INFO ] [Real]Absence check using 524 positive place invariants in 82 ms returned sat
[2022-05-20 00:44:26] [INFO ] [Real]Absence check using 524 positive and 27 generalized place invariants in 5 ms returned sat
[2022-05-20 00:44:27] [INFO ] After 1359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 00:44:27] [INFO ] [Nat]Absence check using 524 positive place invariants in 79 ms returned sat
[2022-05-20 00:44:27] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 4 ms returned sat
[2022-05-20 00:44:28] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 00:44:28] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2022-05-20 00:44:29] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-05-20 00:44:30] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-05-20 00:44:31] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2022-05-20 00:44:32] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3996 ms
[2022-05-20 00:44:33] [INFO ] After 5285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 300 ms.
[2022-05-20 00:44:33] [INFO ] After 6082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 209 ms.
Support contains 5 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1556/1556 places, 1306/1306 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1555 transition count 1305
Applied a total of 2 rules in 118 ms. Remains 1555 /1556 variables (removed 1) and now considering 1305/1306 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1555/1556 places, 1305/1306 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Finished probabilistic random walk after 44690 steps, run visited all 6 properties in 2056 ms. (steps per millisecond=21 )
Probabilistic random walk after 44690 steps, saw 40289 distinct states, run finished after 2056 ms. (steps per millisecond=21 ) properties seen :6
FORMULA ShieldPPPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 606 stabilizing places and 606 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(F(G((F(X(p1))||p0)))))))))'
Support contains 5 out of 3062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3061 transition count 2461
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2711 transition count 2461
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 700 place count 2711 transition count 2213
Deduced a syphon composed of 248 places in 5 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 1196 place count 2463 transition count 2213
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1206 place count 2453 transition count 2203
Iterating global reduction 2 with 10 rules applied. Total rules applied 1216 place count 2453 transition count 2203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1216 place count 2453 transition count 2197
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1228 place count 2447 transition count 2197
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 2 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 2 with 1776 rules applied. Total rules applied 3004 place count 1559 transition count 1309
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3006 place count 1557 transition count 1307
Applied a total of 3006 rules in 581 ms. Remains 1557 /3062 variables (removed 1505) and now considering 1307/2812 (removed 1505) transitions.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:37] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:44:38] [INFO ] Implicit Places using invariants in 754 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:38] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:44:40] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2022-05-20 00:44:40] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:40] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:44:40] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1557/3062 places, 1307/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/3062 places, 1307/2812 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s212 1) (AND (EQ s968 1) (EQ s997 1))), p1:(AND (EQ s173 1) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37 reset in 1157 ms.
Product exploration explored 100000 steps with 37 reset in 1212 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:44] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:44:45] [INFO ] [Real]Absence check using 551 positive place invariants in 410 ms returned sat
[2022-05-20 00:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:44:50] [INFO ] [Real]Absence check using state equation in 4535 ms returned sat
[2022-05-20 00:44:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:44:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 422 ms returned sat
[2022-05-20 00:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:44:56] [INFO ] [Nat]Absence check using state equation in 4516 ms returned sat
[2022-05-20 00:44:56] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-20 00:44:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2022-05-20 00:44:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2022-05-20 00:44:56] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-20 00:44:56] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-20 00:44:57] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2022-05-20 00:44:57] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-20 00:44:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-05-20 00:44:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2022-05-20 00:44:57] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-05-20 00:44:58] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2022-05-20 00:44:59] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-20 00:44:59] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2022-05-20 00:44:59] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2022-05-20 00:44:59] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-20 00:44:59] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3325 ms
[2022-05-20 00:44:59] [INFO ] Computed and/alt/rep : 1302/2505/1302 causal constraints (skipped 0 transitions) in 62 ms.
[2022-05-20 00:45:05] [INFO ] Added : 265 causal constraints over 53 iterations in 5685 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 1557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1557/1557 places, 1307/1307 transitions.
Applied a total of 0 rules in 53 ms. Remains 1557 /1557 variables (removed 0) and now considering 1307/1307 (removed 0) transitions.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:05] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:45:06] [INFO ] Implicit Places using invariants in 726 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:06] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:45:07] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
[2022-05-20 00:45:07] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:07] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:45:08] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/1557 places, 1307/1307 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:09] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:45:10] [INFO ] [Real]Absence check using 551 positive place invariants in 401 ms returned sat
[2022-05-20 00:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:45:15] [INFO ] [Real]Absence check using state equation in 4555 ms returned sat
[2022-05-20 00:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:45:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 432 ms returned sat
[2022-05-20 00:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:45:21] [INFO ] [Nat]Absence check using state equation in 4603 ms returned sat
[2022-05-20 00:45:21] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-20 00:45:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2022-05-20 00:45:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-20 00:45:21] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-20 00:45:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2022-05-20 00:45:22] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2022-05-20 00:45:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2022-05-20 00:45:22] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2022-05-20 00:45:22] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2022-05-20 00:45:22] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-20 00:45:23] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2022-05-20 00:45:24] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-20 00:45:24] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2022-05-20 00:45:24] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-20 00:45:24] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-05-20 00:45:24] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3262 ms
[2022-05-20 00:45:24] [INFO ] Computed and/alt/rep : 1302/2505/1302 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-20 00:45:30] [INFO ] Added : 265 causal constraints over 53 iterations in 5634 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 36 reset in 996 ms.
Product exploration explored 100000 steps with 37 reset in 1213 ms.
Built C files in :
/tmp/ltsmin6804707331114228122
[2022-05-20 00:45:32] [INFO ] Computing symmetric may disable matrix : 1307 transitions.
[2022-05-20 00:45:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:32] [INFO ] Computing symmetric may enable matrix : 1307 transitions.
[2022-05-20 00:45:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:32] [INFO ] Computing Do-Not-Accords matrix : 1307 transitions.
[2022-05-20 00:45:32] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:32] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6804707331114228122
Running compilation step : cd /tmp/ltsmin6804707331114228122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6804707331114228122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6804707331114228122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 1557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1557/1557 places, 1307/1307 transitions.
Applied a total of 0 rules in 67 ms. Remains 1557 /1557 variables (removed 0) and now considering 1307/1307 (removed 0) transitions.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:35] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:45:36] [INFO ] Implicit Places using invariants in 643 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:36] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:45:38] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2022-05-20 00:45:38] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:45:38] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:45:38] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/1557 places, 1307/1307 transitions.
Built C files in :
/tmp/ltsmin7683774013059488482
[2022-05-20 00:45:38] [INFO ] Computing symmetric may disable matrix : 1307 transitions.
[2022-05-20 00:45:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:38] [INFO ] Computing symmetric may enable matrix : 1307 transitions.
[2022-05-20 00:45:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:39] [INFO ] Computing Do-Not-Accords matrix : 1307 transitions.
[2022-05-20 00:45:39] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:45:39] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7683774013059488482
Running compilation step : cd /tmp/ltsmin7683774013059488482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7683774013059488482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7683774013059488482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:45:42] [INFO ] Flatten gal took : 64 ms
[2022-05-20 00:45:42] [INFO ] Flatten gal took : 49 ms
[2022-05-20 00:45:42] [INFO ] Time to serialize gal into /tmp/LTL2384490610301754455.gal : 14 ms
[2022-05-20 00:45:42] [INFO ] Time to serialize properties into /tmp/LTL7323654111163210267.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/LTL2384490610301754455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7323654111163210267.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/LTL2384490...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G(X(F(G(((F(X("((p418==1)&&(p441==1))")))||("(p495==1)"))||("((p2138==1)&&(p2188==1))"))))))))))
Formula 0 simplified : !FXXGXFG("((p2138==1)&&(p2188==1))" | "(p495==1)" | FX"((p418==1)&&(p441==1))")
Detected timeout of ITS tools.
[2022-05-20 00:45:57] [INFO ] Flatten gal took : 48 ms
[2022-05-20 00:45:57] [INFO ] Applying decomposition
[2022-05-20 00:45:57] [INFO ] Flatten gal took : 48 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/graph16772191397165824388.txt' '-o' '/tmp/graph16772191397165824388.bin' '-w' '/tmp/graph16772191397165824388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16772191397165824388.bin' '-l' '-1' '-v' '-w' '/tmp/graph16772191397165824388.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:45:57] [INFO ] Decomposing Gal with order
[2022-05-20 00:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:45:57] [INFO ] Removed a total of 303 redundant transitions.
[2022-05-20 00:45:57] [INFO ] Flatten gal took : 136 ms
[2022-05-20 00:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 29 ms.
[2022-05-20 00:45:58] [INFO ] Time to serialize gal into /tmp/LTL3433675452375009738.gal : 15 ms
[2022-05-20 00:45:58] [INFO ] Time to serialize properties into /tmp/LTL18003327685452803015.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/LTL3433675452375009738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18003327685452803015.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/LTL3433675...246
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G(X(F(G(((F(X("((i4.i1.i1.u61.p418==1)&&(i4.i1.i0.u66.p441==1))")))||("(i5.u77.p495==1)"))||("((i30.u345.p2138==1)&&(i30.u355...177
Formula 0 simplified : !FXXGXFG("((i30.u345.p2138==1)&&(i30.u355.p2188==1))" | "(i5.u77.p495==1)" | FX"((i4.i1.i1.u61.p418==1)&&(i4.i1.i0.u66.p441==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3539675899113331478
[2022-05-20 00:46:13] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3539675899113331478
Running compilation step : cd /tmp/ltsmin3539675899113331478;'/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 2544 ms.
Running link step : cd /tmp/ltsmin3539675899113331478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin3539675899113331478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X([](X(<>([]((<>(X((LTLAPp1==true)))||(LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-00 finished in 111003 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U (!G(F(p1))&&X(p2)))))'
Support contains 5 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3052 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3052 transition count 2802
Applied a total of 20 rules in 388 ms. Remains 3052 /3062 variables (removed 10) and now considering 2802/2812 (removed 10) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:46:28] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:46:29] [INFO ] Implicit Places using invariants in 1135 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:46:29] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:46:33] [INFO ] Implicit Places using invariants and state equation in 3280 ms returned []
Implicit Place search using SMT with State Equation took 4418 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:46:33] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:46:34] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3062 places, 2802/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3062 places, 2802/2812 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, p0]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s2469 1) (EQ s2501 1)), p2:(EQ s1130 1), p1:(AND (EQ s1261 1) (EQ s1306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1700 steps with 0 reset in 17 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-01 finished in 7057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!F(p0) U p0))) U (X(p1)||X(p2)||p3)))'
Support contains 6 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3053 transition count 2803
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3053 transition count 2803
Applied a total of 18 rules in 370 ms. Remains 3053 /3062 variables (removed 9) and now considering 2803/2812 (removed 9) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:35] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:46:36] [INFO ] Implicit Places using invariants in 1069 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:36] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:46:39] [INFO ] Implicit Places using invariants and state equation in 3306 ms returned []
Implicit Place search using SMT with State Equation took 4376 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:40] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:46:41] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3062 places, 2803/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3062 places, 2803/2812 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s443 1) (EQ s460 1)), p3:(EQ s167 1), p1:(AND (EQ s1270 1) (EQ s1302 1)), p2:(EQ s810 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-02 finished in 6881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !(X((X(p1)||p0))||X(!p1)||p2))))'
Support contains 3 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3053 transition count 2803
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3053 transition count 2803
Applied a total of 18 rules in 366 ms. Remains 3053 /3062 variables (removed 9) and now considering 2803/2812 (removed 9) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:42] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 00:46:43] [INFO ] Implicit Places using invariants in 1096 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:43] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 00:46:46] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 4478 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:46] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:46:48] [INFO ] Dead Transitions using invariants and state equation in 1965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3062 places, 2803/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3062 places, 2803/2812 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, true, p1, p1]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p2:(EQ s1597 1), p0:(EQ s2593 1), p1:(NEQ s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 95 reset in 744 ms.
Product exploration explored 100000 steps with 93 reset in 833 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/3053 stabilizing places and 600/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 560 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 128 ms :[true, true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:46:51] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:46:52] [INFO ] [Real]Absence check using 551 positive place invariants in 208 ms returned sat
[2022-05-20 00:46:52] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:46:53] [INFO ] [Nat]Absence check using 551 positive place invariants in 205 ms returned sat
[2022-05-20 00:46:54] [INFO ] After 1607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:46:55] [INFO ] Deduced a trap composed of 22 places in 821 ms of which 2 ms to minimize.
[2022-05-20 00:46:56] [INFO ] Deduced a trap composed of 19 places in 812 ms of which 2 ms to minimize.
[2022-05-20 00:46:57] [INFO ] Deduced a trap composed of 29 places in 805 ms of which 2 ms to minimize.
[2022-05-20 00:46:58] [INFO ] Deduced a trap composed of 27 places in 804 ms of which 2 ms to minimize.
[2022-05-20 00:46:59] [INFO ] Deduced a trap composed of 20 places in 795 ms of which 1 ms to minimize.
[2022-05-20 00:47:00] [INFO ] Deduced a trap composed of 32 places in 785 ms of which 1 ms to minimize.
[2022-05-20 00:47:01] [INFO ] Deduced a trap composed of 18 places in 783 ms of which 2 ms to minimize.
[2022-05-20 00:47:01] [INFO ] Deduced a trap composed of 42 places in 725 ms of which 2 ms to minimize.
[2022-05-20 00:47:02] [INFO ] Deduced a trap composed of 23 places in 749 ms of which 2 ms to minimize.
[2022-05-20 00:47:03] [INFO ] Deduced a trap composed of 44 places in 723 ms of which 1 ms to minimize.
[2022-05-20 00:47:04] [INFO ] Deduced a trap composed of 18 places in 734 ms of which 1 ms to minimize.
[2022-05-20 00:47:05] [INFO ] Deduced a trap composed of 31 places in 746 ms of which 1 ms to minimize.
[2022-05-20 00:47:06] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 2 ms to minimize.
[2022-05-20 00:47:06] [INFO ] Deduced a trap composed of 19 places in 701 ms of which 1 ms to minimize.
[2022-05-20 00:47:07] [INFO ] Deduced a trap composed of 29 places in 692 ms of which 1 ms to minimize.
[2022-05-20 00:47:08] [INFO ] Deduced a trap composed of 33 places in 705 ms of which 4 ms to minimize.
[2022-05-20 00:47:09] [INFO ] Deduced a trap composed of 35 places in 716 ms of which 2 ms to minimize.
[2022-05-20 00:47:10] [INFO ] Deduced a trap composed of 37 places in 710 ms of which 1 ms to minimize.
[2022-05-20 00:47:10] [INFO ] Deduced a trap composed of 33 places in 689 ms of which 2 ms to minimize.
[2022-05-20 00:47:11] [INFO ] Deduced a trap composed of 22 places in 678 ms of which 2 ms to minimize.
[2022-05-20 00:47:12] [INFO ] Deduced a trap composed of 25 places in 674 ms of which 2 ms to minimize.
[2022-05-20 00:47:13] [INFO ] Deduced a trap composed of 33 places in 686 ms of which 2 ms to minimize.
[2022-05-20 00:47:13] [INFO ] Deduced a trap composed of 30 places in 666 ms of which 2 ms to minimize.
[2022-05-20 00:47:14] [INFO ] Deduced a trap composed of 34 places in 657 ms of which 1 ms to minimize.
[2022-05-20 00:47:15] [INFO ] Deduced a trap composed of 33 places in 670 ms of which 1 ms to minimize.
[2022-05-20 00:47:16] [INFO ] Deduced a trap composed of 30 places in 644 ms of which 1 ms to minimize.
[2022-05-20 00:47:17] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 2 ms to minimize.
[2022-05-20 00:47:17] [INFO ] Deduced a trap composed of 26 places in 672 ms of which 1 ms to minimize.
[2022-05-20 00:47:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:47:17] [INFO ] After 25352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 108 ms.
Support contains 3 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3053 transition count 2453
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2703 transition count 2453
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 700 place count 2703 transition count 2202
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1202 place count 2452 transition count 2202
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 2996 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3442 place count 1555 transition count 1305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Applied a total of 3443 rules in 480 ms. Remains 1554 /3053 variables (removed 1499) and now considering 1304/2803 (removed 1499) transitions.
Finished structural reductions, in 1 iterations. Remains : 1554/3053 places, 1304/2803 transitions.
Finished random walk after 2743 steps, including 0 resets, run visited all 2 properties in 59 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F p2), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (F (OR (AND p2 (NOT p1)) (AND p2 p0))), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1 p0))]
Knowledge based reduction with 16 factoid took 798 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[true, true, p1, p1]
Stuttering acceptance computed with spot in 169 ms :[true, true, p1, p1]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:19] [INFO ] Computed 551 place invariants in 16 ms
Proved EG true
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F p2), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (F (OR (AND p2 (NOT p1)) (AND p2 p0))), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1 p0)), true]
Knowledge based reduction with 16 factoid took 1022 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[true, true, p1, p1]
Support contains 3 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 179 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:23] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:47:24] [INFO ] Implicit Places using invariants in 1112 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:24] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:47:27] [INFO ] Implicit Places using invariants and state equation in 3405 ms returned []
Implicit Place search using SMT with State Equation took 4520 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:27] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:47:29] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3053 places, 2803/2803 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/3053 stabilizing places and 600/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 568 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[true, true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:30] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:47:31] [INFO ] [Real]Absence check using 551 positive place invariants in 201 ms returned sat
[2022-05-20 00:47:31] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 00:47:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 198 ms returned sat
[2022-05-20 00:47:34] [INFO ] After 1825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 00:47:35] [INFO ] Deduced a trap composed of 21 places in 819 ms of which 2 ms to minimize.
[2022-05-20 00:47:36] [INFO ] Deduced a trap composed of 26 places in 795 ms of which 2 ms to minimize.
[2022-05-20 00:47:36] [INFO ] Deduced a trap composed of 22 places in 782 ms of which 2 ms to minimize.
[2022-05-20 00:47:37] [INFO ] Deduced a trap composed of 19 places in 795 ms of which 1 ms to minimize.
[2022-05-20 00:47:38] [INFO ] Deduced a trap composed of 28 places in 799 ms of which 1 ms to minimize.
[2022-05-20 00:47:39] [INFO ] Deduced a trap composed of 23 places in 827 ms of which 2 ms to minimize.
[2022-05-20 00:47:40] [INFO ] Deduced a trap composed of 19 places in 776 ms of which 2 ms to minimize.
[2022-05-20 00:47:41] [INFO ] Deduced a trap composed of 24 places in 788 ms of which 1 ms to minimize.
[2022-05-20 00:47:42] [INFO ] Deduced a trap composed of 22 places in 835 ms of which 2 ms to minimize.
[2022-05-20 00:47:43] [INFO ] Deduced a trap composed of 20 places in 759 ms of which 2 ms to minimize.
[2022-05-20 00:47:44] [INFO ] Deduced a trap composed of 25 places in 758 ms of which 2 ms to minimize.
[2022-05-20 00:47:44] [INFO ] Deduced a trap composed of 30 places in 806 ms of which 2 ms to minimize.
[2022-05-20 00:47:45] [INFO ] Deduced a trap composed of 28 places in 814 ms of which 2 ms to minimize.
[2022-05-20 00:47:46] [INFO ] Deduced a trap composed of 25 places in 796 ms of which 1 ms to minimize.
[2022-05-20 00:47:47] [INFO ] Deduced a trap composed of 37 places in 810 ms of which 2 ms to minimize.
[2022-05-20 00:47:48] [INFO ] Deduced a trap composed of 31 places in 755 ms of which 1 ms to minimize.
[2022-05-20 00:47:49] [INFO ] Deduced a trap composed of 23 places in 728 ms of which 2 ms to minimize.
[2022-05-20 00:47:50] [INFO ] Deduced a trap composed of 28 places in 751 ms of which 2 ms to minimize.
[2022-05-20 00:47:51] [INFO ] Deduced a trap composed of 31 places in 715 ms of which 2 ms to minimize.
[2022-05-20 00:47:51] [INFO ] Deduced a trap composed of 19 places in 714 ms of which 2 ms to minimize.
[2022-05-20 00:47:52] [INFO ] Deduced a trap composed of 30 places in 726 ms of which 2 ms to minimize.
[2022-05-20 00:47:53] [INFO ] Deduced a trap composed of 39 places in 714 ms of which 2 ms to minimize.
[2022-05-20 00:47:54] [INFO ] Deduced a trap composed of 38 places in 718 ms of which 2 ms to minimize.
[2022-05-20 00:47:55] [INFO ] Deduced a trap composed of 25 places in 655 ms of which 1 ms to minimize.
[2022-05-20 00:47:55] [INFO ] Deduced a trap composed of 20 places in 721 ms of which 1 ms to minimize.
[2022-05-20 00:47:56] [INFO ] Deduced a trap composed of 26 places in 705 ms of which 2 ms to minimize.
[2022-05-20 00:47:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:47:56] [INFO ] After 25197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 377 ms.
Support contains 3 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3053 transition count 2453
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2703 transition count 2453
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 700 place count 2703 transition count 2202
Deduced a syphon composed of 251 places in 9 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1202 place count 2452 transition count 2202
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 2996 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3442 place count 1555 transition count 1305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Applied a total of 3443 rules in 440 ms. Remains 1554 /3053 variables (removed 1499) and now considering 1304/2803 (removed 1499) transitions.
Finished structural reductions, in 1 iterations. Remains : 1554/3053 places, 1304/2803 transitions.
Finished random walk after 1298 steps, including 0 resets, run visited all 5 properties in 51 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F p2), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (F (OR (AND p2 (NOT p1)) (AND p2 p0))), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1 p0))]
Knowledge based reduction with 16 factoid took 867 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[true, true, p1, p1]
Stuttering acceptance computed with spot in 167 ms :[true, true, p1, p1]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:47:58] [INFO ] Computed 551 place invariants in 16 ms
Proved EG true
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F p2), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (F (OR (AND p2 (NOT p1)) (AND p2 p0))), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1 p0)), true]
Knowledge based reduction with 16 factoid took 723 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[true, true, p1, p1]
Stuttering acceptance computed with spot in 148 ms :[true, true, p1, p1]
Stuttering criterion allowed to conclude after 57299 steps with 47 reset in 397 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-03 finished in 80242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X((X(F(X(p1)))&&G(p2)))))'
Support contains 2 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3052 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3052 transition count 2802
Applied a total of 20 rules in 369 ms. Remains 3052 /3062 variables (removed 10) and now considering 2802/2812 (removed 10) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:02] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 00:48:03] [INFO ] Implicit Places using invariants in 1132 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:03] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:48:07] [INFO ] Implicit Places using invariants and state equation in 3448 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:07] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:48:09] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3062 places, 2802/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3062 places, 2802/2812 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 4}, { cond=(NOT p2), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=1, aps=[p2:(EQ s41 1), p1:(EQ s41 0), p0:(EQ s1862 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-04 finished in 7334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((X(F(p1))||p0))&&X(p2)))))'
Support contains 4 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3052 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3052 transition count 2802
Applied a total of 20 rules in 363 ms. Remains 3052 /3062 variables (removed 10) and now considering 2802/2812 (removed 10) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:10] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:48:11] [INFO ] Implicit Places using invariants in 1176 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:11] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:48:14] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4627 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:48:14] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:48:16] [INFO ] Dead Transitions using invariants and state equation in 1990 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3062 places, 2802/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3062 places, 2802/2812 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s1327 0) (EQ s1350 0)), p0:(OR (EQ s729 0) (EQ s761 0)), p1:(AND (EQ s729 1) (EQ s761 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 10672 steps with 1 reset in 118 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-05 finished in 7301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 3062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3061 transition count 2461
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2711 transition count 2461
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2711 transition count 2211
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2461 transition count 2211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1210 place count 2451 transition count 2201
Iterating global reduction 2 with 10 rules applied. Total rules applied 1220 place count 2451 transition count 2201
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1220 place count 2451 transition count 2195
Deduced a syphon composed of 6 places in 27 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1232 place count 2445 transition count 2195
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Deduced a syphon composed of 890 places in 2 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 2 with 1780 rules applied. Total rules applied 3012 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3014 place count 1553 transition count 1303
Applied a total of 3014 rules in 585 ms. Remains 1553 /3062 variables (removed 1509) and now considering 1303/2812 (removed 1509) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:48:17] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:48:18] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:48:18] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:48:19] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2022-05-20 00:48:19] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:48:19] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:48:20] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/3062 places, 1303/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/3062 places, 1303/2812 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-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:(AND (EQ s471 1) (EQ s489 1) (EQ s1195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3609 steps with 0 reset in 50 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-06 finished in 3729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G((X((G(p0) U p1))||p2))))))'
Support contains 2 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3053 transition count 2803
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3053 transition count 2803
Applied a total of 18 rules in 382 ms. Remains 3053 /3062 variables (removed 9) and now considering 2803/2812 (removed 9) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:48:21] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:48:22] [INFO ] Implicit Places using invariants in 1045 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:48:22] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:48:25] [INFO ] Implicit Places using invariants and state equation in 3468 ms returned []
Implicit Place search using SMT with State Equation took 4518 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:48:25] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:48:27] [INFO ] Dead Transitions using invariants and state equation in 1973 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3062 places, 2803/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3062 places, 2803/2812 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s72 0), p1:(OR (NEQ s893 1) (EQ s72 1)), p0:(EQ s72 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 1023 ms.
Product exploration explored 100000 steps with 13 reset in 1185 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 748 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:48:31] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:48:32] [INFO ] [Real]Absence check using 551 positive place invariants in 207 ms returned sat
[2022-05-20 00:48:34] [INFO ] After 1633ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:4
[2022-05-20 00:48:35] [INFO ] Deduced a trap composed of 37 places in 915 ms of which 2 ms to minimize.
[2022-05-20 00:48:36] [INFO ] Deduced a trap composed of 29 places in 896 ms of which 2 ms to minimize.
[2022-05-20 00:48:37] [INFO ] Deduced a trap composed of 18 places in 899 ms of which 2 ms to minimize.
[2022-05-20 00:48:38] [INFO ] Deduced a trap composed of 21 places in 888 ms of which 2 ms to minimize.
[2022-05-20 00:48:39] [INFO ] Deduced a trap composed of 27 places in 895 ms of which 2 ms to minimize.
[2022-05-20 00:48:40] [INFO ] Deduced a trap composed of 21 places in 862 ms of which 2 ms to minimize.
[2022-05-20 00:48:41] [INFO ] Deduced a trap composed of 23 places in 878 ms of which 2 ms to minimize.
[2022-05-20 00:48:42] [INFO ] Deduced a trap composed of 30 places in 873 ms of which 4 ms to minimize.
[2022-05-20 00:48:43] [INFO ] Deduced a trap composed of 27 places in 883 ms of which 2 ms to minimize.
[2022-05-20 00:48:44] [INFO ] Deduced a trap composed of 35 places in 889 ms of which 2 ms to minimize.
[2022-05-20 00:48:45] [INFO ] Deduced a trap composed of 33 places in 813 ms of which 1 ms to minimize.
[2022-05-20 00:48:45] [INFO ] Deduced a trap composed of 17 places in 835 ms of which 2 ms to minimize.
[2022-05-20 00:48:46] [INFO ] Deduced a trap composed of 34 places in 827 ms of which 2 ms to minimize.
[2022-05-20 00:48:47] [INFO ] Deduced a trap composed of 35 places in 829 ms of which 2 ms to minimize.
[2022-05-20 00:48:48] [INFO ] Deduced a trap composed of 33 places in 826 ms of which 2 ms to minimize.
[2022-05-20 00:48:49] [INFO ] Deduced a trap composed of 25 places in 772 ms of which 2 ms to minimize.
[2022-05-20 00:48:50] [INFO ] Deduced a trap composed of 35 places in 731 ms of which 2 ms to minimize.
[2022-05-20 00:48:51] [INFO ] Deduced a trap composed of 19 places in 756 ms of which 2 ms to minimize.
[2022-05-20 00:48:52] [INFO ] Deduced a trap composed of 29 places in 726 ms of which 2 ms to minimize.
[2022-05-20 00:48:53] [INFO ] Deduced a trap composed of 26 places in 731 ms of which 1 ms to minimize.
[2022-05-20 00:48:53] [INFO ] Deduced a trap composed of 19 places in 725 ms of which 2 ms to minimize.
[2022-05-20 00:48:54] [INFO ] Deduced a trap composed of 34 places in 698 ms of which 1 ms to minimize.
[2022-05-20 00:48:55] [INFO ] Deduced a trap composed of 49 places in 684 ms of which 2 ms to minimize.
[2022-05-20 00:48:56] [INFO ] Deduced a trap composed of 41 places in 727 ms of which 2 ms to minimize.
[2022-05-20 00:48:57] [INFO ] Deduced a trap composed of 35 places in 695 ms of which 1 ms to minimize.
[2022-05-20 00:48:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:48:57] [INFO ] After 25476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3053 transition count 2453
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2703 transition count 2453
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2703 transition count 2203
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2453 transition count 2203
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 2 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 2998 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3444 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3445 place count 1553 transition count 1303
Applied a total of 3445 rules in 456 ms. Remains 1553 /3053 variables (removed 1500) and now considering 1303/2803 (removed 1500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/3053 places, 1303/2803 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89364 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89364 steps, saw 83722 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:49:01] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:49:01] [INFO ] [Real]Absence check using 522 positive place invariants in 84 ms returned sat
[2022-05-20 00:49:01] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-20 00:49:02] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 00:49:02] [INFO ] [Nat]Absence check using 522 positive place invariants in 87 ms returned sat
[2022-05-20 00:49:02] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-20 00:49:03] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2022-05-20 00:49:03] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-20 00:49:04] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2022-05-20 00:49:05] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-05-20 00:49:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2748 ms
[2022-05-20 00:49:06] [INFO ] After 3688ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-20 00:49:06] [INFO ] After 4304ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1553 transition count 1302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1551 transition count 1301
Applied a total of 3 rules in 114 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 105648 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105648 steps, saw 98969 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:49:10] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:49:10] [INFO ] [Real]Absence check using 525 positive place invariants in 91 ms returned sat
[2022-05-20 00:49:10] [INFO ] [Real]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2022-05-20 00:49:11] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 00:49:11] [INFO ] [Nat]Absence check using 525 positive place invariants in 85 ms returned sat
[2022-05-20 00:49:11] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2022-05-20 00:49:12] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 00:49:13] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2022-05-20 00:49:13] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2022-05-20 00:49:13] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2022-05-20 00:49:13] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2022-05-20 00:49:13] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2022-05-20 00:49:14] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-20 00:49:15] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2022-05-20 00:49:15] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2022-05-20 00:49:15] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2022-05-20 00:49:15] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2022-05-20 00:49:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2873 ms
[2022-05-20 00:49:15] [INFO ] After 3867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-05-20 00:49:16] [INFO ] After 4389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 46 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 44 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:49:16] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:49:16] [INFO ] Implicit Places using invariants in 836 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:49:16] [INFO ] Computed 551 place invariants in 20 ms
[2022-05-20 00:49:19] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2907 ms to find 0 implicit places.
[2022-05-20 00:49:19] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:49:19] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:49:19] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 55 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:49:19] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:49:20] [INFO ] [Real]Absence check using 525 positive place invariants in 83 ms returned sat
[2022-05-20 00:49:20] [INFO ] [Real]Absence check using 525 positive and 26 generalized place invariants in 12 ms returned sat
[2022-05-20 00:49:20] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 00:49:21] [INFO ] [Nat]Absence check using 525 positive place invariants in 85 ms returned sat
[2022-05-20 00:49:21] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 11 ms returned sat
[2022-05-20 00:49:21] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 00:49:22] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-05-20 00:49:22] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2022-05-20 00:49:22] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2022-05-20 00:49:22] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2022-05-20 00:49:23] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-05-20 00:49:24] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2022-05-20 00:49:24] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2022-05-20 00:49:24] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2022-05-20 00:49:24] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-20 00:49:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2777 ms
[2022-05-20 00:49:24] [INFO ] After 3759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-05-20 00:49:25] [INFO ] After 4281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 00:49:25] [INFO ] Flatten gal took : 51 ms
[2022-05-20 00:49:25] [INFO ] Flatten gal took : 51 ms
[2022-05-20 00:49:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13901823442248279854.gal : 9 ms
[2022-05-20 00:49:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3235086771185146832.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1775158425964085559;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13901823442248279854.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3235086771185146832.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3235086771185146832.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
Reachability property apf7 is true.
Reachability property apf5 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,128,1.03809,17624,2,3437,11,11125,6,0,7360,2248,0
Total reachable state count : 128
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,1.04395,17624,2,1552,11,11125,7,0,7363,2248,0
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,1,1.04724,17624,2,1552,11,11125,8,0,7364,2248,0
Reachability property apf7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,1,1.05051,17624,2,1552,11,11125,9,0,7365,2248,0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 20 factoid took 915 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 170 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:49:27] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:49:28] [INFO ] Implicit Places using invariants in 1100 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:49:28] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:49:32] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4565 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:49:32] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:49:34] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3053 places, 2803/2803 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p2 p1), (X p1), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:49:34] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 00:49:34] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 00:49:35] [INFO ] [Nat]Absence check using 551 positive place invariants in 202 ms returned sat
[2022-05-20 00:49:36] [INFO ] After 1494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 00:49:37] [INFO ] Deduced a trap composed of 35 places in 891 ms of which 2 ms to minimize.
[2022-05-20 00:49:38] [INFO ] Deduced a trap composed of 26 places in 911 ms of which 2 ms to minimize.
[2022-05-20 00:49:39] [INFO ] Deduced a trap composed of 21 places in 878 ms of which 1 ms to minimize.
[2022-05-20 00:49:40] [INFO ] Deduced a trap composed of 35 places in 891 ms of which 2 ms to minimize.
[2022-05-20 00:49:41] [INFO ] Deduced a trap composed of 25 places in 861 ms of which 2 ms to minimize.
[2022-05-20 00:49:42] [INFO ] Deduced a trap composed of 32 places in 852 ms of which 2 ms to minimize.
[2022-05-20 00:49:43] [INFO ] Deduced a trap composed of 24 places in 784 ms of which 2 ms to minimize.
[2022-05-20 00:49:44] [INFO ] Deduced a trap composed of 32 places in 811 ms of which 2 ms to minimize.
[2022-05-20 00:49:45] [INFO ] Deduced a trap composed of 25 places in 804 ms of which 2 ms to minimize.
[2022-05-20 00:49:46] [INFO ] Deduced a trap composed of 23 places in 799 ms of which 1 ms to minimize.
[2022-05-20 00:49:47] [INFO ] Deduced a trap composed of 28 places in 786 ms of which 2 ms to minimize.
[2022-05-20 00:49:48] [INFO ] Deduced a trap composed of 49 places in 797 ms of which 1 ms to minimize.
[2022-05-20 00:49:48] [INFO ] Deduced a trap composed of 35 places in 751 ms of which 2 ms to minimize.
[2022-05-20 00:49:49] [INFO ] Deduced a trap composed of 33 places in 717 ms of which 1 ms to minimize.
[2022-05-20 00:49:50] [INFO ] Deduced a trap composed of 26 places in 735 ms of which 1 ms to minimize.
[2022-05-20 00:49:51] [INFO ] Deduced a trap composed of 31 places in 749 ms of which 2 ms to minimize.
[2022-05-20 00:49:52] [INFO ] Deduced a trap composed of 42 places in 730 ms of which 1 ms to minimize.
[2022-05-20 00:49:53] [INFO ] Deduced a trap composed of 19 places in 706 ms of which 1 ms to minimize.
[2022-05-20 00:49:53] [INFO ] Deduced a trap composed of 35 places in 710 ms of which 2 ms to minimize.
[2022-05-20 00:49:54] [INFO ] Deduced a trap composed of 11 places in 705 ms of which 1 ms to minimize.
[2022-05-20 00:49:55] [INFO ] Deduced a trap composed of 22 places in 708 ms of which 1 ms to minimize.
[2022-05-20 00:49:56] [INFO ] Deduced a trap composed of 26 places in 704 ms of which 1 ms to minimize.
[2022-05-20 00:49:57] [INFO ] Deduced a trap composed of 29 places in 699 ms of which 1 ms to minimize.
[2022-05-20 00:49:57] [INFO ] Deduced a trap composed of 20 places in 688 ms of which 1 ms to minimize.
[2022-05-20 00:49:58] [INFO ] Deduced a trap composed of 28 places in 698 ms of which 2 ms to minimize.
[2022-05-20 00:49:59] [INFO ] Deduced a trap composed of 31 places in 684 ms of which 1 ms to minimize.
[2022-05-20 00:50:00] [INFO ] Deduced a trap composed of 22 places in 700 ms of which 1 ms to minimize.
[2022-05-20 00:50:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:50:00] [INFO ] After 25458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2702 transition count 2452
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2702 transition count 2202
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2452 transition count 2202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1203 place count 2451 transition count 2201
Iterating global reduction 2 with 1 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1204 place count 2451 transition count 2200
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1206 place count 2450 transition count 2200
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 2 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 3002 place count 1552 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3448 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3449 place count 1551 transition count 1301
Applied a total of 3449 rules in 547 ms. Remains 1551 /3053 variables (removed 1502) and now considering 1301/2803 (removed 1502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/3053 places, 1301/2803 transitions.
Finished random walk after 2910 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND p2 p1), (X p1), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 13 reset in 969 ms.
Product exploration explored 100000 steps with 13 reset in 1175 ms.
Built C files in :
/tmp/ltsmin187271276048030789
[2022-05-20 00:50:03] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin187271276048030789
Running compilation step : cd /tmp/ltsmin187271276048030789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin187271276048030789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin187271276048030789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 181 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:06] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:50:07] [INFO ] Implicit Places using invariants in 1084 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:07] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:50:11] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:11] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:50:13] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3053 places, 2803/2803 transitions.
Built C files in :
/tmp/ltsmin17667156607070680344
[2022-05-20 00:50:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17667156607070680344
Running compilation step : cd /tmp/ltsmin17667156607070680344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17667156607070680344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17667156607070680344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:50:16] [INFO ] Flatten gal took : 75 ms
[2022-05-20 00:50:16] [INFO ] Flatten gal took : 71 ms
[2022-05-20 00:50:16] [INFO ] Time to serialize gal into /tmp/LTL10911387917876230633.gal : 10 ms
[2022-05-20 00:50:16] [INFO ] Time to serialize properties into /tmp/LTL17563750679963987995.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/LTL10911387917876230633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17563750679963987995.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/LTL1091138...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G((X((G("(p72==1)"))U("((p990!=1)||(p72==1))")))||("(p72==0)")))))))
Formula 0 simplified : !XGFG("(p72==0)" | X(G"(p72==1)" U "((p990!=1)||(p72==1))"))
Detected timeout of ITS tools.
[2022-05-20 00:50:31] [INFO ] Flatten gal took : 74 ms
[2022-05-20 00:50:31] [INFO ] Applying decomposition
[2022-05-20 00:50:31] [INFO ] Flatten gal took : 75 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/graph11436571001538409654.txt' '-o' '/tmp/graph11436571001538409654.bin' '-w' '/tmp/graph11436571001538409654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11436571001538409654.bin' '-l' '-1' '-v' '-w' '/tmp/graph11436571001538409654.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:50:31] [INFO ] Decomposing Gal with order
[2022-05-20 00:50:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:50:32] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:50:32] [INFO ] Flatten gal took : 173 ms
[2022-05-20 00:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-20 00:50:32] [INFO ] Time to serialize gal into /tmp/LTL12154717388168657109.gal : 32 ms
[2022-05-20 00:50:32] [INFO ] Time to serialize properties into /tmp/LTL1373984736274506598.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/LTL12154717388168657109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1373984736274506598.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/LTL1215471...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G((X((G("(i0.i3.i0.u29.p72==1)"))U("((i13.i2.i1.u350.p990!=1)||(i0.i3.i0.u29.p72==1))")))||("(i0.i3.i0.u29.p72==0)")))))))
Formula 0 simplified : !XGFG("(i0.i3.i0.u29.p72==0)" | X(G"(i0.i3.i0.u29.p72==1)" U "((i13.i2.i1.u350.p990!=1)||(i0.i3.i0.u29.p72==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9932603457965215891
[2022-05-20 00:50:47] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9932603457965215891
Running compilation step : cd /tmp/ltsmin9932603457965215891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9932603457965215891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9932603457965215891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-050B-LTLFireability-07 finished in 149809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((p1 U X(p2))||p0) U p3))'
Support contains 4 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3053 transition count 2803
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3053 transition count 2803
Applied a total of 18 rules in 368 ms. Remains 3053 /3062 variables (removed 9) and now considering 2803/2812 (removed 9) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:50] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:50:52] [INFO ] Implicit Places using invariants in 1165 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:52] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:50:55] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned []
Implicit Place search using SMT with State Equation took 4705 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:50:55] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:50:57] [INFO ] Dead Transitions using invariants and state equation in 1973 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3062 places, 2803/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3062 places, 2803/2812 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p3), true, p2, p2]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s2128 1), p0:(OR (EQ s216 1) (EQ s2160 1)), p1:(EQ s1850 1), p2:(EQ s2160 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][false, false, false, false]]
Product exploration explored 100000 steps with 33363 reset in 748 ms.
Product exploration explored 100000 steps with 33195 reset in 753 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3053 stabilizing places and 599/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 651 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p3), true, p2, p2]
Finished random walk after 2926 steps, including 0 resets, run visited all 5 properties in 54 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0))]
Knowledge based reduction with 14 factoid took 688 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p3), true, p2, p2]
Stuttering acceptance computed with spot in 150 ms :[(NOT p3), true, p2, p2]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:51:01] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:51:03] [INFO ] [Real]Absence check using 551 positive place invariants in 122 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 14 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-08 finished in 13381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(p1 U (X(p2)||p3))||X(p4)||p0))))'
Support contains 6 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3054 transition count 2804
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3054 transition count 2804
Applied a total of 16 rules in 392 ms. Remains 3054 /3062 variables (removed 8) and now considering 2804/2812 (removed 8) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:51:04] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:51:05] [INFO ] Implicit Places using invariants in 1129 ms returned []
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:51:05] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:51:08] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 4473 ms to find 0 implicit places.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:51:08] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:51:10] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3062 places, 2804/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3054/3062 places, 2804/2812 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (NOT p4), (AND (NOT p4) p2), p2, (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND p3 (NOT p4)) (AND p2 (NOT p4))), (OR p2 p3), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3 (NOT p4)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p4), acceptance={} source=1 dest: 0}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=2 dest: 0}], [{ cond=p2, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p3 (NOT p4)) (AND p2 (NOT p4))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(OR p3 p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 4}]], initial=7, aps=[p4:(OR (EQ s1462 0) (EQ s1490 0)), p2:(NEQ s950 1), p0:(OR (EQ s1462 0) (EQ s1490 0)), p3:(EQ s2626 1), p1:(AND (EQ s663 1) (EQ s695 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 643 ms.
Product exploration explored 100000 steps with 33333 reset in 658 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p4 p2 p0 (NOT p3) (NOT p1)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 9 states, 15 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-09 finished in 8614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||p1)))'
Support contains 2 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3052 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3052 transition count 2802
Applied a total of 20 rules in 382 ms. Remains 3052 /3062 variables (removed 10) and now considering 2802/2812 (removed 10) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:51:12] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:51:13] [INFO ] Implicit Places using invariants in 1063 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:51:13] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:51:17] [INFO ] Implicit Places using invariants and state equation in 3465 ms returned []
Implicit Place search using SMT with State Equation took 4530 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:51:17] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:51:19] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3062 places, 2802/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3062 places, 2802/2812 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s3 0), p0:(EQ s2752 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 6 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-11 finished in 6841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(X(p0)))||G(X(G(F(p1))))))'
Support contains 3 out of 3062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3061 transition count 2460
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2710 transition count 2460
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2710 transition count 2210
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2460 transition count 2210
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1211 place count 2451 transition count 2201
Iterating global reduction 2 with 9 rules applied. Total rules applied 1220 place count 2451 transition count 2201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1220 place count 2451 transition count 2196
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1230 place count 2446 transition count 2196
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 2 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 3012 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3014 place count 1553 transition count 1303
Applied a total of 3014 rules in 474 ms. Remains 1553 /3062 variables (removed 1509) and now considering 1303/2812 (removed 1509) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:51:19] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:51:20] [INFO ] Implicit Places using invariants in 648 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:51:20] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:51:22] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2022-05-20 00:51:22] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:51:22] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:51:22] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/3062 places, 1303/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/3062 places, 1303/2812 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s910 1) (EQ s921 1)), p1:(EQ s1048 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3505 steps with 3 reset in 39 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-12 finished in 3409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(X(G(p0)))) U X(p0)))'
Support contains 1 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3053 transition count 2803
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3053 transition count 2803
Applied a total of 18 rules in 360 ms. Remains 3053 /3062 variables (removed 9) and now considering 2803/2812 (removed 9) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:51:23] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 00:51:24] [INFO ] Implicit Places using invariants in 1079 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:51:24] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:51:27] [INFO ] Implicit Places using invariants and state equation in 3316 ms returned []
Implicit Place search using SMT with State Equation took 4397 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:51:27] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:51:29] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3062 places, 2803/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3062 places, 2803/2812 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1293 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][false, false, false, false]]
Product exploration explored 100000 steps with 111 reset in 570 ms.
Product exploration explored 100000 steps with 85 reset in 777 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/3053 stabilizing places and 600/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), p0, p0]
Finished random walk after 1219 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=121 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), p0, p0]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), p0, p0]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:51:31] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:51:34] [INFO ] [Real]Absence check using 551 positive place invariants in 1252 ms returned sat
[2022-05-20 00:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:51:46] [INFO ] [Real]Absence check using state equation in 11873 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3052 transition count 2450
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2700 transition count 2450
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 704 place count 2700 transition count 2201
Deduced a syphon composed of 249 places in 6 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1202 place count 2451 transition count 2201
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 2996 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2998 place count 1552 transition count 1302
Applied a total of 2998 rules in 361 ms. Remains 1552 /3053 variables (removed 1501) and now considering 1302/2803 (removed 1501) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:51:46] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:51:47] [INFO ] Implicit Places using invariants in 665 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:51:47] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:51:49] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2022-05-20 00:51:49] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:51:49] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:51:49] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3053 places, 1302/2803 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/3053 places, 1302/2803 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1552 stabilizing places and 2/1302 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), p0, p0]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), p0, p0]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), p0, p0]
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:51:50] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:51:51] [INFO ] [Real]Absence check using 551 positive place invariants in 434 ms returned sat
[2022-05-20 00:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:51:58] [INFO ] [Real]Absence check using state equation in 6643 ms returned sat
[2022-05-20 00:51:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:51:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 388 ms returned sat
[2022-05-20 00:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:52:04] [INFO ] [Nat]Absence check using state equation in 4415 ms returned sat
[2022-05-20 00:52:04] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2022-05-20 00:52:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-20 00:52:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-20 00:52:04] [INFO ] Computed and/alt/rep : 1299/2508/1299 causal constraints (skipped 0 transitions) in 63 ms.
[2022-05-20 00:52:13] [INFO ] Added : 375 causal constraints over 75 iterations in 8991 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), p0, p0]
Product exploration explored 100000 steps with 185 reset in 992 ms.
Product exploration explored 100000 steps with 151 reset in 1170 ms.
Built C files in :
/tmp/ltsmin8248530404303772314
[2022-05-20 00:52:15] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:52:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:15] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:52:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:16] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:52:16] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:16] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8248530404303772314
Running compilation step : cd /tmp/ltsmin8248530404303772314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8248530404303772314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8248530404303772314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 52 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:52:19] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:52:19] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:52:19] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:52:21] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2022-05-20 00:52:21] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:52:21] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:52:22] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin8937981514681247270
[2022-05-20 00:52:22] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:52:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:22] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:52:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:22] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:52:22] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:52:22] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8937981514681247270
Running compilation step : cd /tmp/ltsmin8937981514681247270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8937981514681247270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8937981514681247270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:52:25] [INFO ] Flatten gal took : 39 ms
[2022-05-20 00:52:25] [INFO ] Flatten gal took : 40 ms
[2022-05-20 00:52:25] [INFO ] Time to serialize gal into /tmp/LTL8644780732296931361.gal : 6 ms
[2022-05-20 00:52:25] [INFO ] Time to serialize properties into /tmp/LTL9069102774528294154.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/LTL8644780732296931361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9069102774528294154.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/LTL8644780...266
Read 1 LTL properties
Checking formula 0 : !(((X(!(F(X(G("(p1435==1)"))))))U(X("(p1435==1)"))))
Formula 0 simplified : !(X!FXG"(p1435==1)" U X"(p1435==1)")
Detected timeout of ITS tools.
[2022-05-20 00:52:40] [INFO ] Flatten gal took : 42 ms
[2022-05-20 00:52:40] [INFO ] Applying decomposition
[2022-05-20 00:52:40] [INFO ] Flatten gal took : 42 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/graph6605437531157049385.txt' '-o' '/tmp/graph6605437531157049385.bin' '-w' '/tmp/graph6605437531157049385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6605437531157049385.bin' '-l' '-1' '-v' '-w' '/tmp/graph6605437531157049385.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:52:40] [INFO ] Decomposing Gal with order
[2022-05-20 00:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:52:40] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:52:40] [INFO ] Flatten gal took : 82 ms
[2022-05-20 00:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 15 ms.
[2022-05-20 00:52:40] [INFO ] Time to serialize gal into /tmp/LTL6159357274566155481.gal : 10 ms
[2022-05-20 00:52:40] [INFO ] Time to serialize properties into /tmp/LTL18036185627617042052.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/LTL6159357274566155481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18036185627617042052.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/LTL6159357...246
Read 1 LTL properties
Checking formula 0 : !(((X(!(F(X(G("(i20.u229.p1435==1)"))))))U(X("(i20.u229.p1435==1)"))))
Formula 0 simplified : !(X!FXG"(i20.u229.p1435==1)" U X"(i20.u229.p1435==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin530738042022520743
[2022-05-20 00:52:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin530738042022520743
Running compilation step : cd /tmp/ltsmin530738042022520743;'/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 2406 ms.
Running link step : cd /tmp/ltsmin530738042022520743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin530738042022520743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(!<>(X([]((LTLAPp0==true))))) U X((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-13 finished in 108196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((G(p0) U p1) U X(X(p2)))||p3)))'
Support contains 3 out of 3062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3052 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3052 transition count 2802
Applied a total of 20 rules in 356 ms. Remains 3052 /3062 variables (removed 10) and now considering 2802/2812 (removed 10) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:53:11] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:53:12] [INFO ] Implicit Places using invariants in 1039 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:53:12] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:53:15] [INFO ] Implicit Places using invariants and state equation in 3257 ms returned []
Implicit Place search using SMT with State Equation took 4309 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:53:15] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:53:17] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3062 places, 2802/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3062 places, 2802/2812 transitions.
Stuttering acceptance computed with spot in 474 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, p2, (AND p1 p0 p2), p2, true, (AND p0 p2 p1), (AND p0 p2), (AND p0 p2), (AND p0 p1 p2), (AND p0 p2), p0, (AND p0 p1 (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1), acceptance={} source=4 dest: 8}, { cond=(AND p0 p1), acceptance={} source=4 dest: 9}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p0 p1), acceptance={} source=7 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(AND p0 p1 p2), acceptance={} source=10 dest: 12}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=10 dest: 13}], [{ cond=(AND p0 p2), acceptance={} source=11 dest: 12}], [{ cond=p0, acceptance={0} source=12 dest: 12}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=13 dest: 13}]], initial=0, aps=[p3:(EQ s2800 0), p1:(EQ s1917 1), p0:(EQ s2800 1), p2:(EQ s1452 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Product exploration explored 100000 steps with 50000 reset in 878 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3052 stabilizing places and 599/2802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 14 states, 26 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-14 finished in 8965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(F(G((F(X(p1))||p0)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G((X((G(p0) U p1))||p2))))))'
Found a SL insensitive property : ShieldPPPs-PT-050B-LTLFireability-07
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 2 out of 3062 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3062/3062 places, 2812/2812 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3061 transition count 2461
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2711 transition count 2461
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2711 transition count 2211
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2461 transition count 2211
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1209 place count 2452 transition count 2202
Iterating global reduction 2 with 9 rules applied. Total rules applied 1218 place count 2452 transition count 2202
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1218 place count 2452 transition count 2197
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1228 place count 2447 transition count 2197
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3012 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3014 place count 1553 transition count 1303
Applied a total of 3014 rules in 476 ms. Remains 1553 /3062 variables (removed 1509) and now considering 1303/2812 (removed 1509) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:20] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:53:21] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:21] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:53:22] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:22] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:53:23] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1553/3062 places, 1303/2812 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/3062 places, 1303/2812 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s10 0), p1:(OR (NEQ s438 1) (EQ s10 1)), p0:(EQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 974 ms.
Product exploration explored 100000 steps with 31 reset in 1180 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 648 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:27] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:53:27] [INFO ] [Real]Absence check using 551 positive place invariants in 80 ms returned sat
[2022-05-20 00:53:27] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-20 00:53:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 75 ms returned sat
[2022-05-20 00:53:27] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 810 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 48 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:28] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:53:29] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:29] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:53:31] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:31] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:53:31] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1), true, (X (X p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 3255 steps, including 0 resets, run visited all 2 properties in 32 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p2 p1), true, (X (X p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 32 reset in 961 ms.
Product exploration explored 100000 steps with 32 reset in 1171 ms.
Built C files in :
/tmp/ltsmin8004139675300487403
[2022-05-20 00:53:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8004139675300487403
Running compilation step : cd /tmp/ltsmin8004139675300487403;'/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 2412 ms.
Running link step : cd /tmp/ltsmin8004139675300487403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8004139675300487403;'/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/stateBased5901092217901363772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:49] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:53:50] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:50] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:53:52] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:53:52] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:53:52] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin14810360673974257245
[2022-05-20 00:53:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14810360673974257245
Running compilation step : cd /tmp/ltsmin14810360673974257245;'/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 2413 ms.
Running link step : cd /tmp/ltsmin14810360673974257245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14810360673974257245;'/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/stateBased14730427801282048253.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 00:54:07] [INFO ] Flatten gal took : 38 ms
[2022-05-20 00:54:07] [INFO ] Flatten gal took : 40 ms
[2022-05-20 00:54:07] [INFO ] Time to serialize gal into /tmp/LTL15133856412522160598.gal : 3 ms
[2022-05-20 00:54:07] [INFO ] Time to serialize properties into /tmp/LTL18071828509593106412.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/LTL15133856412522160598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18071828509593106412.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/LTL1513385...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G((X((G("(p72==1)"))U("((p990!=1)||(p72==1))")))||("(p72==0)")))))))
Formula 0 simplified : !XGFG("(p72==0)" | X(G"(p72==1)" U "((p990!=1)||(p72==1))"))
Detected timeout of ITS tools.
[2022-05-20 00:54:23] [INFO ] Flatten gal took : 39 ms
[2022-05-20 00:54:23] [INFO ] Applying decomposition
[2022-05-20 00:54:23] [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/graph10168173830350310041.txt' '-o' '/tmp/graph10168173830350310041.bin' '-w' '/tmp/graph10168173830350310041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10168173830350310041.bin' '-l' '-1' '-v' '-w' '/tmp/graph10168173830350310041.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:54:23] [INFO ] Decomposing Gal with order
[2022-05-20 00:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:54:23] [INFO ] Removed a total of 301 redundant transitions.
[2022-05-20 00:54:23] [INFO ] Flatten gal took : 73 ms
[2022-05-20 00:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 8 ms.
[2022-05-20 00:54:23] [INFO ] Time to serialize gal into /tmp/LTL5775786601958250745.gal : 7 ms
[2022-05-20 00:54:23] [INFO ] Time to serialize properties into /tmp/LTL18225326510366147572.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/LTL5775786601958250745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18225326510366147572.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/LTL5775786...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G((X((G("(i0.u4.p72==1)"))U("((i13.u156.p990!=1)||(i0.u4.p72==1))")))||("(i0.u4.p72==0)")))))))
Formula 0 simplified : !XGFG("(i0.u4.p72==0)" | X(G"(i0.u4.p72==1)" U "((i13.u156.p990!=1)||(i0.u4.p72==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10347926644253034948
[2022-05-20 00:54:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10347926644253034948
Running compilation step : cd /tmp/ltsmin10347926644253034948;'/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 2505 ms.
Running link step : cd /tmp/ltsmin10347926644253034948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10347926644253034948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>([]((X(([]((LTLAPp0==true)) U (LTLAPp1==true)))||(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-07 finished in 93482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(X(G(p0)))) U X(p0)))'
[2022-05-20 00:54:53] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10493197495347271579
[2022-05-20 00:54:53] [INFO ] Too many transitions (2812) to apply POR reductions. Disabling POR matrices.
[2022-05-20 00:54:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10493197495347271579
Running compilation step : cd /tmp/ltsmin10493197495347271579;'/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-20 00:54:53] [INFO ] Applying decomposition
[2022-05-20 00:54:53] [INFO ] Flatten gal took : 71 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/graph11514752662880978244.txt' '-o' '/tmp/graph11514752662880978244.bin' '-w' '/tmp/graph11514752662880978244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11514752662880978244.bin' '-l' '-1' '-v' '-w' '/tmp/graph11514752662880978244.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:54:54] [INFO ] Decomposing Gal with order
[2022-05-20 00:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:54:54] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:54:54] [INFO ] Flatten gal took : 120 ms
[2022-05-20 00:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 00:54:54] [INFO ] Time to serialize gal into /tmp/LTLFireability6673624498221682668.gal : 29 ms
[2022-05-20 00:54:54] [INFO ] Time to serialize properties into /tmp/LTLFireability3533802446252070199.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/LTLFireability6673624498221682668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3533802446252070199.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...267
Read 3 LTL properties
Checking formula 0 : !((F(X(X(G(X(F(G(((F(X("((i4.u151.p418==1)&&(i4.u158.p441==1))")))||("(i5.u178.p495==1)"))||("((i29.u751.p2138==1)&&(i29.u769.p2188==1...168
Formula 0 simplified : !FXXGXFG("((i29.u751.p2138==1)&&(i29.u769.p2188==1))" | "(i5.u178.p495==1)" | FX"((i4.u151.p418==1)&&(i4.u158.p441==1))")
Compilation finished in 6540 ms.
Running link step : cd /tmp/ltsmin10493197495347271579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10493197495347271579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X([](X(<>([]((<>(X((LTLAPp1==true)))||(LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10493197495347271579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X([](X(<>([]((<>(X((LTLAPp1==true)))||(LTLAPp0==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10493197495347271579;'/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(([]((LTLAPp2==true)) U (LTLAPp3==true)))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 01:18:45] [INFO ] Applying decomposition
[2022-05-20 01:18:45] [INFO ] Flatten gal took : 144 ms
[2022-05-20 01:18:45] [INFO ] Decomposing Gal with order
[2022-05-20 01:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:18:46] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 01:18:46] [INFO ] Flatten gal took : 366 ms
[2022-05-20 01:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 73 ms.
[2022-05-20 01:18:48] [INFO ] Time to serialize gal into /tmp/LTLFireability5258723287399599102.gal : 109 ms
[2022-05-20 01:18:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5655404771493136362.ltl : 7 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/LTLFireability5258723287399599102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5655404771493136362.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...267
Read 3 LTL properties
Checking formula 0 : !((F(X(X(G(X(F(G(((F(X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....712
Formula 0 simplified : !FXXGXFG("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u709.p2138==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i...688
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10493197495347271579;'/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(([]((LTLAPp2==true)) U (LTLAPp3==true)))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10493197495347271579;'/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([]((LTLAPp5==true))))) U X((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 01:42:53] [INFO ] Flatten gal took : 482 ms
[2022-05-20 01:42:57] [INFO ] Input system was already deterministic with 2812 transitions.
[2022-05-20 01:42:57] [INFO ] Transformed 3062 places.
[2022-05-20 01:42:57] [INFO ] Transformed 2812 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-20 01:42:59] [INFO ] Time to serialize gal into /tmp/LTLFireability2541164807347505417.gal : 24 ms
[2022-05-20 01:42:59] [INFO ] Time to serialize properties into /tmp/LTLFireability14342293088030374697.ltl : 2 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/LTLFireability2541164807347505417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14342293088030374697.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...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(X(G(X(F(G(((F(X("((p418==1)&&(p441==1))")))||("(p495==1)"))||("((p2138==1)&&(p2188==1))"))))))))))
Formula 0 simplified : !FXXGXFG("((p2138==1)&&(p2188==1))" | "(p495==1)" | FX"((p418==1)&&(p441==1))")
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="ShieldPPPs-PT-050B"
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 ShieldPPPs-PT-050B, 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 r222-tall-165286025300508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B 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 ;