About the Execution of ITS-Tools for ShieldIIPs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.312 | 3600000.00 | 13494649.00 | 9720.90 | FTFF?FFF?F?FFFFT | 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-165286024700107.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 ShieldIIPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 332K 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 ShieldIIPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652928521710
Running Version 202205111006
[2022-05-19 02:48:42] [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 02:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 02:48:43] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-05-19 02:48:43] [INFO ] Transformed 1203 places.
[2022-05-19 02:48:43] [INFO ] Transformed 1183 transitions.
[2022-05-19 02:48:43] [INFO ] Found NUPN structural information;
[2022-05-19 02:48:43] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 132 place count 1071 transition count 1051
Iterating global reduction 0 with 132 rules applied. Total rules applied 264 place count 1071 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 265 place count 1070 transition count 1050
Iterating global reduction 0 with 1 rules applied. Total rules applied 266 place count 1070 transition count 1050
Applied a total of 266 rules in 313 ms. Remains 1070 /1203 variables (removed 133) and now considering 1050/1183 (removed 133) transitions.
// Phase 1: matrix 1050 rows 1070 cols
[2022-05-19 02:48:43] [INFO ] Computed 181 place invariants in 29 ms
[2022-05-19 02:48:44] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1050 rows 1070 cols
[2022-05-19 02:48:44] [INFO ] Computed 181 place invariants in 22 ms
[2022-05-19 02:48:45] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
// Phase 1: matrix 1050 rows 1070 cols
[2022-05-19 02:48:45] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:48:45] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1070/1203 places, 1050/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1070/1203 places, 1050/1183 transitions.
Support contains 33 out of 1070 places after structural reductions.
[2022-05-19 02:48:45] [INFO ] Flatten gal took : 141 ms
[2022-05-19 02:48:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 02:48:46] [INFO ] Flatten gal took : 69 ms
[2022-05-19 02:48:46] [INFO ] Input system was already deterministic with 1050 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1050 rows 1070 cols
[2022-05-19 02:48:46] [INFO ] Computed 181 place invariants in 9 ms
[2022-05-19 02:48:46] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 02:48:46] [INFO ] [Nat]Absence check using 181 positive place invariants in 48 ms returned sat
[2022-05-19 02:48:46] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 244 stabilizing places and 244 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1069 transition count 948
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 867 transition count 847
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 861 transition count 841
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 861 transition count 841
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 416 place count 861 transition count 838
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 2 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1130 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 501 transition count 482
Applied a total of 1133 rules in 175 ms. Remains 501 /1070 variables (removed 569) and now considering 482/1050 (removed 568) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:48:47] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:48:47] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:48:47] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:48:48] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2022-05-19 02:48:48] [INFO ] Redundant transitions in 75 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:48:48] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 02:48:48] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1070 places, 481/1050 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/1070 places, 481/1050 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s499 0) (NEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1317 steps with 2 reset in 21 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-00 finished in 1412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(!(!X(p0) U p0)))))'
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1062 transition count 1042
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1062 transition count 1042
Applied a total of 16 rules in 43 ms. Remains 1062 /1070 variables (removed 8) and now considering 1042/1050 (removed 8) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:48:48] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:48:48] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:48:48] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:48:49] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:48:49] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:48:50] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1070 places, 1042/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1070 places, 1042/1050 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s283 0) (EQ s1007 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 477 reset in 492 ms.
Product exploration explored 100000 steps with 476 reset in 362 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[p0, p0, p0]
Finished random walk after 120 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:48:51] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:48:52] [INFO ] [Real]Absence check using 181 positive place invariants in 102 ms returned sat
[2022-05-19 02:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:48:55] [INFO ] [Real]Absence check using state equation in 3049 ms returned sat
[2022-05-19 02:48:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:48:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 110 ms returned sat
[2022-05-19 02:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:48:58] [INFO ] [Nat]Absence check using state equation in 2227 ms returned sat
[2022-05-19 02:48:58] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2022-05-19 02:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-19 02:48:58] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-19 02:49:10] [INFO ] Added : 550 causal constraints over 110 iterations in 12019 ms. Result :unknown
Could not prove EG p0
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 28 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:49:10] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:49:10] [INFO ] Implicit Places using invariants in 321 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:49:10] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:49:11] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:49:11] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:49:12] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Finished random walk after 297 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=99 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0, p0]
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:49:12] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:49:13] [INFO ] [Real]Absence check using 181 positive place invariants in 103 ms returned sat
[2022-05-19 02:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:49:16] [INFO ] [Real]Absence check using state equation in 3065 ms returned sat
[2022-05-19 02:49:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:49:16] [INFO ] [Nat]Absence check using 181 positive place invariants in 114 ms returned sat
[2022-05-19 02:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:49:19] [INFO ] [Nat]Absence check using state equation in 2291 ms returned sat
[2022-05-19 02:49:19] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
[2022-05-19 02:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2022-05-19 02:49:19] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 71 ms.
[2022-05-19 02:49:31] [INFO ] Added : 545 causal constraints over 109 iterations in 11979 ms. Result :unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Stuttering criterion allowed to conclude after 44396 steps with 199 reset in 158 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-03 finished in 43058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1063 transition count 1043
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1063 transition count 1043
Applied a total of 14 rules in 53 ms. Remains 1063 /1070 variables (removed 7) and now considering 1043/1050 (removed 7) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:31] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:49:31] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:31] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:49:32] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:32] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:49:33] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1070 places, 1043/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1070 places, 1043/1050 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s726 0) (EQ s229 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 233 reset in 377 ms.
Product exploration explored 100000 steps with 242 reset in 462 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 311 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=103 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:34] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:49:35] [INFO ] [Real]Absence check using 181 positive place invariants in 124 ms returned sat
[2022-05-19 02:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:49:38] [INFO ] [Real]Absence check using state equation in 3050 ms returned sat
[2022-05-19 02:49:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:49:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 140 ms returned sat
[2022-05-19 02:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:49:42] [INFO ] [Nat]Absence check using state equation in 3067 ms returned sat
[2022-05-19 02:49:42] [INFO ] Computed and/alt/rep : 1042/2343/1042 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-19 02:49:53] [INFO ] Added : 480 causal constraints over 96 iterations in 11380 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Applied a total of 0 rules in 26 ms. Remains 1063 /1063 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:53] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:49:53] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:53] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:49:54] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:54] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:49:55] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1043/1043 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 389 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=129 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:49:55] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 02:49:56] [INFO ] [Real]Absence check using 181 positive place invariants in 118 ms returned sat
[2022-05-19 02:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:49:59] [INFO ] [Real]Absence check using state equation in 3040 ms returned sat
[2022-05-19 02:49:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:49:59] [INFO ] [Nat]Absence check using 181 positive place invariants in 128 ms returned sat
[2022-05-19 02:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:50:02] [INFO ] [Nat]Absence check using state equation in 3104 ms returned sat
[2022-05-19 02:50:02] [INFO ] Computed and/alt/rep : 1042/2343/1042 causal constraints (skipped 0 transitions) in 51 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 02:50:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 244 reset in 364 ms.
Product exploration explored 100000 steps with 246 reset in 400 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1063 transition count 1043
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 99 place count 1063 transition count 1045
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 141 place count 1063 transition count 1045
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 1 with 419 rules applied. Total rules applied 560 place count 1063 transition count 1045
Renaming transitions due to excessive name length > 1024 char.
Discarding 139 places :
Symmetric choice reduction at 1 with 139 rule applications. Total rules 699 place count 924 transition count 906
Deduced a syphon composed of 421 places in 1 ms
Iterating global reduction 1 with 139 rules applied. Total rules applied 838 place count 924 transition count 906
Deduced a syphon composed of 421 places in 1 ms
Applied a total of 838 rules in 382 ms. Remains 924 /1063 variables (removed 139) and now considering 906/1043 (removed 137) transitions.
[2022-05-19 02:50:15] [INFO ] Redundant transitions in 167 ms returned [905]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 905 rows 924 cols
[2022-05-19 02:50:15] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:50:16] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1063 places, 905/1043 transitions.
Deduced a syphon composed of 421 places in 0 ms
Applied a total of 0 rules in 39 ms. Remains 924 /924 variables (removed 0) and now considering 905/905 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 924/1063 places, 905/1043 transitions.
Product exploration explored 100000 steps with 12091 reset in 1504 ms.
Product exploration explored 100000 steps with 11902 reset in 1284 ms.
Built C files in :
/tmp/ltsmin10179749606710856764
[2022-05-19 02:50:19] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10179749606710856764
Running compilation step : cd /tmp/ltsmin10179749606710856764;'/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 1808 ms.
Running link step : cd /tmp/ltsmin10179749606710856764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10179749606710856764;'/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/stateBased16353216938798574395.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Applied a total of 0 rules in 30 ms. Remains 1063 /1063 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:50:34] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:50:34] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:50:34] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:50:35] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:50:35] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:50:35] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1043/1043 transitions.
Built C files in :
/tmp/ltsmin2354877104098037991
[2022-05-19 02:50:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2354877104098037991
Running compilation step : cd /tmp/ltsmin2354877104098037991;'/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 1600 ms.
Running link step : cd /tmp/ltsmin2354877104098037991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2354877104098037991;'/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/stateBased6700860800613988866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:50:50] [INFO ] Flatten gal took : 47 ms
[2022-05-19 02:50:50] [INFO ] Flatten gal took : 43 ms
[2022-05-19 02:50:51] [INFO ] Time to serialize gal into /tmp/LTL11110960175522901911.gal : 10 ms
[2022-05-19 02:50:51] [INFO ] Time to serialize properties into /tmp/LTL16742746083066272813.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/LTL11110960175522901911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16742746083066272813.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/LTL1111096...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X("((p817==0)&&(p256==1))")))))
Formula 0 simplified : !FXX"((p817==0)&&(p256==1))"
Detected timeout of ITS tools.
[2022-05-19 02:51:06] [INFO ] Flatten gal took : 40 ms
[2022-05-19 02:51:06] [INFO ] Applying decomposition
[2022-05-19 02:51:06] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6677234878766754765.txt' '-o' '/tmp/graph6677234878766754765.bin' '-w' '/tmp/graph6677234878766754765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6677234878766754765.bin' '-l' '-1' '-v' '-w' '/tmp/graph6677234878766754765.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:51:06] [INFO ] Decomposing Gal with order
[2022-05-19 02:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:51:06] [INFO ] Removed a total of 460 redundant transitions.
[2022-05-19 02:51:07] [INFO ] Flatten gal took : 764 ms
[2022-05-19 02:51:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-19 02:51:07] [INFO ] Time to serialize gal into /tmp/LTL9609043547155174444.gal : 15 ms
[2022-05-19 02:51:07] [INFO ] Time to serialize properties into /tmp/LTL15382163947904729690.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/LTL9609043547155174444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15382163947904729690.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/LTL9609043...246
Read 1 LTL properties
Checking formula 0 : !((F(X(X("((i14.i3.u272.p817==0)&&(i4.i5.u87.p256==1))")))))
Formula 0 simplified : !FXX"((i14.i3.u272.p817==0)&&(i4.i5.u87.p256==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16790085700730609389
[2022-05-19 02:51:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16790085700730609389
Running compilation step : cd /tmp/ltsmin16790085700730609389;'/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 1660 ms.
Running link step : cd /tmp/ltsmin16790085700730609389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16790085700730609389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-04 finished in 125911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !F(G((p1 U p2))))))'
Support contains 5 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1069 transition count 950
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 970 transition count 949
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 969 transition count 949
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 200 place count 969 transition count 848
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 402 place count 868 transition count 848
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 409 place count 861 transition count 841
Iterating global reduction 3 with 7 rules applied. Total rules applied 416 place count 861 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 416 place count 861 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 420 place count 859 transition count 839
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 3 with 706 rules applied. Total rules applied 1126 place count 506 transition count 486
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1128 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1129 place count 503 transition count 484
Applied a total of 1129 rules in 154 ms. Remains 503 /1070 variables (removed 567) and now considering 484/1050 (removed 566) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 02:51:37] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:37] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 02:51:37] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:38] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2022-05-19 02:51:38] [INFO ] Redundant transitions in 42 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:51:38] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:51:38] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1070 places, 483/1050 transitions.
Applied a total of 0 rules in 17 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 503/1070 places, 483/1050 transitions.
Stuttering acceptance computed with spot in 98 ms :[p2, p2]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s108 0) (EQ s227 1) (EQ s418 1)), p1:(OR (EQ s199 0) (EQ s430 1) (EQ s418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6184 steps with 5 reset in 45 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-05 finished in 1259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 1 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1069 transition count 948
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 867 transition count 847
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 412 place count 859 transition count 839
Iterating global reduction 2 with 8 rules applied. Total rules applied 420 place count 859 transition count 839
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 859 transition count 836
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 856 transition count 836
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1134 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1136 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 499 transition count 480
Applied a total of 1137 rules in 120 ms. Remains 499 /1070 variables (removed 571) and now considering 480/1050 (removed 570) transitions.
// Phase 1: matrix 480 rows 499 cols
[2022-05-19 02:51:38] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:39] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 480 rows 499 cols
[2022-05-19 02:51:39] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:39] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2022-05-19 02:51:39] [INFO ] Redundant transitions in 51 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 479 rows 499 cols
[2022-05-19 02:51:39] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:39] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1070 places, 479/1050 transitions.
Applied a total of 0 rules in 19 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 499/1070 places, 479/1050 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4412 steps with 4 reset in 29 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 1175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1069 transition count 949
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 969 transition count 949
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 969 transition count 848
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 868 transition count 848
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 409 place count 861 transition count 841
Iterating global reduction 2 with 7 rules applied. Total rules applied 416 place count 861 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 416 place count 861 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 420 place count 859 transition count 839
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 1 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 2 with 700 rules applied. Total rules applied 1120 place count 509 transition count 489
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 507 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 506 transition count 487
Applied a total of 1123 rules in 95 ms. Remains 506 /1070 variables (removed 564) and now considering 487/1050 (removed 563) transitions.
// Phase 1: matrix 487 rows 506 cols
[2022-05-19 02:51:40] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:51:40] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 487 rows 506 cols
[2022-05-19 02:51:40] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:51:40] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2022-05-19 02:51:40] [INFO ] Redundant transitions in 59 ms returned [486]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:51:40] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:51:41] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 506/1070 places, 486/1050 transitions.
Applied a total of 0 rules in 9 ms. Remains 506 /506 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 506/1070 places, 486/1050 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s165 0) (EQ s58 1)) (OR (EQ s53 0) (EQ s81 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 95 reset in 613 ms.
Product exploration explored 100000 steps with 94 reset in 604 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 486/486 transitions.
Applied a total of 0 rules in 17 ms. Remains 506 /506 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:51:42] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:51:42] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:51:42] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:51:43] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2022-05-19 02:51:43] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:51:43] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:51:43] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 506/506 places, 486/486 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 95 reset in 523 ms.
Product exploration explored 100000 steps with 94 reset in 607 ms.
Built C files in :
/tmp/ltsmin18223616463814458100
[2022-05-19 02:51:45] [INFO ] Computing symmetric may disable matrix : 486 transitions.
[2022-05-19 02:51:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:51:45] [INFO ] Computing symmetric may enable matrix : 486 transitions.
[2022-05-19 02:51:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:51:45] [INFO ] Computing Do-Not-Accords matrix : 486 transitions.
[2022-05-19 02:51:45] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:51:45] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18223616463814458100
Running compilation step : cd /tmp/ltsmin18223616463814458100;'/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 1021 ms.
Running link step : cd /tmp/ltsmin18223616463814458100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18223616463814458100;'/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/stateBased16152983198044941484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 486/486 transitions.
Applied a total of 0 rules in 13 ms. Remains 506 /506 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:52:00] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:52:00] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:52:00] [INFO ] Computed 180 place invariants in 6 ms
[2022-05-19 02:52:00] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2022-05-19 02:52:00] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 486 rows 506 cols
[2022-05-19 02:52:00] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:52:01] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 506/506 places, 486/486 transitions.
Built C files in :
/tmp/ltsmin42878321598551597
[2022-05-19 02:52:01] [INFO ] Computing symmetric may disable matrix : 486 transitions.
[2022-05-19 02:52:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:52:01] [INFO ] Computing symmetric may enable matrix : 486 transitions.
[2022-05-19 02:52:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:52:01] [INFO ] Computing Do-Not-Accords matrix : 486 transitions.
[2022-05-19 02:52:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:52:01] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin42878321598551597
Running compilation step : cd /tmp/ltsmin42878321598551597;'/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 1019 ms.
Running link step : cd /tmp/ltsmin42878321598551597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin42878321598551597;'/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/stateBased2748990593739817160.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:52:16] [INFO ] Flatten gal took : 19 ms
[2022-05-19 02:52:16] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:52:16] [INFO ] Time to serialize gal into /tmp/LTL14586872973209989674.gal : 3 ms
[2022-05-19 02:52:16] [INFO ] Time to serialize properties into /tmp/LTL14879700907841697381.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/LTL14586872973209989674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14879700907841697381.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/LTL1458687...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p395==0)||(p155==1))&&((p146==0)||(p199==1)))"))))
Formula 0 simplified : !FG"(((p395==0)||(p155==1))&&((p146==0)||(p199==1)))"
Detected timeout of ITS tools.
[2022-05-19 02:52:31] [INFO ] Flatten gal took : 27 ms
[2022-05-19 02:52:31] [INFO ] Applying decomposition
[2022-05-19 02:52:31] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13407726700255148812.txt' '-o' '/tmp/graph13407726700255148812.bin' '-w' '/tmp/graph13407726700255148812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13407726700255148812.bin' '-l' '-1' '-v' '-w' '/tmp/graph13407726700255148812.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:52:31] [INFO ] Decomposing Gal with order
[2022-05-19 02:52:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:52:31] [INFO ] Removed a total of 319 redundant transitions.
[2022-05-19 02:52:31] [INFO ] Flatten gal took : 56 ms
[2022-05-19 02:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 25 ms.
[2022-05-19 02:52:31] [INFO ] Time to serialize gal into /tmp/LTL5852759759023048379.gal : 13 ms
[2022-05-19 02:52:31] [INFO ] Time to serialize properties into /tmp/LTL16784669676110259147.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/LTL5852759759023048379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16784669676110259147.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/LTL5852759...246
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i6.u61.p395==0)||(i2.i0.u23.p155==1))&&((i2.i0.u19.p146==0)||(i2.i2.u29.p199==1)))"))))
Formula 0 simplified : !FG"(((i6.u61.p395==0)||(i2.i0.u23.p155==1))&&((i2.i0.u19.p146==0)||(i2.i2.u29.p199==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin406739573992774154
[2022-05-19 02:52:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin406739573992774154
Running compilation step : cd /tmp/ltsmin406739573992774154;'/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 761 ms.
Running link step : cd /tmp/ltsmin406739573992774154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin406739573992774154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-08 finished in 81765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1065 transition count 1045
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1065 transition count 1045
Applied a total of 10 rules in 98 ms. Remains 1065 /1070 variables (removed 5) and now considering 1045/1050 (removed 5) transitions.
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:53:01] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:53:02] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:53:02] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:53:03] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:53:03] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:53:03] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1065/1070 places, 1045/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1065/1070 places, 1045/1050 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s56 0) (EQ s902 1) (OR (EQ s993 0) (EQ s940 1))), p0:(AND (EQ s56 0) (EQ s902 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 1893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0)||p1)))))'
Support contains 4 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1069 transition count 949
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 969 transition count 949
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 969 transition count 847
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 867 transition count 847
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 412 place count 859 transition count 839
Iterating global reduction 2 with 8 rules applied. Total rules applied 420 place count 859 transition count 839
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 859 transition count 836
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 856 transition count 836
Performed 352 Post agglomeration using F-continuation condition.Transition count delta: 352
Deduced a syphon composed of 352 places in 0 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 2 with 704 rules applied. Total rules applied 1130 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 501 transition count 482
Applied a total of 1133 rules in 106 ms. Remains 501 /1070 variables (removed 569) and now considering 482/1050 (removed 568) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:53:03] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:53:03] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:53:03] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:53:04] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2022-05-19 02:53:04] [INFO ] Redundant transitions in 54 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:04] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:53:04] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1070 places, 481/1050 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/1070 places, 481/1050 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s305 0) (EQ s49 1)), p0:(OR (EQ s80 0) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 105 reset in 567 ms.
Product exploration explored 100000 steps with 105 reset in 675 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1069 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 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:07] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:53:07] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 02:53:07] [INFO ] [Nat]Absence check using 180 positive place invariants in 21 ms returned sat
[2022-05-19 02:53:07] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 02:53:07] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 02:53:07] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 218 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 206 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:08] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:53:08] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:08] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:53:08] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2022-05-19 02:53:08] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:08] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:53:09] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 481/481 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 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 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:09] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:53:09] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 02:53:09] [INFO ] [Nat]Absence check using 180 positive place invariants in 20 ms returned sat
[2022-05-19 02:53:09] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 02:53:09] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-19 02:53:09] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 219 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 188 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))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 104 reset in 542 ms.
Product exploration explored 100000 steps with 109 reset in 597 ms.
Built C files in :
/tmp/ltsmin1431780025520510809
[2022-05-19 02:53:11] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 02:53:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:11] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 02:53:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:11] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 02:53:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:11] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1431780025520510809
Running compilation step : cd /tmp/ltsmin1431780025520510809;'/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 1025 ms.
Running link step : cd /tmp/ltsmin1431780025520510809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1431780025520510809;'/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/stateBased5452885733159857427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 11 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:26] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:53:27] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:27] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:53:27] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2022-05-19 02:53:27] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:53:27] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:53:27] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin6999397026587963824
[2022-05-19 02:53:27] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 02:53:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:27] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 02:53:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:27] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 02:53:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:53:27] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6999397026587963824
Running compilation step : cd /tmp/ltsmin6999397026587963824;'/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 1069 ms.
Running link step : cd /tmp/ltsmin6999397026587963824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6999397026587963824;'/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/stateBased6286823297474310960.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:53:42] [INFO ] Flatten gal took : 24 ms
[2022-05-19 02:53:42] [INFO ] Flatten gal took : 17 ms
[2022-05-19 02:53:42] [INFO ] Time to serialize gal into /tmp/LTL17020100501017097211.gal : 2 ms
[2022-05-19 02:53:42] [INFO ] Time to serialize properties into /tmp/LTL9973098779170698653.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/LTL17020100501017097211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9973098779170698653.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/LTL1702010...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G((F("((p210==0)||(p649==1))"))||("((p741==0)&&(p130==1))"))))))
Formula 0 simplified : !FXG("((p741==0)&&(p130==1))" | F"((p210==0)||(p649==1))")
Detected timeout of ITS tools.
[2022-05-19 02:53:57] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:53:57] [INFO ] Applying decomposition
[2022-05-19 02:53:57] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph659718540263615171.txt' '-o' '/tmp/graph659718540263615171.bin' '-w' '/tmp/graph659718540263615171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph659718540263615171.bin' '-l' '-1' '-v' '-w' '/tmp/graph659718540263615171.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:53:57] [INFO ] Decomposing Gal with order
[2022-05-19 02:53:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:53:58] [INFO ] Removed a total of 318 redundant transitions.
[2022-05-19 02:53:58] [INFO ] Flatten gal took : 31 ms
[2022-05-19 02:53:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 29 ms.
[2022-05-19 02:53:58] [INFO ] Time to serialize gal into /tmp/LTL11929297930996201614.gal : 4 ms
[2022-05-19 02:53:58] [INFO ] Time to serialize properties into /tmp/LTL7445461907546060407.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/LTL11929297930996201614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7445461907546060407.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/LTL1192929...246
Read 1 LTL properties
Checking formula 0 : !((F(X(G((F("((i3.i0.u29.p210==0)||(i10.i0.u98.p649==1))"))||("((i12.i0.u110.p741==0)&&(i1.i1.u18.p130==1))"))))))
Formula 0 simplified : !FXG("((i12.i0.u110.p741==0)&&(i1.i1.u18.p130==1))" | F"((i3.i0.u29.p210==0)||(i10.i0.u98.p649==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9708476760699571292
[2022-05-19 02:54:13] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9708476760699571292
Running compilation step : cd /tmp/ltsmin9708476760699571292;'/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 1017 ms.
Running link step : cd /tmp/ltsmin9708476760699571292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9708476760699571292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((<>((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-10 finished in 84608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(X(p1)))))'
Support contains 3 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1062 transition count 1042
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1062 transition count 1042
Applied a total of 16 rules in 54 ms. Remains 1062 /1070 variables (removed 8) and now considering 1042/1050 (removed 8) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:28] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:54:28] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:28] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:54:29] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:29] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 02:54:29] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1070 places, 1042/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1070 places, 1042/1050 transitions.
Stuttering acceptance computed with spot in 1091 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s935 1), p0:(OR (EQ s188 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 220 reset in 436 ms.
Product exploration explored 100000 steps with 229 reset in 473 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1506 steps, including 0 resets, run visited all 3 properties in 29 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 27 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:33] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:54:33] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:33] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:54:34] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:34] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:54:34] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 805 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1671 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 226 reset in 407 ms.
Product exploration explored 100000 steps with 223 reset in 443 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 1 with 418 rules applied. Total rules applied 558 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 139 places :
Symmetric choice reduction at 1 with 139 rule applications. Total rules 697 place count 923 transition count 905
Deduced a syphon composed of 419 places in 0 ms
Iterating global reduction 1 with 139 rules applied. Total rules applied 836 place count 923 transition count 905
Deduced a syphon composed of 419 places in 1 ms
Applied a total of 836 rules in 190 ms. Remains 923 /1062 variables (removed 139) and now considering 905/1042 (removed 137) transitions.
[2022-05-19 02:54:37] [INFO ] Redundant transitions in 54 ms returned [904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 904 rows 923 cols
[2022-05-19 02:54:37] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:54:38] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1062 places, 904/1042 transitions.
Deduced a syphon composed of 419 places in 1 ms
Applied a total of 0 rules in 33 ms. Remains 923 /923 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 923/1062 places, 904/1042 transitions.
Stuttering criterion allowed to conclude after 81222 steps with 1143 reset in 538 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 10360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(X(X(X(G(X(F(G(p0))))))))))))'
Support contains 1 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1069 transition count 948
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 867 transition count 847
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 412 place count 859 transition count 839
Iterating global reduction 2 with 8 rules applied. Total rules applied 420 place count 859 transition count 839
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 859 transition count 836
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 856 transition count 836
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1134 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1136 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 499 transition count 480
Applied a total of 1137 rules in 104 ms. Remains 499 /1070 variables (removed 571) and now considering 480/1050 (removed 570) transitions.
// Phase 1: matrix 480 rows 499 cols
[2022-05-19 02:54:38] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:54:38] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 480 rows 499 cols
[2022-05-19 02:54:38] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:54:39] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2022-05-19 02:54:39] [INFO ] Redundant transitions in 47 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 479 rows 499 cols
[2022-05-19 02:54:39] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:54:39] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1070 places, 479/1050 transitions.
Applied a total of 0 rules in 10 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 499/1070 places, 479/1050 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 997 steps with 0 reset in 12 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-12 finished in 1095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1062 transition count 1042
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1062 transition count 1042
Applied a total of 16 rules in 63 ms. Remains 1062 /1070 variables (removed 8) and now considering 1042/1050 (removed 8) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:39] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:54:40] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:40] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:54:40] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:40] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:54:41] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1070 places, 1042/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1070 places, 1042/1050 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-13 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:(OR (EQ s881 0) (EQ s508 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 515 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-13 finished in 1750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(p0))))))'
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1062 transition count 1042
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1062 transition count 1042
Applied a total of 16 rules in 60 ms. Remains 1062 /1070 variables (removed 8) and now considering 1042/1050 (removed 8) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:41] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:54:41] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:41] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:54:42] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 02:54:42] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 02:54:43] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1070 places, 1042/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1070 places, 1042/1050 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-14 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 s736 0) (EQ s78 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]]
Entered a terminal (fully accepting) state of product in 540 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-14 finished in 1838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Found a CL insensitive property : ShieldIIPs-PT-020B-LTLCardinality-04
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1070 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1070/1070 places, 1050/1050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1069 transition count 949
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 969 transition count 949
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 969 transition count 848
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 868 transition count 848
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 409 place count 861 transition count 841
Iterating global reduction 2 with 7 rules applied. Total rules applied 416 place count 861 transition count 841
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 416 place count 861 transition count 838
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1130 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 501 transition count 482
Applied a total of 1133 rules in 120 ms. Remains 501 /1070 variables (removed 569) and now considering 482/1050 (removed 568) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:43] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:54:43] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:43] [INFO ] Computed 180 place invariants in 7 ms
[2022-05-19 02:54:44] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:44] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:54:44] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 501/1070 places, 482/1050 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/1070 places, 482/1050 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s341 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23888 reset in 423 ms.
Product exploration explored 100000 steps with 23943 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:45] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:54:46] [INFO ] [Real]Absence check using 180 positive place invariants in 55 ms returned sat
[2022-05-19 02:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:54:46] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2022-05-19 02:54:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:54:46] [INFO ] [Nat]Absence check using 180 positive place invariants in 54 ms returned sat
[2022-05-19 02:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:54:47] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2022-05-19 02:54:47] [INFO ] Computed and/alt/rep : 480/1197/480 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-19 02:54:55] [INFO ] Added : 425 causal constraints over 85 iterations in 8164 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:55] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:54:55] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:55] [INFO ] Computed 180 place invariants in 6 ms
[2022-05-19 02:54:56] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:56] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:54:56] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 482/482 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:54:56] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:54:57] [INFO ] [Real]Absence check using 180 positive place invariants in 52 ms returned sat
[2022-05-19 02:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:54:57] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2022-05-19 02:54:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:54:57] [INFO ] [Nat]Absence check using 180 positive place invariants in 48 ms returned sat
[2022-05-19 02:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:54:58] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2022-05-19 02:54:58] [INFO ] Computed and/alt/rep : 480/1197/480 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-19 02:55:07] [INFO ] Added : 425 causal constraints over 85 iterations in 9231 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23894 reset in 432 ms.
Product exploration explored 100000 steps with 23878 reset in 505 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 488 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 15 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2022-05-19 02:55:09] [INFO ] Redundant transitions in 46 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:55:09] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:55:09] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/501 places, 481/482 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/501 places, 481/482 transitions.
Product exploration explored 100000 steps with 23877 reset in 1878 ms.
Product exploration explored 100000 steps with 24180 reset in 1954 ms.
Built C files in :
/tmp/ltsmin13098345452064159308
[2022-05-19 02:55:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13098345452064159308
Running compilation step : cd /tmp/ltsmin13098345452064159308;'/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 752 ms.
Running link step : cd /tmp/ltsmin13098345452064159308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13098345452064159308;'/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/stateBased17137810015940951773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 11 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:55:28] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:55:28] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:55:28] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:55:29] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:55:29] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:55:29] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 482/482 transitions.
Built C files in :
/tmp/ltsmin7907608910340400914
[2022-05-19 02:55:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7907608910340400914
Running compilation step : cd /tmp/ltsmin7907608910340400914;'/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 757 ms.
Running link step : cd /tmp/ltsmin7907608910340400914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7907608910340400914;'/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/stateBased3257366022720326226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:55:44] [INFO ] Flatten gal took : 17 ms
[2022-05-19 02:55:44] [INFO ] Flatten gal took : 17 ms
[2022-05-19 02:55:44] [INFO ] Time to serialize gal into /tmp/LTL11404849492595451382.gal : 2 ms
[2022-05-19 02:55:44] [INFO ] Time to serialize properties into /tmp/LTL13227807455796390889.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/LTL11404849492595451382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13227807455796390889.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/LTL1140484...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X("((p817==0)&&(p256==1))")))))
Formula 0 simplified : !FXX"((p817==0)&&(p256==1))"
Detected timeout of ITS tools.
[2022-05-19 02:55:59] [INFO ] Flatten gal took : 16 ms
[2022-05-19 02:55:59] [INFO ] Applying decomposition
[2022-05-19 02:55:59] [INFO ] Flatten gal took : 15 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/graph16604223149908311082.txt' '-o' '/tmp/graph16604223149908311082.bin' '-w' '/tmp/graph16604223149908311082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16604223149908311082.bin' '-l' '-1' '-v' '-w' '/tmp/graph16604223149908311082.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:55:59] [INFO ] Decomposing Gal with order
[2022-05-19 02:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:55:59] [INFO ] Removed a total of 320 redundant transitions.
[2022-05-19 02:55:59] [INFO ] Flatten gal took : 37 ms
[2022-05-19 02:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 6 ms.
[2022-05-19 02:55:59] [INFO ] Time to serialize gal into /tmp/LTL2584657453369433737.gal : 3 ms
[2022-05-19 02:55:59] [INFO ] Time to serialize properties into /tmp/LTL3570421134333033853.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/LTL2584657453369433737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3570421134333033853.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/LTL2584657...245
Read 1 LTL properties
Checking formula 0 : !((F(X(X("((i13.i0.u124.p817==0)&&(i3.i2.u36.p256==1))")))))
Formula 0 simplified : !FXX"((i13.i0.u124.p817==0)&&(i3.i2.u36.p256==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4714646282562821773
[2022-05-19 02:56:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4714646282562821773
Running compilation step : cd /tmp/ltsmin4714646282562821773;'/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 756 ms.
Running link step : cd /tmp/ltsmin4714646282562821773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4714646282562821773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-04 finished in 106532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0)||p1)))))'
[2022-05-19 02:56:30] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17714115982080653614
[2022-05-19 02:56:30] [INFO ] Computing symmetric may disable matrix : 1050 transitions.
[2022-05-19 02:56:30] [INFO ] Applying decomposition
[2022-05-19 02:56:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:30] [INFO ] Computing symmetric may enable matrix : 1050 transitions.
[2022-05-19 02:56:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:30] [INFO ] Flatten gal took : 27 ms
[2022-05-19 02:56:30] [INFO ] Computing Do-Not-Accords matrix : 1050 transitions.
[2022-05-19 02:56:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph11802642364304798781.txt' '-o' '/tmp/graph11802642364304798781.bin' '-w' '/tmp/graph11802642364304798781.weights'
[2022-05-19 02:56:30] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17714115982080653614
Running compilation step : cd /tmp/ltsmin17714115982080653614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11802642364304798781.bin' '-l' '-1' '-v' '-w' '/tmp/graph11802642364304798781.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:56:30] [INFO ] Decomposing Gal with order
[2022-05-19 02:56:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:56:30] [INFO ] Removed a total of 460 redundant transitions.
[2022-05-19 02:56:30] [INFO ] Flatten gal took : 51 ms
[2022-05-19 02:56:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 02:56:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality4904189261137852499.gal : 8 ms
[2022-05-19 02:56:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality9594334012857191520.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/LTLCardinality4904189261137852499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9594334012857191520.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...267
Read 3 LTL properties
Checking formula 0 : !((F(X(X("((i13.i6.u275.p817==0)&&(i3.i6.u87.p256==1))")))))
Formula 0 simplified : !FXX"((i13.i6.u275.p817==0)&&(i3.i6.u87.p256==1))"
Compilation finished in 4773 ms.
Running link step : cd /tmp/ltsmin17714115982080653614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17714115982080653614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin17714115982080653614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17714115982080653614;'/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' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 03:19:06] [INFO ] Applying decomposition
[2022-05-19 03:19:06] [INFO ] Flatten gal took : 50 ms
[2022-05-19 03:19:06] [INFO ] Decomposing Gal with order
[2022-05-19 03:19:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:19:06] [INFO ] Removed a total of 320 redundant transitions.
[2022-05-19 03:19:06] [INFO ] Flatten gal took : 112 ms
[2022-05-19 03:19:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 33 ms.
[2022-05-19 03:19:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality14526919522891178908.gal : 10 ms
[2022-05-19 03:19:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality12167008282326408853.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/LTLCardinality14526919522891178908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12167008282326408853.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 3 LTL properties
Checking formula 0 : !((F(X(X("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u255.p817==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u88.p256==1))")))))
Formula 0 simplified : !FXX"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u255.p817==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u88.p256==1))"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin17714115982080653614;'/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' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17714115982080653614;'/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([]((<>((LTLAPp2==true))||(LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 03:41:43] [INFO ] Flatten gal took : 282 ms
[2022-05-19 03:41:45] [INFO ] Input system was already deterministic with 1050 transitions.
[2022-05-19 03:41:46] [INFO ] Transformed 1070 places.
[2022-05-19 03:41:46] [INFO ] Transformed 1050 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 03:41:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality16376770322553613686.gal : 9 ms
[2022-05-19 03:41:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality7208467846521868713.ltl : 5 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/LTLCardinality16376770322553613686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7208467846521868713.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(X("((p817==0)&&(p256==1))")))))
Formula 0 simplified : !FXX"((p817==0)&&(p256==1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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-165286024700107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B 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 ;