About the Execution of ITS-Tools for ShieldRVs-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16212.352 | 3600000.00 | 5645087.00 | 33491.90 | ??FFFFFFFFTFFTTT | 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-165286025800804.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 ShieldRVs-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800804
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 6.8K Apr 30 06:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 06:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 06:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 06:53 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.8K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 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 127K 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 ShieldRVs-PT-020A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653050293656
Running Version 202205111006
[2022-05-20 12:38:14] [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 12:38:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:38:15] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-05-20 12:38:15] [INFO ] Transformed 283 places.
[2022-05-20 12:38:15] [INFO ] Transformed 383 transitions.
[2022-05-20 12:38:15] [INFO ] Found NUPN structural information;
[2022-05-20 12:38:15] [INFO ] Parsed PT model containing 283 places and 383 transitions in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-020A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 28 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:15] [INFO ] Computed 81 place invariants in 17 ms
[2022-05-20 12:38:15] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:15] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 12:38:15] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:15] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:38:16] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Support contains 74 out of 283 places after structural reductions.
[2022-05-20 12:38:16] [INFO ] Flatten gal took : 92 ms
[2022-05-20 12:38:16] [INFO ] Flatten gal took : 42 ms
[2022-05-20 12:38:16] [INFO ] Input system was already deterministic with 383 transitions.
Finished random walk after 5673 steps, including 20 resets, run visited all 31 properties in 291 ms. (steps per millisecond=19 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((p0||(X(p1)&&p2)))))))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 21 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:17] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 12:38:17] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:17] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:38:17] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:17] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:38:18] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s272 1) (EQ s273 1) (EQ s277 1)), p2:(OR (EQ s272 0) (EQ s273 0) (EQ s277 0)), p1:(OR (EQ s250 0) (EQ s254 0) (EQ s261 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 362 reset in 513 ms.
Product exploration explored 100000 steps with 361 reset in 519 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) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 612 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:20] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:38:20] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 16 factoid took 740 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 11 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:21] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:38:21] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:21] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:38:21] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:21] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:38:21] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 453 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 296 steps, including 1 resets, run visited all 5 properties in 6 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 585 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 362 reset in 359 ms.
Product exploration explored 100000 steps with 363 reset in 375 ms.
Built C files in :
/tmp/ltsmin15597495937288897341
[2022-05-20 12:38:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15597495937288897341
Running compilation step : cd /tmp/ltsmin15597495937288897341;'/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 709 ms.
Running link step : cd /tmp/ltsmin15597495937288897341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15597495937288897341;'/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/stateBased10152356436141373974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:39] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:38:39] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:39] [INFO ] Computed 81 place invariants in 10 ms
[2022-05-20 12:38:39] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:38:39] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:38:39] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Built C files in :
/tmp/ltsmin16977134052062579439
[2022-05-20 12:38:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16977134052062579439
Running compilation step : cd /tmp/ltsmin16977134052062579439;'/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 617 ms.
Running link step : cd /tmp/ltsmin16977134052062579439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16977134052062579439;'/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/stateBased5856864929696389207.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:38:55] [INFO ] Flatten gal took : 32 ms
[2022-05-20 12:38:55] [INFO ] Flatten gal took : 31 ms
[2022-05-20 12:38:55] [INFO ] Time to serialize gal into /tmp/LTL13893121445981210900.gal : 6 ms
[2022-05-20 12:38:55] [INFO ] Time to serialize properties into /tmp/LTL1373844006108791994.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/LTL13893121445981210900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1373844006108791994.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/LTL1389312...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(("(((p272==1)&&(p273==1))&&(p277==1))")||((X("(((p250==0)||(p254==0))||(p261==0))"))&&("(((p272==0)||(p273==0))||(p277==0))...164
Formula 0 simplified : !XFGX("(((p272==1)&&(p273==1))&&(p277==1))" | ("(((p272==0)||(p273==0))||(p277==0))" & X"(((p250==0)||(p254==0))||(p261==0))"))
Detected timeout of ITS tools.
[2022-05-20 12:39:10] [INFO ] Flatten gal took : 28 ms
[2022-05-20 12:39:10] [INFO ] Applying decomposition
[2022-05-20 12:39:10] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5357088640013578847.txt' '-o' '/tmp/graph5357088640013578847.bin' '-w' '/tmp/graph5357088640013578847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5357088640013578847.bin' '-l' '-1' '-v' '-w' '/tmp/graph5357088640013578847.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:39:10] [INFO ] Decomposing Gal with order
[2022-05-20 12:39:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:39:10] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 12:39:10] [INFO ] Flatten gal took : 81 ms
[2022-05-20 12:39:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 25 ms.
[2022-05-20 12:39:10] [INFO ] Time to serialize gal into /tmp/LTL2040761000583772062.gal : 6 ms
[2022-05-20 12:39:10] [INFO ] Time to serialize properties into /tmp/LTL15831216941128004807.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/LTL2040761000583772062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15831216941128004807.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/LTL2040761...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(("(((i11.i1.u77.p272==1)&&(i11.i1.u78.p273==1))&&(i11.i1.u79.p277==1))")||((X("(((i10.i1.u71.p250==0)||(i10.i1.u72.p254==0)...263
Formula 0 simplified : !XFGX("(((i11.i1.u77.p272==1)&&(i11.i1.u78.p273==1))&&(i11.i1.u79.p277==1))" | ("(((i11.i1.u77.p272==0)||(i11.i1.u78.p273==0))||(i11...249
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17964170137556499310
[2022-05-20 12:39:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17964170137556499310
Running compilation step : cd /tmp/ltsmin17964170137556499310;'/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 616 ms.
Running link step : cd /tmp/ltsmin17964170137556499310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17964170137556499310;'/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)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020A-LTLFireability-00 finished in 83402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(F(p0) U (!(p1 U !p0)||p2)))))'
Support contains 7 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 33 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:39:40] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:39:40] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:39:40] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:39:41] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2022-05-20 12:39:41] [INFO ] Redundant transitions in 117 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:39:41] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:39:41] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 17 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR p0 p2), p0]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s143 1) (EQ s158 1) (EQ s169 1)), p2:(AND (EQ s159 1) (EQ s161 1) (EQ s166 1)), p1:(EQ s14 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 364 reset in 352 ms.
Product exploration explored 100000 steps with 365 reset in 378 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 p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND p0 (NOT p1)) p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 423 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR p2 p0), p0]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :3
Finished Best-First random walk after 4730 steps, including 1 resets, run visited all 2 properties in 17 ms. (steps per millisecond=278 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND p0 (NOT p1)) p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (AND (NOT p2) p0 p1)), (F (OR p2 (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 573 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[(OR p2 p0), p0]
Stuttering acceptance computed with spot in 77 ms :[(OR p2 p0), p0]
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 381/381 transitions.
Applied a total of 0 rules in 25 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:39:43] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:39:44] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:39:44] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:39:44] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2022-05-20 12:39:44] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:39:44] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 12:39:44] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 381/381 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 p2) (NOT p0) (NOT p1)), (X (NOT (OR p2 (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (OR p2 (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(OR p2 p0), p0]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :2
Finished Best-First random walk after 2427 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=269 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR p2 (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (OR p2 (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (AND (NOT p2) p0 p1)), (F (OR p2 (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 520 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 81 ms :[(OR p2 p0), p0]
Stuttering acceptance computed with spot in 79 ms :[(OR p2 p0), p0]
Stuttering acceptance computed with spot in 98 ms :[(OR p2 p0), p0]
Product exploration explored 100000 steps with 364 reset in 339 ms.
Product exploration explored 100000 steps with 365 reset in 367 ms.
Built C files in :
/tmp/ltsmin2595735851054587370
[2022-05-20 12:39:46] [INFO ] Computing symmetric may disable matrix : 381 transitions.
[2022-05-20 12:39:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:39:46] [INFO ] Computing symmetric may enable matrix : 381 transitions.
[2022-05-20 12:39:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:39:46] [INFO ] Computing Do-Not-Accords matrix : 381 transitions.
[2022-05-20 12:39:46] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:39:46] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2595735851054587370
Running compilation step : cd /tmp/ltsmin2595735851054587370;'/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 813 ms.
Running link step : cd /tmp/ltsmin2595735851054587370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2595735851054587370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased963433346249911068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 381/381 transitions.
Applied a total of 0 rules in 19 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:40:01] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:40:02] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:40:02] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:40:02] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2022-05-20 12:40:02] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:40:02] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 12:40:02] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 381/381 transitions.
Built C files in :
/tmp/ltsmin18242792287540442574
[2022-05-20 12:40:02] [INFO ] Computing symmetric may disable matrix : 381 transitions.
[2022-05-20 12:40:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:40:02] [INFO ] Computing symmetric may enable matrix : 381 transitions.
[2022-05-20 12:40:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:40:02] [INFO ] Computing Do-Not-Accords matrix : 381 transitions.
[2022-05-20 12:40:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:40:02] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18242792287540442574
Running compilation step : cd /tmp/ltsmin18242792287540442574;'/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 788 ms.
Running link step : cd /tmp/ltsmin18242792287540442574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18242792287540442574;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7174856312847876099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:40:17] [INFO ] Flatten gal took : 22 ms
[2022-05-20 12:40:17] [INFO ] Flatten gal took : 20 ms
[2022-05-20 12:40:17] [INFO ] Time to serialize gal into /tmp/LTL12598303346337584351.gal : 3 ms
[2022-05-20 12:40:17] [INFO ] Time to serialize properties into /tmp/LTL15160557992636030189.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/LTL12598303346337584351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15160557992636030189.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/LTL1259830...268
Read 1 LTL properties
Checking formula 0 : !((F(G(!((F("(((p143==1)&&(p158==1))&&(p169==1))"))U((!(("(p14==1)")U(!("(((p143==1)&&(p158==1))&&(p169==1))"))))||("(((p159==1)&&(p16...181
Formula 0 simplified : !FG!(F"(((p143==1)&&(p158==1))&&(p169==1))" U ("(((p159==1)&&(p161==1))&&(p166==1))" | !("(p14==1)" U !"(((p143==1)&&(p158==1))&&(p1...166
Detected timeout of ITS tools.
[2022-05-20 12:40:32] [INFO ] Flatten gal took : 23 ms
[2022-05-20 12:40:32] [INFO ] Applying decomposition
[2022-05-20 12:40:32] [INFO ] Flatten gal took : 18 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/graph16514260682081189164.txt' '-o' '/tmp/graph16514260682081189164.bin' '-w' '/tmp/graph16514260682081189164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16514260682081189164.bin' '-l' '-1' '-v' '-w' '/tmp/graph16514260682081189164.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:40:32] [INFO ] Decomposing Gal with order
[2022-05-20 12:40:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:40:33] [INFO ] Removed a total of 415 redundant transitions.
[2022-05-20 12:40:33] [INFO ] Flatten gal took : 39 ms
[2022-05-20 12:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 14 ms.
[2022-05-20 12:40:33] [INFO ] Time to serialize gal into /tmp/LTL1496474763138624887.gal : 3 ms
[2022-05-20 12:40:33] [INFO ] Time to serialize properties into /tmp/LTL9128109099269899656.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/LTL1496474763138624887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9128109099269899656.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/LTL1496474...245
Read 1 LTL properties
Checking formula 0 : !((F(G(!((F("(((i5.i1.u41.p143==1)&&(i6.u45.p158==1))&&(i6.u48.p169==1))"))U((!(("(i0.i0.u4.p14==1)")U(!("(((i5.i1.u41.p143==1)&&(i6.u...259
Formula 0 simplified : !FG!(F"(((i5.i1.u41.p143==1)&&(i6.u45.p158==1))&&(i6.u48.p169==1))" U ("(((i6.u45.p159==1)&&(i6.u46.p161==1))&&(i6.u47.p166==1))" | ...244
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin227236053001895706
[2022-05-20 12:40:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin227236053001895706
Running compilation step : cd /tmp/ltsmin227236053001895706;'/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 869 ms.
Running link step : cd /tmp/ltsmin227236053001895706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin227236053001895706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](!(<>((LTLAPp0==true)) U (!((LTLAPp1==true) U !(LTLAPp0==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020A-LTLFireability-01 finished in 82566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 8 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 19 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:41:03] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:03] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:41:03] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:03] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2022-05-20 12:41:03] [INFO ] Redundant transitions in 82 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:41:03] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:41:03] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 14 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s138 1) (EQ s142 1) (EQ s149 1) (EQ s131 1) (EQ s133 1)), p1:(AND (EQ s213 1) (EQ s230 1) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 269 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-02 finished in 874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(p0))&&(G(p1)||X(p2))))'
Support contains 9 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:04] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:41:04] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:04] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:04] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:04] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:04] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s7 1) (EQ s11 1)), p1:(AND (EQ s185 1) (EQ s202 1) (EQ s212 1)), p2:(AND (EQ s80 1) (EQ s86 1) (EQ s93 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 528 steps with 1 reset in 5 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-03 finished in 887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(G(F(p1)))))'
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:05] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:05] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:05] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:05] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s187 0) (EQ s189 0) (EQ s194 0)) (EQ s221 0)), p1:(EQ s280 0)], 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]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-04 finished in 701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(G(F(X(p0))))&&X(p1)) U G(p2)))'
Support contains 9 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:05] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:06] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:06] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 12:41:06] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND p1 p0), (AND (NOT p2) p1 p0), p0, (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s255 1) (EQ s270 1) (EQ s282 1)), p1:(AND (EQ s202 1) (EQ s203 1) (EQ s208 1)), p0:(AND (EQ s222 1) (EQ s226 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33209 reset in 571 ms.
Product exploration explored 100000 steps with 33241 reset in 660 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND p2 p1 p0), p0, (AND p0 (NOT p2) (NOT p1))]
Finished random walk after 1413 steps, including 5 resets, run visited all 6 properties in 26 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 12 factoid took 573 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (AND p2 p1 p0), p0, (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND p2 p1 p0), p0, (AND p0 (NOT p2) (NOT p1))]
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:09] [INFO ] Computed 81 place invariants in 1 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 12 factoid took 263 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVs-PT-020A-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020A-LTLFireability-05 finished in 3929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:09] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:09] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:09] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 12:41:10] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:10] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s204 1) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-07 finished in 790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))&&p1))))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 13 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:41:10] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:10] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 12:41:10] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 12:41:10] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2022-05-20 12:41:10] [INFO ] Redundant transitions in 72 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 12:41:10] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:11] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s229 1) (EQ s231 1) (EQ s235 1)), p1:(OR (EQ s6 0) (EQ s7 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 291 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-08 finished in 1034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)||!p1)) U !X(p2))||G(p3)))'
Support contains 10 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:11] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:11] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:11] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:11] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:11] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:12] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 593 ms :[(AND p2 (NOT p3)), p2, (AND p1 (NOT p0) p2), p2, (AND p1 (NOT p0) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3) p2), true, (NOT p0), (AND (NOT p0) p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND p0 p3)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=0 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(AND p1 p0 p3), acceptance={} source=0 dest: 8}], [{ cond=p2, acceptance={} source=1 dest: 9}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 9}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 11}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND p0 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 9}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 11}, { cond=(AND p1 (NOT p0) p3 p2), acceptance={} source=4 dest: 12}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=4 dest: 13}, { cond=(AND p1 p0 p3 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p3 p2) (AND p0 p3 p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p3 p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=5 dest: 7}, { cond=(AND p1 p0 p3 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 9}, { cond=(AND p3 p2), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 9}, { cond=(AND p0 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=8 dest: 12}, { cond=(AND p0 p3 p2), acceptance={} source=8 dest: 14}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND p1 p0), acceptance={} source=11 dest: 10}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(NOT p3), acceptance={} source=12 dest: 9}, { cond=p3, acceptance={} source=12 dest: 12}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 9}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=13 dest: 11}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p1) p3), acceptance={} source=13 dest: 13}, { cond=(AND p1 p0 p3), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=14 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p0) p3), acceptance={} source=14 dest: 12}, { cond=(AND p0 p3), acceptance={} source=14 dest: 14}]], initial=0, aps=[p1:(AND (EQ s171 1) (EQ s188 1) (EQ s198 1)), p0:(AND (EQ s206 1) (EQ s212 1) (EQ s219 1)), p3:(AND (EQ s73 1) (EQ s90 1) (EQ s99 1)), p2:(EQ s89 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, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 725 ms.
Product exploration explored 100000 steps with 50000 reset in 731 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 p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND p1 p0 p3 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p3 p2))), (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p3 p2) (AND p0 p3 p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 p3 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p3 p2) (AND p0 p3 p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 59 factoid took 1557 ms. Reduced automaton from 15 states, 56 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-020A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020A-LTLFireability-10 finished in 4217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(F(p2))))'
Support contains 7 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:15] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:15] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:15] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:16] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:16] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:16] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s129 1) (EQ s144 1) (EQ s156 1)), p1:(EQ s43 1), p2:(OR (EQ s199 0) (EQ s216 0) (EQ s226 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 946 steps with 3 reset in 8 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-12 finished in 770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X((!(p1 U p2)||p3))||p0))))'
Support contains 8 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:16] [INFO ] Computed 81 place invariants in 8 ms
[2022-05-20 12:41:16] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:16] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:16] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:16] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:17] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s172 0) (AND (EQ s26 1) (EQ s30 1) (EQ s37 1))), p3:(EQ s211 0), p1:(AND (EQ s54 1) (EQ s56 1) (EQ s65 1)), p2:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Product exploration explored 100000 steps with 50000 reset in 666 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 p0 p3 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-020A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020A-LTLFireability-14 finished in 2122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(p0))))))'
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:18] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:18] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:18] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:18] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:18] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:19] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s136 0) (EQ s140 0) (EQ s149 0))], 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]]
Product exploration explored 100000 steps with 20000 reset in 387 ms.
Product exploration explored 100000 steps with 20000 reset in 415 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4365 steps, including 15 resets, run visited all 1 properties in 20 ms. (steps per millisecond=218 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:20] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:21] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:21] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 12:41:21] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:21] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:21] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished Best-First random walk after 3528 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=504 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 379 ms.
Product exploration explored 100000 steps with 20000 reset in 405 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 40 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2022-05-20 12:41:23] [INFO ] Redundant transitions in 71 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 12:41:23] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:23] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/283 places, 382/383 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 11 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/283 places, 382/383 transitions.
Product exploration explored 100000 steps with 20000 reset in 1248 ms.
Product exploration explored 100000 steps with 20000 reset in 1244 ms.
Built C files in :
/tmp/ltsmin7563910449731366354
[2022-05-20 12:41:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7563910449731366354
Running compilation step : cd /tmp/ltsmin7563910449731366354;'/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 610 ms.
Running link step : cd /tmp/ltsmin7563910449731366354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7563910449731366354;'/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/stateBased11105949055662926218.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-020A-LTLFireability-15 finished in 8657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((p0||(X(p1)&&p2)))))))'
Found a SL insensitive property : ShieldRVs-PT-020A-LTLFireability-00
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 11 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:27] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 12:41:27] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:27] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:27] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:27] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:27] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s272 1) (EQ s273 1) (EQ s277 1)), p2:(OR (EQ s272 0) (EQ s273 0) (EQ s277 0)), p1:(OR (EQ s250 0) (EQ s254 0) (EQ s261 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 361 reset in 369 ms.
Product exploration explored 100000 steps with 361 reset in 418 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) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 521 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:29] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:29] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 16 factoid took 671 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:30] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:30] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:30] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:30] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:30] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:30] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 413 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 607 steps, including 2 resets, run visited all 5 properties in 6 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 482 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 361 reset in 349 ms.
Product exploration explored 100000 steps with 361 reset in 377 ms.
Built C files in :
/tmp/ltsmin11762937390713258626
[2022-05-20 12:41:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11762937390713258626
Running compilation step : cd /tmp/ltsmin11762937390713258626;'/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 624 ms.
Running link step : cd /tmp/ltsmin11762937390713258626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11762937390713258626;'/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/stateBased6629526567059928284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:48] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 12:41:48] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:48] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:48] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 12:41:48] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 12:41:48] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 383/383 transitions.
Built C files in :
/tmp/ltsmin17240103162504535594
[2022-05-20 12:41:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17240103162504535594
Running compilation step : cd /tmp/ltsmin17240103162504535594;'/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 647 ms.
Running link step : cd /tmp/ltsmin17240103162504535594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17240103162504535594;'/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/stateBased8336261749433623140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:42:03] [INFO ] Flatten gal took : 24 ms
[2022-05-20 12:42:03] [INFO ] Flatten gal took : 17 ms
[2022-05-20 12:42:03] [INFO ] Time to serialize gal into /tmp/LTL8851830964050636790.gal : 2 ms
[2022-05-20 12:42:03] [INFO ] Time to serialize properties into /tmp/LTL3864558741919790558.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/LTL8851830964050636790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3864558741919790558.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/LTL8851830...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(("(((p272==1)&&(p273==1))&&(p277==1))")||((X("(((p250==0)||(p254==0))||(p261==0))"))&&("(((p272==0)||(p273==0))||(p277==0))...164
Formula 0 simplified : !XFGX("(((p272==1)&&(p273==1))&&(p277==1))" | ("(((p272==0)||(p273==0))||(p277==0))" & X"(((p250==0)||(p254==0))||(p261==0))"))
Detected timeout of ITS tools.
[2022-05-20 12:42:18] [INFO ] Flatten gal took : 21 ms
[2022-05-20 12:42:18] [INFO ] Applying decomposition
[2022-05-20 12:42:18] [INFO ] Flatten gal took : 18 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/graph13004413734361559783.txt' '-o' '/tmp/graph13004413734361559783.bin' '-w' '/tmp/graph13004413734361559783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13004413734361559783.bin' '-l' '-1' '-v' '-w' '/tmp/graph13004413734361559783.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:42:18] [INFO ] Decomposing Gal with order
[2022-05-20 12:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:42:19] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 12:42:19] [INFO ] Flatten gal took : 29 ms
[2022-05-20 12:42:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 8 ms.
[2022-05-20 12:42:19] [INFO ] Time to serialize gal into /tmp/LTL11401433279216535468.gal : 3 ms
[2022-05-20 12:42:19] [INFO ] Time to serialize properties into /tmp/LTL3822253526155311408.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/LTL11401433279216535468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3822253526155311408.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/LTL1140143...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(("(((i11.u77.p272==1)&&(i11.u78.p273==1))&&(i11.u79.p277==1))")||((X("(((i10.i0.u71.p250==0)||(i10.i0.u72.p254==0))||(i10.i...245
Formula 0 simplified : !XFGX("(((i11.u77.p272==1)&&(i11.u78.p273==1))&&(i11.u79.p277==1))" | ("(((i11.u77.p272==0)||(i11.u78.p273==0))||(i11.u79.p277==0))"...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14297182816350254340
[2022-05-20 12:42:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14297182816350254340
Running compilation step : cd /tmp/ltsmin14297182816350254340;'/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 654 ms.
Running link step : cd /tmp/ltsmin14297182816350254340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14297182816350254340;'/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)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020A-LTLFireability-00 finished in 81989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(F(p0) U (!(p1 U !p0)||p2)))))'
[2022-05-20 12:42:49] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11178755115713104267
[2022-05-20 12:42:49] [INFO ] Computing symmetric may disable matrix : 383 transitions.
[2022-05-20 12:42:49] [INFO ] Applying decomposition
[2022-05-20 12:42:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:42:49] [INFO ] Computing symmetric may enable matrix : 383 transitions.
[2022-05-20 12:42:49] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:42:49] [INFO ] Flatten gal took : 20 ms
[2022-05-20 12:42:49] [INFO ] Computing Do-Not-Accords matrix : 383 transitions.
[2022-05-20 12:42:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:42:49] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11178755115713104267
Running compilation step : cd /tmp/ltsmin11178755115713104267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph481123193226938540.txt' '-o' '/tmp/graph481123193226938540.bin' '-w' '/tmp/graph481123193226938540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph481123193226938540.bin' '-l' '-1' '-v' '-w' '/tmp/graph481123193226938540.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:42:49] [INFO ] Decomposing Gal with order
[2022-05-20 12:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:42:49] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 12:42:49] [INFO ] Flatten gal took : 28 ms
[2022-05-20 12:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 8 ms.
[2022-05-20 12:42:49] [INFO ] Time to serialize gal into /tmp/LTLFireability8907140105244116699.gal : 3 ms
[2022-05-20 12:42:49] [INFO ] Time to serialize properties into /tmp/LTLFireability589508748810012985.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/LTLFireability8907140105244116699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability589508748810012985.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...266
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(("(((i11.u77.p272==1)&&(i11.u78.p273==1))&&(i11.u79.p277==1))")||((X("(((i10.i0.u71.p250==0)||(i10.i0.u72.p254==0))||(i10.i...245
Formula 0 simplified : !XFGX("(((i11.u77.p272==1)&&(i11.u78.p273==1))&&(i11.u79.p277==1))" | ("(((i11.u77.p272==0)||(i11.u78.p273==0))||(i11.u79.p277==0))"...231
Compilation finished in 841 ms.
Running link step : cd /tmp/ltsmin11178755115713104267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11178755115713104267;'/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)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: LTL layer: formula: X(<>([](X(((LTLAPp0==true)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))
pins2lts-mc-linux64( 7/ 8), 0.005: "X(<>([](X(((LTLAPp0==true)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: There are 390 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.045: State length is 284, there are 393 groups
pins2lts-mc-linux64( 0/ 8), 0.045: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.045: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.045: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.045: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.106: [Blue] ~120 levels ~960 states ~6048 transitions
pins2lts-mc-linux64( 0/ 8), 0.160: [Blue] ~240 levels ~1920 states ~10696 transitions
pins2lts-mc-linux64( 0/ 8), 0.199: [Blue] ~249 levels ~3840 states ~17200 transitions
pins2lts-mc-linux64( 0/ 8), 0.277: [Blue] ~265 levels ~7680 states ~30544 transitions
pins2lts-mc-linux64( 0/ 8), 0.391: [Blue] ~265 levels ~15360 states ~60640 transitions
pins2lts-mc-linux64( 6/ 8), 0.652: [Blue] ~343 levels ~30720 states ~154504 transitions
pins2lts-mc-linux64( 6/ 8), 1.072: [Blue] ~343 levels ~61440 states ~327080 transitions
pins2lts-mc-linux64( 6/ 8), 1.822: [Blue] ~343 levels ~122880 states ~657864 transitions
pins2lts-mc-linux64( 6/ 8), 3.226: [Blue] ~343 levels ~245760 states ~1340192 transitions
pins2lts-mc-linux64( 6/ 8), 5.606: [Blue] ~345 levels ~491520 states ~2772096 transitions
pins2lts-mc-linux64( 6/ 8), 9.989: [Blue] ~345 levels ~983040 states ~6026768 transitions
pins2lts-mc-linux64( 6/ 8), 18.098: [Blue] ~345 levels ~1966080 states ~12986488 transitions
pins2lts-mc-linux64( 6/ 8), 34.159: [Blue] ~346 levels ~3932160 states ~27056888 transitions
pins2lts-mc-linux64( 4/ 8), 67.038: [Blue] ~290 levels ~7864320 states ~57535328 transitions
pins2lts-mc-linux64( 4/ 8), 132.046: [Blue] ~300 levels ~15728640 states ~111849040 transitions
pins2lts-mc-linux64( 4/ 8), 265.078: [Blue] ~300 levels ~31457280 states ~235109016 transitions
pins2lts-mc-linux64( 4/ 8), 536.535: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 536.563:
pins2lts-mc-linux64( 0/ 8), 536.563: Explored 58146977 states 429361909 transitions, fanout: 7.384
pins2lts-mc-linux64( 0/ 8), 536.563: Total exploration time 536.510 sec (536.480 sec minimum, 536.494 sec on average)
pins2lts-mc-linux64( 0/ 8), 536.563: States per second: 108380, Transitions per second: 800287
pins2lts-mc-linux64( 0/ 8), 536.563:
pins2lts-mc-linux64( 0/ 8), 536.563: State space has 58160747 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 536.563: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 536.563: blue states: 58146977 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 536.563: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 536.563: all-red states: 2005 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 536.563:
pins2lts-mc-linux64( 0/ 8), 536.563: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 536.563:
pins2lts-mc-linux64( 0/ 8), 536.563: Queue width: 8B, total height: 2422, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 536.563: Tree memory: 699.7MB, 12.6 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 536.563: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 536.563: Stored 519 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 536.563: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 536.563: Est. total memory use: 699.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11178755115713104267;'/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)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11178755115713104267;'/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)||(X((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 13:04:22] [INFO ] Applying decomposition
[2022-05-20 13:04:22] [INFO ] Flatten gal took : 78 ms
[2022-05-20 13:04:22] [INFO ] Decomposing Gal with order
[2022-05-20 13:04:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:04:22] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 13:04:23] [INFO ] Flatten gal took : 418 ms
[2022-05-20 13:04:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 31 ms.
[2022-05-20 13:04:23] [INFO ] Time to serialize gal into /tmp/LTLFireability1055067970249689404.gal : 377 ms
[2022-05-20 13:04:23] [INFO ] Time to serialize properties into /tmp/LTLFireability14335582211290502065.ltl : 13 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/LTLFireability1055067970249689404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14335582211290502065.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(("(((u78.p272==1)&&(u79.p273==1))&&(u80.p277==1))")||((X("(((u72.p250==0)||(u73.p254==0))||(u76.p261==0))"))&&("(((u78.p272...200
Formula 0 simplified : !XFGX("(((u78.p272==1)&&(u79.p273==1))&&(u80.p277==1))" | ("(((u78.p272==0)||(u79.p273==0))||(u80.p277==0))" & X"(((u72.p250==0)||(u...186
Reverse transition relation is NOT exact ! Due to transitions t122, t129, t131, t135, t139, t145, t146, t153, t156, t159, t163, t168, t173, t177, t179, t18...1610
Computing Next relation with stutter on 9.50317e+14 deadlock states
Detected timeout of ITS tools.
[2022-05-20 13:25:55] [INFO ] Flatten gal took : 42 ms
[2022-05-20 13:25:55] [INFO ] Input system was already deterministic with 383 transitions.
[2022-05-20 13:25:55] [INFO ] Transformed 283 places.
[2022-05-20 13:25:55] [INFO ] Transformed 383 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 13:25:55] [INFO ] Time to serialize gal into /tmp/LTLFireability18370378440334920086.gal : 4 ms
[2022-05-20 13:25:55] [INFO ] Time to serialize properties into /tmp/LTLFireability9156438783168318097.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/LTLFireability18370378440334920086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9156438783168318097.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(X(("(((p272==1)&&(p273==1))&&(p277==1))")||((X("(((p250==0)||(p254==0))||(p261==0))"))&&("(((p272==0)||(p273==0))||(p277==0))...164
Formula 0 simplified : !XFGX("(((p272==1)&&(p273==1))&&(p277==1))" | ("(((p272==0)||(p273==0))||(p277==0))" & X"(((p250==0)||(p254==0))||(p261==0))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1858
Computing Next relation with stutter on 9.50317e+14 deadlock states
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldRVs-PT-020A"
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 ShieldRVs-PT-020A, 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-165286025800804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020A.tgz
mv ShieldRVs-PT-020A 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 ;