About the Execution of ITS-Tools for ShieldIIPt-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11691.063 | 1144790.00 | 2218994.00 | 12293.90 | TFFFTFTFTFFFFFTF | 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-165286025000307.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 ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 18:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 212K 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 ShieldIIPt-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652961695849
Running Version 202205111006
[2022-05-19 12:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 12:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:01:37] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-05-19 12:01:37] [INFO ] Transformed 763 places.
[2022-05-19 12:01:37] [INFO ] Transformed 563 transitions.
[2022-05-19 12:01:37] [INFO ] Found NUPN structural information;
[2022-05-19 12:01:37] [INFO ] Parsed PT model containing 763 places and 563 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 65 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:01:37] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:01:38] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:01:38] [INFO ] Computed 361 place invariants in 14 ms
[2022-05-19 12:01:39] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:01:39] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 12:01:40] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Support contains 39 out of 763 places after structural reductions.
[2022-05-19 12:01:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 12:01:40] [INFO ] Flatten gal took : 164 ms
FORMULA ShieldIIPt-PT-040A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 12:01:40] [INFO ] Flatten gal took : 67 ms
[2022-05-19 12:01:40] [INFO ] Input system was already deterministic with 562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 23) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:01:42] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:01:42] [INFO ] [Real]Absence check using 361 positive place invariants in 53 ms returned sat
[2022-05-19 12:01:43] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-19 12:01:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2022-05-19 12:01:45] [INFO ] After 1854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-19 12:01:46] [INFO ] After 2764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 904 ms.
[2022-05-19 12:01:47] [INFO ] After 4189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 966 ms.
Support contains 23 out of 763 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 74 times.
Drop transitions removed 74 transitions
Iterating global reduction 0 with 74 rules applied. Total rules applied 78 place count 761 transition count 560
Applied a total of 78 rules in 330 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 120868 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 9=1, 10=1, 11=1, 12=1}
Probabilistic random walk after 120868 steps, saw 117256 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :10
Running SMT prover for 3 properties.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:01:53] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 12:01:53] [INFO ] [Real]Absence check using 361 positive place invariants in 46 ms returned sat
[2022-05-19 12:01:53] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:01:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2022-05-19 12:01:54] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:01:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-19 12:01:54] [INFO ] After 169ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:01:54] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-19 12:01:54] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 761 transition count 560
Applied a total of 5 rules in 44 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 158130 steps, run timeout after 3006 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158130 steps, saw 152335 distinct states, run finished after 3008 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:01:58] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:01:58] [INFO ] [Real]Absence check using 361 positive place invariants in 51 ms returned sat
[2022-05-19 12:01:58] [INFO ] After 289ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-19 12:01:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-19 12:01:58] [INFO ] After 42ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:01:58] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:01:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 56 ms returned sat
[2022-05-19 12:01:59] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:01:59] [INFO ] After 194ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:01:59] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-05-19 12:01:59] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 39 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 560/560 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 24 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:01:59] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:02:00] [INFO ] Implicit Places using invariants in 428 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 436 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 759/761 places, 560/560 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 27 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2022-05-19 12:02:00] [INFO ] Computed 359 place invariants in 5 ms
[2022-05-19 12:02:00] [INFO ] Implicit Places using invariants in 422 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/761 places, 559/560 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 69 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:00] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:02:01] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:01] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:02:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-19 12:02:02] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 756/761 places, 558/560 transitions.
Finished structural reductions, in 3 iterations. Remains : 756/761 places, 558/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 165167 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165167 steps, saw 159211 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:05] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:02:05] [INFO ] [Real]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:02:06] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:02:06] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:02:06] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:02:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-19 12:02:06] [INFO ] After 251ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:02:07] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 272 ms.
[2022-05-19 12:02:07] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 155 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 45 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 35 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:07] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:02:07] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:07] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:02:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-19 12:02:08] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2022-05-19 12:02:08] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:02:08] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:02:09] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 756 transition count 558
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 756 transition count 519
Applied a total of 78 rules in 64 ms. Remains 756 /756 variables (removed 0) and now considering 519/558 (removed 39) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 519 rows 756 cols
[2022-05-19 12:02:09] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:02:09] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2022-05-19 12:02:09] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:02:10] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-19 12:02:10] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:02:10] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 193 ms.
[2022-05-19 12:02:10] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:02:10] [INFO ] Flatten gal took : 44 ms
[2022-05-19 12:02:10] [INFO ] Flatten gal took : 43 ms
[2022-05-19 12:02:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9959541279156507745.gal : 20 ms
[2022-05-19 12:02:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18436250983888271948.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1289977817670649201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9959541279156507745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18436250983888271948.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18436250983888271948.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :3 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 53
Reachability property AtomicPropp18 is true.
Reachability property AtomicPropp17 is true.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :102 after 180
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :180 after 4534
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4534 after 38904
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38904 after 265613
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :265613 after 7.19343e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.19343e+07 after 3.88616e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.88616e+10 after 6.62522e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.62522e+13 after 1.02225e+17
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.02225e+17 after 1.44068e+25
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.44068e+25 after 3.97668e+33
Detected timeout of ITS tools.
[2022-05-19 12:02:26] [INFO ] Flatten gal took : 36 ms
[2022-05-19 12:02:26] [INFO ] Applying decomposition
[2022-05-19 12:02:26] [INFO ] Flatten gal took : 36 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/graph10848346897595501720.txt' '-o' '/tmp/graph10848346897595501720.bin' '-w' '/tmp/graph10848346897595501720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10848346897595501720.bin' '-l' '-1' '-v' '-w' '/tmp/graph10848346897595501720.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:02:26] [INFO ] Decomposing Gal with order
[2022-05-19 12:02:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:02:26] [INFO ] Removed a total of 156 redundant transitions.
[2022-05-19 12:02:26] [INFO ] Flatten gal took : 90 ms
[2022-05-19 12:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 35 ms.
[2022-05-19 12:02:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15668221480247671469.gal : 16 ms
[2022-05-19 12:02:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16891210482313651361.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1289977817670649201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15668221480247671469.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16891210482313651361.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality16891210482313651361.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :69633 after 69633
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :69633 after 8.442e+24
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10681455594435175415
[2022-05-19 12:02:41] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10681455594435175415
Running compilation step : cd /tmp/ltsmin10681455594435175415;'/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 994 ms.
Running link step : cd /tmp/ltsmin10681455594435175415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10681455594435175415;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp9==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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(X((F(p0)||F(p1)))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:02:57] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:02:57] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:02:57] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:02:58] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:02:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:02:58] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s757 0) (EQ s55 1)), p1:(OR (EQ s689 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1818 ms.
Product exploration explored 100000 steps with 33333 reset in 1757 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) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-00 finished in 5406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1)&&G(F(!(G(p2) U !p3)))))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:02] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:03:02] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:02] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:03:03] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:03] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:03:03] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (NOT p0), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p3), (NOT p3), (AND (NOT p3) p2)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p3), acceptance={} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p3), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s545 1), p1:(OR (EQ s98 0) (EQ s597 1)), p3:(OR (EQ s213 0) (EQ s689 1)), p2:(OR (EQ s748 0) (EQ s615 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-01 finished in 1801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(X(X(p1))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 21 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:04] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:03:04] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:04] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:03:05] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:03:05] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:03:05] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 1255 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s257 0) (EQ s686 1)), p0:(OR (EQ s518 0) (EQ s704 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]]
Product exploration explored 100000 steps with 519 reset in 650 ms.
Stack based approach found an accepted trace after 588 steps with 3 reset with depth 126 and stack size 121 in 15 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-02 finished in 3368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X(F(G(X(p0))))||G(p1)))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 46 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:03:07] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:03:08] [INFO ] Implicit Places using invariants in 372 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 54 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2022-05-19 12:03:08] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:03:08] [INFO ] Implicit Places using invariants in 344 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 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 756 transition count 558
Applied a total of 2 rules in 27 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:08] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:03:08] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:08] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:03:09] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions, in 3 iterations. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s593 0) (EQ s190 1)), p0:(AND (EQ s316 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 606 ms.
Product exploration explored 100000 steps with 0 reset in 877 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 p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 228174 steps, run visited all 2 properties in 2464 ms. (steps per millisecond=92 )
Probabilistic random walk after 228174 steps, saw 225255 distinct states, run finished after 2465 ms. (steps per millisecond=92 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 19 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:14] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:03:14] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:14] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:03:15] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2022-05-19 12:03:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:15] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:03:15] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 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 p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 708 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 228174 steps, run visited all 2 properties in 2371 ms. (steps per millisecond=96 )
Probabilistic random walk after 228174 steps, saw 225255 distinct states, run finished after 2372 ms. (steps per millisecond=96 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Product exploration explored 100000 steps with 0 reset in 835 ms.
Built C files in :
/tmp/ltsmin7471183789744303183
[2022-05-19 12:03:21] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2022-05-19 12:03:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:21] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2022-05-19 12:03:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:21] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2022-05-19 12:03:21] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:21] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7471183789744303183
Running compilation step : cd /tmp/ltsmin7471183789744303183;'/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 1322 ms.
Running link step : cd /tmp/ltsmin7471183789744303183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7471183789744303183;'/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/stateBased10083559473386785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 17 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:36] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:03:36] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:36] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:03:37] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2022-05-19 12:03:37] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:03:37] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:03:38] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin5457001951292062820
[2022-05-19 12:03:38] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2022-05-19 12:03:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:38] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2022-05-19 12:03:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:38] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2022-05-19 12:03:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:03:38] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5457001951292062820
Running compilation step : cd /tmp/ltsmin5457001951292062820;'/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 1282 ms.
Running link step : cd /tmp/ltsmin5457001951292062820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5457001951292062820;'/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/stateBased9684919965150495420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:03:53] [INFO ] Flatten gal took : 31 ms
[2022-05-19 12:03:53] [INFO ] Flatten gal took : 29 ms
[2022-05-19 12:03:53] [INFO ] Time to serialize gal into /tmp/LTL18215402183327269177.gal : 4 ms
[2022-05-19 12:03:53] [INFO ] Time to serialize properties into /tmp/LTL430712859675738868.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/LTL18215402183327269177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL430712859675738868.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/LTL1821540...266
Read 1 LTL properties
Checking formula 0 : !((G(G((X(F(G(X("((p316==0)&&(p32==1))")))))||(G("((p593==0)||(p190==1))"))))))
Formula 0 simplified : !G(XFGX"((p316==0)&&(p32==1))" | G"((p593==0)||(p190==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
618 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.26681,138652,1,0,10,661179,23,1,19214,318871,35
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-03 finished in 52493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(p0))||X(p1)))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:04:00] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:04:00] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:04:00] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:04:01] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:04:01] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:04:01] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s152 1), p0:(EQ s431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1621 ms.
Product exploration explored 100000 steps with 33333 reset in 1731 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)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-04 finished in 5080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(p0)))||F(G((X(p0)||p1))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 40 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:04:05] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:04:05] [INFO ] Implicit Places using invariants in 405 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 17 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2022-05-19 12:04:05] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:04:06] [INFO ] Implicit Places using invariants in 387 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 25 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:06] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:06] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:06] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:07] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions, in 3 iterations. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s253 0) (EQ s24 1)), p0:(OR (EQ s23 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 0 reset in 817 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1507 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 337415 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{1=1}
Probabilistic random walk after 337415 steps, saw 333286 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:13] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:04:13] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-05-19 12:04:14] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:04:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:04:14] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:04:14] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 12:04:14] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 756 transition count 558
Applied a total of 78 rules in 39 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Finished probabilistic random walk after 75487 steps, run visited all 1 properties in 584 ms. (steps per millisecond=129 )
Probabilistic random walk after 75487 steps, saw 73041 distinct states, run finished after 585 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 20 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:16] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:04:16] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:16] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:04:17] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2022-05-19 12:04:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:17] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:17] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 341918 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{1=1}
Probabilistic random walk after 341918 steps, saw 337746 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:21] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:04:21] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:04:21] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:04:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-05-19 12:04:22] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:04:22] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 12:04:22] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 756 transition count 558
Applied a total of 78 rules in 37 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished probabilistic random walk after 75487 steps, run visited all 1 properties in 667 ms. (steps per millisecond=113 )
Probabilistic random walk after 75487 steps, saw 73041 distinct states, run finished after 668 ms. (steps per millisecond=113 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 378 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 819 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 596 ms.
Product exploration explored 100000 steps with 0 reset in 775 ms.
Built C files in :
/tmp/ltsmin12561577304062325698
[2022-05-19 12:04:26] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2022-05-19 12:04:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:26] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2022-05-19 12:04:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:26] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2022-05-19 12:04:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:26] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12561577304062325698
Running compilation step : cd /tmp/ltsmin12561577304062325698;'/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 1284 ms.
Running link step : cd /tmp/ltsmin12561577304062325698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12561577304062325698;'/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/stateBased5929003355607359007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 18 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:41] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:41] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:41] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:42] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2022-05-19 12:04:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:04:42] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:04:42] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin2624270051878930755
[2022-05-19 12:04:42] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2022-05-19 12:04:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:42] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2022-05-19 12:04:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:42] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2022-05-19 12:04:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:04:42] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2624270051878930755
Running compilation step : cd /tmp/ltsmin2624270051878930755;'/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 1271 ms.
Running link step : cd /tmp/ltsmin2624270051878930755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2624270051878930755;'/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/stateBased17997812080246735235.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:04:57] [INFO ] Flatten gal took : 29 ms
[2022-05-19 12:04:57] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:04:57] [INFO ] Time to serialize gal into /tmp/LTL7501438922591592357.gal : 4 ms
[2022-05-19 12:04:57] [INFO ] Time to serialize properties into /tmp/LTL8076644961458036036.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/LTL7501438922591592357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8076644961458036036.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/LTL7501438...266
Read 1 LTL properties
Checking formula 0 : !((X((F(G(F("((p23==0)||(p183==1))"))))||(F(G(((X("((p23==0)||(p183==1))"))||("(p253==0)"))||("(p24==1)")))))))
Formula 0 simplified : !X(FGF"((p23==0)||(p183==1))" | FG("(p24==1)" | "(p253==0)" | X"((p23==0)||(p183==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
606 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.14551,146088,1,0,20,707026,41,10,19224,384991,61
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-05 finished in 59257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:04] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:04] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:04] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:05:05] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:05] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:05] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s336 0) (NEQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-07 finished in 1506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G((G(p2)&&p3))&&p1))||p0))))'
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:05] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:06] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:06] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:05:07] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:07] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:05:07] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s134 0) (EQ s463 1)), p0:(OR (EQ s626 0) (EQ s670 1)), p1:(AND (OR (EQ s134 0) (EQ s463 1)) (OR (EQ s51 0) (EQ s697 1))), p2:(AND (EQ s463 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 657 ms.
Stack based approach found an accepted trace after 335 steps with 0 reset with depth 336 and stack size 336 in 3 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-09 finished in 2234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(p0))))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:08] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:08] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:08] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:05:09] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:09] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:05:09] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s260 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 586 ms.
Product exploration explored 100000 steps with 0 reset in 754 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 717 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31886 steps, run visited all 1 properties in 250 ms. (steps per millisecond=127 )
Probabilistic random walk after 31886 steps, saw 31200 distinct states, run finished after 251 ms. (steps per millisecond=127 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 15 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:12] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:05:13] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:13] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:05:13] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:13] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:05:14] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 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 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31886 steps, run visited all 1 properties in 270 ms. (steps per millisecond=118 )
Probabilistic random walk after 31886 steps, saw 31200 distinct states, run finished after 271 ms. (steps per millisecond=117 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 893 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 590 ms.
Product exploration explored 100000 steps with 0 reset in 811 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 81 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2022-05-19 12:05:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:17] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:05:18] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Product exploration explored 100000 steps with 0 reset in 625 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Built C files in :
/tmp/ltsmin12815484742523949034
[2022-05-19 12:05:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12815484742523949034
Running compilation step : cd /tmp/ltsmin12815484742523949034;'/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 1212 ms.
Running link step : cd /tmp/ltsmin12815484742523949034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12815484742523949034;'/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/stateBased6503821530368871754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:34] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:35] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:35] [INFO ] Computed 361 place invariants in 3 ms
[2022-05-19 12:05:36] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:05:36] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:05:36] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin11705879092895770302
[2022-05-19 12:05:36] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11705879092895770302
Running compilation step : cd /tmp/ltsmin11705879092895770302;'/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 1276 ms.
Running link step : cd /tmp/ltsmin11705879092895770302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11705879092895770302;'/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/stateBased7091214851155461696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:05:51] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:05:51] [INFO ] Flatten gal took : 27 ms
[2022-05-19 12:05:51] [INFO ] Time to serialize gal into /tmp/LTL8278852148937138180.gal : 2 ms
[2022-05-19 12:05:51] [INFO ] Time to serialize properties into /tmp/LTL8568344001054865474.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/LTL8278852148937138180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8568344001054865474.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/LTL8278852...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("((p260==0)||(p15==1))")))))))
Formula 0 simplified : !GXXXG"((p260==0)||(p15==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-19 12:06:06] [INFO ] Flatten gal took : 37 ms
[2022-05-19 12:06:06] [INFO ] Applying decomposition
[2022-05-19 12:06:06] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2547858395800305688.txt' '-o' '/tmp/graph2547858395800305688.bin' '-w' '/tmp/graph2547858395800305688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2547858395800305688.bin' '-l' '-1' '-v' '-w' '/tmp/graph2547858395800305688.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:06:06] [INFO ] Decomposing Gal with order
[2022-05-19 12:06:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:06:06] [INFO ] Removed a total of 120 redundant transitions.
[2022-05-19 12:06:06] [INFO ] Flatten gal took : 75 ms
[2022-05-19 12:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2022-05-19 12:06:06] [INFO ] Time to serialize gal into /tmp/LTL5707335870251409602.gal : 23 ms
[2022-05-19 12:06:06] [INFO ] Time to serialize properties into /tmp/LTL16258778291993613348.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/LTL5707335870251409602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16258778291993613348.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/LTL5707335...246
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("((i7.u108.p260==0)||(i0.u5.p15==1))")))))))
Formula 0 simplified : !GXXXG"((i7.u108.p260==0)||(i0.u5.p15==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14005043033811737864
[2022-05-19 12:06:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14005043033811737864
Running compilation step : cd /tmp/ltsmin14005043033811737864;'/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 916 ms.
Running link step : cd /tmp/ltsmin14005043033811737864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14005043033811737864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-10 finished in 88894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:37] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:06:37] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:37] [INFO ] Computed 361 place invariants in 1 ms
[2022-05-19 12:06:38] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:38] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:06:38] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-11 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 (NEQ s132 0) (NEQ s290 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 ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-11 finished in 1523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&X(F(p1))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:38] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:06:38] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:38] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:06:39] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2022-05-19 12:06:39] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:06:40] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s190 0) (EQ s304 1)), p1:(AND (EQ s264 0) (EQ s129 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 665 ms.
Stack based approach found an accepted trace after 441 steps with 0 reset with depth 442 and stack size 442 in 4 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 2260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(p0))))))'
Found a SL insensitive property : ShieldIIPt-PT-040A-LTLCardinality-10
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 30 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2022-05-19 12:06:41] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:06:41] [INFO ] Implicit Places using invariants in 361 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 362 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2022-05-19 12:06:41] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:06:41] [INFO ] Implicit Places using invariants in 358 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 359 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 757/763 places, 559/562 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 756 transition count 558
Applied a total of 2 rules in 28 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:41] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:06:42] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:42] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:06:42] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions, in 3 iterations. Remains : 756/763 places, 558/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s260 0) (EQ s15 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 579 ms.
Product exploration explored 100000 steps with 0 reset in 760 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 74 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31918 steps, run visited all 1 properties in 250 ms. (steps per millisecond=127 )
Probabilistic random walk after 31918 steps, saw 31190 distinct states, run finished after 250 ms. (steps per millisecond=127 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:45] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:06:45] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:45] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:06:46] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:46] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:06:46] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 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 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31918 steps, run visited all 1 properties in 247 ms. (steps per millisecond=129 )
Probabilistic random walk after 31918 steps, saw 31190 distinct states, run finished after 248 ms. (steps per millisecond=128 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 597 ms.
Product exploration explored 100000 steps with 0 reset in 738 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 17 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2022-05-19 12:06:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:06:49] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:06:49] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Product exploration explored 100000 steps with 0 reset in 599 ms.
Product exploration explored 100000 steps with 0 reset in 744 ms.
Built C files in :
/tmp/ltsmin1706360094309677475
[2022-05-19 12:06:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1706360094309677475
Running compilation step : cd /tmp/ltsmin1706360094309677475;'/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 904 ms.
Running link step : cd /tmp/ltsmin1706360094309677475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1706360094309677475;'/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/stateBased8986656710865368064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:07:06] [INFO ] Computed 358 place invariants in 6 ms
[2022-05-19 12:07:06] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:07:06] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:07:07] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
// Phase 1: matrix 558 rows 756 cols
[2022-05-19 12:07:07] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:07:07] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin1287487231170802293
[2022-05-19 12:07:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1287487231170802293
Running compilation step : cd /tmp/ltsmin1287487231170802293;'/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 862 ms.
Running link step : cd /tmp/ltsmin1287487231170802293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1287487231170802293;'/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/stateBased9948128354888141069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:07:22] [INFO ] Flatten gal took : 29 ms
[2022-05-19 12:07:22] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:07:22] [INFO ] Time to serialize gal into /tmp/LTL8010070738741091832.gal : 4 ms
[2022-05-19 12:07:22] [INFO ] Time to serialize properties into /tmp/LTL13279476385177950158.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/LTL8010070738741091832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13279476385177950158.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/LTL8010070...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("((p260==0)||(p15==1))")))))))
Formula 0 simplified : !GXXXG"((p260==0)||(p15==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-19 12:07:37] [INFO ] Flatten gal took : 27 ms
[2022-05-19 12:07:37] [INFO ] Applying decomposition
[2022-05-19 12:07:37] [INFO ] Flatten gal took : 26 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/graph13542943734995392440.txt' '-o' '/tmp/graph13542943734995392440.bin' '-w' '/tmp/graph13542943734995392440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13542943734995392440.bin' '-l' '-1' '-v' '-w' '/tmp/graph13542943734995392440.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:07:37] [INFO ] Decomposing Gal with order
[2022-05-19 12:07:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:07:38] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-19 12:07:38] [INFO ] Flatten gal took : 36 ms
[2022-05-19 12:07:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 12:07:38] [INFO ] Time to serialize gal into /tmp/LTL7837642801783848615.gal : 6 ms
[2022-05-19 12:07:38] [INFO ] Time to serialize properties into /tmp/LTL5929700985810874459.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/LTL7837642801783848615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5929700985810874459.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/LTL7837642...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("((i8.i0.i3.u108.p260==0)||(i0.u5.p15==1))")))))))
Formula 0 simplified : !GXXXG"((i8.i0.i3.u108.p260==0)||(i0.u5.p15==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16422528412597396389
[2022-05-19 12:07:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16422528412597396389
Running compilation step : cd /tmp/ltsmin16422528412597396389;'/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 914 ms.
Running link step : cd /tmp/ltsmin16422528412597396389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16422528412597396389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-10 finished in 87338 ms.
[2022-05-19 12:08:08] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17026466016034276563
[2022-05-19 12:08:08] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2022-05-19 12:08:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:08:08] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2022-05-19 12:08:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:08:08] [INFO ] Applying decomposition
[2022-05-19 12:08:08] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2022-05-19 12:08:08] [INFO ] Flatten gal took : 27 ms
[2022-05-19 12:08:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:08:08] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17026466016034276563
Running compilation step : cd /tmp/ltsmin17026466016034276563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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/graph12636183956475401863.txt' '-o' '/tmp/graph12636183956475401863.bin' '-w' '/tmp/graph12636183956475401863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12636183956475401863.bin' '-l' '-1' '-v' '-w' '/tmp/graph12636183956475401863.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:08:08] [INFO ] Decomposing Gal with order
[2022-05-19 12:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:08:08] [INFO ] Removed a total of 120 redundant transitions.
[2022-05-19 12:08:08] [INFO ] Flatten gal took : 36 ms
[2022-05-19 12:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 12:08:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality14387695423896249930.gal : 6 ms
[2022-05-19 12:08:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality13807148043822745389.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/LTLCardinality14387695423896249930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13807148043822745389.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/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("((i7.i1.i1.u108.p260==0)||(i0.u5.p15==1))")))))))
Formula 0 simplified : !GXXXG"((i7.i1.i1.u108.p260==0)||(i0.u5.p15==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin17026466016034276563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17026466016034276563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.121: LTL layer: formula: [](X(X(X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 2/ 8), 0.122: "[](X(X(X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.122: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.161: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.166: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.246: DFS-FIFO for weak LTL, using special progress label 564
pins2lts-mc-linux64( 0/ 8), 0.246: There are 565 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.246: State length is 764, there are 568 groups
pins2lts-mc-linux64( 0/ 8), 0.246: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.246: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.246: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.246: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.303: ~1 levels ~960 states ~5544 transitions
pins2lts-mc-linux64( 4/ 8), 0.354: ~1 levels ~1920 states ~11064 transitions
pins2lts-mc-linux64( 4/ 8), 0.433: ~1 levels ~3840 states ~23912 transitions
pins2lts-mc-linux64( 3/ 8), 0.633: ~1 levels ~7680 states ~48272 transitions
pins2lts-mc-linux64( 3/ 8), 0.978: ~1 levels ~15360 states ~106576 transitions
pins2lts-mc-linux64( 3/ 8), 1.581: ~1 levels ~30720 states ~222072 transitions
pins2lts-mc-linux64( 4/ 8), 2.686: ~1 levels ~61440 states ~507784 transitions
pins2lts-mc-linux64( 3/ 8), 4.697: ~1 levels ~122880 states ~1024688 transitions
pins2lts-mc-linux64( 7/ 8), 8.552: ~1 levels ~245760 states ~2200112 transitions
pins2lts-mc-linux64( 7/ 8), 16.159: ~1 levels ~491520 states ~4667960 transitions
pins2lts-mc-linux64( 7/ 8), 30.360: ~1 levels ~983040 states ~9741136 transitions
pins2lts-mc-linux64( 7/ 8), 60.588: ~1 levels ~1966080 states ~20436000 transitions
pins2lts-mc-linux64( 5/ 8), 120.937: ~1 levels ~3932160 states ~41689888 transitions
pins2lts-mc-linux64( 4/ 8), 187.790: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 188.016:
pins2lts-mc-linux64( 0/ 8), 188.016: mean standard work distribution: 2.0% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 188.016:
pins2lts-mc-linux64( 0/ 8), 188.016: Explored 5808881 states 65663118 transitions, fanout: 11.304
pins2lts-mc-linux64( 0/ 8), 188.016: Total exploration time 187.740 sec (187.550 sec minimum, 187.639 sec on average)
pins2lts-mc-linux64( 0/ 8), 188.016: States per second: 30941, Transitions per second: 349756
pins2lts-mc-linux64( 0/ 8), 188.016:
pins2lts-mc-linux64( 0/ 8), 188.016: Progress states detected: 11276443
pins2lts-mc-linux64( 0/ 8), 188.016: Redundant explorations: -48.4867
pins2lts-mc-linux64( 0/ 8), 188.016:
pins2lts-mc-linux64( 0/ 8), 188.016: Queue width: 8B, total height: 9617420, memory: 73.38MB
pins2lts-mc-linux64( 0/ 8), 188.016: Tree memory: 342.0MB, 31.8 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 188.016: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 188.016: Stored 569 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 188.016: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 188.016: Est. total memory use: 415.4MB (~1097.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17026466016034276563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17026466016034276563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==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)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
64710 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,647.203,9760652,1,0,1.09478e+07,502,2828,8.14008e+07,85,3250,9644
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1143546 ms.
BK_STOP 1652962840639
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;