About the Execution of LoLa+red for QuasiCertifProtocol-PT-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1509.556 | 580532.00 | 639804.00 | 2169.30 | TFFF?FFF?FFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948500900.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is QuasiCertifProtocol-PT-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500900
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 749K Mar 5 18:23 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 QuasiCertifProtocol-PT-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678920258028
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:44:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 22:44:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:44:19] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-15 22:44:19] [INFO ] Transformed 2998 places.
[2023-03-15 22:44:19] [INFO ] Transformed 446 transitions.
[2023-03-15 22:44:19] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2010 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 133 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:44:20] [INFO ] Computed 2492 place invariants in 121 ms
[2023-03-15 22:44:21] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2023-03-15 22:44:21] [INFO ] Invariant cache hit.
[2023-03-15 22:44:25] [INFO ] Implicit Places using invariants and state equation in 3509 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
[2023-03-15 22:44:25] [INFO ] Invariant cache hit.
[2023-03-15 22:44:26] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2010 out of 2936 places after structural reductions.
[2023-03-15 22:44:26] [INFO ] Flatten gal took : 228 ms
[2023-03-15 22:44:26] [INFO ] Flatten gal took : 125 ms
[2023-03-15 22:44:27] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-15 22:44:27] [INFO ] Invariant cache hit.
[2023-03-15 22:44:29] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 529 ms returned sat
[2023-03-15 22:44:29] [INFO ] After 1791ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-15 22:44:31] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 508 ms returned sat
[2023-03-15 22:44:36] [INFO ] After 4194ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-15 22:44:40] [INFO ] After 8100ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 2416 ms.
[2023-03-15 22:44:42] [INFO ] After 12976ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 17 properties in 68 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.37 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 570 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-15 22:44:43] [INFO ] Computed 2464 place invariants in 71 ms
[2023-03-15 22:44:47] [INFO ] Implicit Places using invariants in 3791 ms returned []
[2023-03-15 22:44:47] [INFO ] Invariant cache hit.
[2023-03-15 22:44:55] [INFO ] Implicit Places using invariants and state equation in 8061 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11863 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 210 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12644 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s83 1) (GEQ s85 1) (GEQ s86 1) (GEQ s91 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1) (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 12960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 900 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2095 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.11 ms
Discarding 841 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2037 transition count 331
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2037 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 2036 transition count 330
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 2036 transition count 330
Applied a total of 118 rules in 308 ms. Remains 2036 /2936 variables (removed 900) and now considering 330/446 (removed 116) transitions.
// Phase 1: matrix 330 rows 2036 cols
[2023-03-15 22:44:56] [INFO ] Computed 1708 place invariants in 12 ms
[2023-03-15 22:44:57] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-15 22:44:57] [INFO ] Invariant cache hit.
[2023-03-15 22:45:02] [INFO ] Implicit Places using invariants and state equation in 4928 ms returned [1070, 1071, 1073, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1710, 1711, 1712, 1713, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1954]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 6423 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1978/2936 places, 330/446 transitions.
Applied a total of 0 rules in 54 ms. Remains 1978 /1978 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6787 ms. Remains : 1978/2936 places, 330/446 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s149 1) (GEQ s1833 1) (GEQ s1834 1) (GEQ s1835 1) (GEQ s1836 1) (GEQ s1837 1) (GEQ s1838 1) (GEQ s1839 1) (GEQ s1840 1) (GEQ s1841 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 106 steps with 2 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 6955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(!p0)))) U G(p1)))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 252 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:45:03] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-15 22:45:07] [INFO ] Implicit Places using invariants in 3913 ms returned []
[2023-03-15 22:45:07] [INFO ] Invariant cache hit.
[2023-03-15 22:45:14] [INFO ] Implicit Places using invariants and state equation in 6776 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10700 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 209 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11161 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), p0, (AND p0 (NOT p1)), p0, p0, true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3024 reset in 733 ms.
Product exploration explored 100000 steps with 3025 reset in 610 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 331 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND p1 p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 663266 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663266 steps, saw 85135 distinct states, run finished after 3002 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-15 22:45:20] [INFO ] Computed 2464 place invariants in 315 ms
[2023-03-15 22:45:21] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 507 ms returned sat
[2023-03-15 22:45:23] [INFO ] After 2217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 22:45:24] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 501 ms returned sat
[2023-03-15 22:45:33] [INFO ] After 8742ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 22:45:42] [INFO ] After 18159ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 4232 ms.
[2023-03-15 22:45:46] [INFO ] After 23581ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 123 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 4 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-03 finished in 43757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 214 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:45:47] [INFO ] Computed 2492 place invariants in 51 ms
[2023-03-15 22:45:51] [INFO ] Implicit Places using invariants in 4030 ms returned []
[2023-03-15 22:45:51] [INFO ] Invariant cache hit.
[2023-03-15 22:45:58] [INFO ] Implicit Places using invariants and state equation in 7435 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11471 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 210 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11896 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s213 1), p0:(OR (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s92 1)) (AND (GEQ s0 1) (GEQ s93 1)) (AND (GEQ s0 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 7414 reset in 507 ms.
Product exploration explored 100000 steps with 7396 reset in 501 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2023-03-15 22:46:01] [INFO ] Computed 2464 place invariants in 326 ms
[2023-03-15 22:46:07] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 4559 ms returned sat
[2023-03-15 22:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:46:16] [INFO ] [Real]Absence check using state equation in 9457 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.8 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2875 transition count 442
Applied a total of 5 rules in 435 ms. Remains 2875 /2907 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2875 cols
[2023-03-15 22:46:17] [INFO ] Computed 2436 place invariants in 144 ms
[2023-03-15 22:46:20] [INFO ] Implicit Places using invariants in 3829 ms returned []
[2023-03-15 22:46:20] [INFO ] Invariant cache hit.
[2023-03-15 22:46:29] [INFO ] Implicit Places using invariants and state equation in 8568 ms returned []
Implicit Place search using SMT with State Equation took 12401 ms to find 0 implicit places.
[2023-03-15 22:46:29] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 22:46:29] [INFO ] Invariant cache hit.
[2023-03-15 22:46:30] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13905 ms. Remains : 2875/2907 places, 442/446 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2023-03-15 22:46:31] [INFO ] Invariant cache hit.
[2023-03-15 22:46:36] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3955 ms returned sat
[2023-03-15 22:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:46:46] [INFO ] [Real]Absence check using state equation in 10000 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7502 reset in 446 ms.
Product exploration explored 100000 steps with 7401 reset in 462 ms.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 2034 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.5 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1977 transition count 328
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1977 transition count 328
Applied a total of 115 rules in 215 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-15 22:46:47] [INFO ] Computed 1652 place invariants in 20 ms
[2023-03-15 22:46:49] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2023-03-15 22:46:49] [INFO ] Invariant cache hit.
[2023-03-15 22:46:53] [INFO ] Implicit Places using invariants and state equation in 3859 ms returned []
Implicit Place search using SMT with State Equation took 6079 ms to find 0 implicit places.
[2023-03-15 22:46:53] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-15 22:46:53] [INFO ] Invariant cache hit.
[2023-03-15 22:46:54] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1977/2875 places, 328/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6982 ms. Remains : 1977/2875 places, 328/442 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 67572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2904 transition count 442
Applied a total of 4 rules in 622 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-15 22:46:55] [INFO ] Computed 2464 place invariants in 32 ms
[2023-03-15 22:46:58] [INFO ] Implicit Places using invariants in 3901 ms returned []
[2023-03-15 22:46:58] [INFO ] Invariant cache hit.
[2023-03-15 22:47:06] [INFO ] Implicit Places using invariants and state equation in 7135 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2825]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11040 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 206 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11869 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s140 1) (LT s2742 1)) (OR (LT s154 1) (LT s2732 1)) (OR (LT s156 1) (LT s2758 1)) (OR (LT s165 1) (LT s2751 1)) (OR (LT s139 1) (LT s2733 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5126 reset in 743 ms.
Product exploration explored 100000 steps with 5312 reset in 746 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 283 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 2846 cols
[2023-03-15 22:47:09] [INFO ] Computed 2408 place invariants in 518 ms
[2023-03-15 22:47:10] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 477 ms returned sat
[2023-03-15 22:47:10] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:47:10] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 495 ms returned sat
[2023-03-15 22:47:11] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:47:12] [INFO ] After 1076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-15 22:47:12] [INFO ] After 1989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-15 22:47:12] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 20005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 100 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:47:14] [INFO ] Computed 2492 place invariants in 35 ms
[2023-03-15 22:47:17] [INFO ] Implicit Places using invariants in 2901 ms returned []
[2023-03-15 22:47:17] [INFO ] Invariant cache hit.
[2023-03-15 22:47:22] [INFO ] Implicit Places using invariants and state equation in 5262 ms returned []
Implicit Place search using SMT with State Equation took 8170 ms to find 0 implicit places.
[2023-03-15 22:47:22] [INFO ] Invariant cache hit.
[2023-03-15 22:47:23] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9360 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s1837 1) (GEQ s1838 1) (GEQ s1839 1) (GEQ s1841 1) (GEQ s1842 1) (GEQ s1843 1) (GEQ s1844 1) (GEQ s1845 1) (GEQ s1846 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 9554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.13 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 440 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-15 22:47:24] [INFO ] Computed 2464 place invariants in 39 ms
[2023-03-15 22:47:28] [INFO ] Implicit Places using invariants in 4118 ms returned []
[2023-03-15 22:47:28] [INFO ] Invariant cache hit.
[2023-03-15 22:47:35] [INFO ] Implicit Places using invariants and state equation in 7217 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11338 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 215 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11994 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], 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 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-07 finished in 12087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(F(p1)))))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 198 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:47:36] [INFO ] Computed 2492 place invariants in 39 ms
[2023-03-15 22:47:40] [INFO ] Implicit Places using invariants in 3975 ms returned []
[2023-03-15 22:47:40] [INFO ] Invariant cache hit.
[2023-03-15 22:47:47] [INFO ] Implicit Places using invariants and state equation in 7199 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11177 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 186 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11561 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s104 1), p0:(LT s86 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3024 reset in 280 ms.
Product exploration explored 100000 steps with 3021 reset in 297 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 904587 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 904587 steps, saw 115127 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-15 22:47:53] [INFO ] Computed 2464 place invariants in 278 ms
[2023-03-15 22:47:53] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 511 ms returned sat
[2023-03-15 22:47:55] [INFO ] After 951ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:47:55] [INFO ] After 1165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-15 22:47:55] [INFO ] After 2296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:47:56] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 494 ms returned sat
[2023-03-15 22:47:57] [INFO ] After 1067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 22:47:57] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-03-15 22:47:58] [INFO ] After 2788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 377 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 200 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:47:59] [INFO ] Invariant cache hit.
[2023-03-15 22:48:02] [INFO ] Implicit Places using invariants in 3855 ms returned []
[2023-03-15 22:48:02] [INFO ] Invariant cache hit.
[2023-03-15 22:48:09] [INFO ] Implicit Places using invariants and state equation in 6794 ms returned []
Implicit Place search using SMT with State Equation took 10675 ms to find 0 implicit places.
[2023-03-15 22:48:09] [INFO ] Invariant cache hit.
[2023-03-15 22:48:10] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11940 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1061283 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1061283 steps, saw 134856 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 22:48:14] [INFO ] Invariant cache hit.
[2023-03-15 22:48:15] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 495 ms returned sat
[2023-03-15 22:48:16] [INFO ] After 949ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:48:17] [INFO ] After 1198ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-15 22:48:17] [INFO ] After 2300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:48:18] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 490 ms returned sat
[2023-03-15 22:48:19] [INFO ] After 1069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 22:48:19] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-15 22:48:19] [INFO ] After 2741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3030 reset in 281 ms.
Product exploration explored 100000 steps with 3022 reset in 310 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.8 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1979 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1979 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 1979 transition count 332
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 117 rules in 415 ms. Remains 1979 /2907 variables (removed 928) and now considering 332/446 (removed 114) transitions.
[2023-03-15 22:48:22] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 332 rows 1979 cols
[2023-03-15 22:48:22] [INFO ] Computed 1652 place invariants in 12 ms
[2023-03-15 22:48:23] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1979/2907 places, 332/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1266 ms. Remains : 1979/2907 places, 332/446 transitions.
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 167 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-15 22:48:23] [INFO ] Computed 2464 place invariants in 281 ms
[2023-03-15 22:48:27] [INFO ] Implicit Places using invariants in 4138 ms returned []
[2023-03-15 22:48:27] [INFO ] Invariant cache hit.
[2023-03-15 22:48:34] [INFO ] Implicit Places using invariants and state equation in 7353 ms returned []
Implicit Place search using SMT with State Equation took 11513 ms to find 0 implicit places.
[2023-03-15 22:48:34] [INFO ] Invariant cache hit.
[2023-03-15 22:48:35] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12716 ms. Remains : 2907/2907 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 59821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||F(p1)))))'
Support contains 62 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 145 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:48:36] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-15 22:48:39] [INFO ] Implicit Places using invariants in 3933 ms returned []
[2023-03-15 22:48:39] [INFO ] Invariant cache hit.
[2023-03-15 22:48:46] [INFO ] Implicit Places using invariants and state equation in 6505 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 10461 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2936 places, 446/446 transitions.
Applied a total of 0 rules in 142 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10749 ms. Remains : 2908/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (AND (GEQ s67 1) (GEQ s1909 1) (GEQ s1948 1) (GEQ s1972 1) (GEQ s2000 1) (GEQ s2031 1) (GEQ s2062 1) (GEQ s2098 1) (GEQ s2135 1) (GEQ s2162 1) (GEQ...], 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]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 10949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 155 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:48:46] [INFO ] Invariant cache hit.
[2023-03-15 22:48:50] [INFO ] Implicit Places using invariants in 3759 ms returned []
[2023-03-15 22:48:50] [INFO ] Invariant cache hit.
[2023-03-15 22:48:57] [INFO ] Implicit Places using invariants and state equation in 6363 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10125 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10430 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s0 1) (LT s142 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 241 steps with 7 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 10595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X(G(p2)))))&&p0)))'
Support contains 4 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:48:57] [INFO ] Invariant cache hit.
[2023-03-15 22:49:01] [INFO ] Implicit Places using invariants in 3754 ms returned []
[2023-03-15 22:49:01] [INFO ] Invariant cache hit.
[2023-03-15 22:49:08] [INFO ] Implicit Places using invariants and state equation in 6713 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10470 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 144 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10763 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s0 1) (GEQ s41 1)), p1:(GEQ s213 1), p2:(GEQ s45 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-11 finished in 10989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1&&(p2 U p3)))))'
Support contains 34 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2936 transition count 446
Applied a total of 2 rules in 346 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:49:08] [INFO ] Computed 2492 place invariants in 34 ms
[2023-03-15 22:49:12] [INFO ] Implicit Places using invariants in 4137 ms returned []
[2023-03-15 22:49:12] [INFO ] Invariant cache hit.
[2023-03-15 22:49:19] [INFO ] Implicit Places using invariants and state equation in 6468 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10610 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 179 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11135 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s213 1) (AND (GEQ s0 1) (GEQ s152 1))), p3:(AND (GEQ s217 1) (GEQ s2876 1) (GEQ s2879 1) (GEQ s2880 1) (GEQ s2881 1) (GEQ s2882 1) (GEQ s2883 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 11302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 157 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:49:19] [INFO ] Computed 2492 place invariants in 34 ms
[2023-03-15 22:49:24] [INFO ] Implicit Places using invariants in 4308 ms returned []
[2023-03-15 22:49:24] [INFO ] Invariant cache hit.
[2023-03-15 22:49:31] [INFO ] Implicit Places using invariants and state equation in 7183 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11492 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11798 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s212 1), p1:(GEQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-15 finished in 11903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-04
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.16 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2904 transition count 442
Applied a total of 5 rules in 332 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-15 22:49:32] [INFO ] Computed 2464 place invariants in 33 ms
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants in 3949 ms returned []
[2023-03-15 22:49:36] [INFO ] Invariant cache hit.
[2023-03-15 22:49:44] [INFO ] Implicit Places using invariants and state equation in 8747 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12702 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2875/2936 places, 442/446 transitions.
Applied a total of 0 rules in 175 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13211 ms. Remains : 2875/2936 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s211 1), p0:(OR (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s92 1)) (AND (GEQ s0 1) (GEQ s93 1)) (AND (GEQ s0 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 7437 reset in 448 ms.
Product exploration explored 100000 steps with 7437 reset in 487 ms.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
// Phase 1: matrix 442 rows 2875 cols
[2023-03-15 22:49:47] [INFO ] Computed 2436 place invariants in 137 ms
[2023-03-15 22:49:52] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3759 ms returned sat
[2023-03-15 22:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:50:02] [INFO ] [Real]Absence check using state equation in 10180 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2875 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Applied a total of 0 rules in 161 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-15 22:50:02] [INFO ] Invariant cache hit.
[2023-03-15 22:50:06] [INFO ] Implicit Places using invariants in 3772 ms returned []
[2023-03-15 22:50:06] [INFO ] Invariant cache hit.
[2023-03-15 22:50:14] [INFO ] Implicit Places using invariants and state equation in 8215 ms returned []
Implicit Place search using SMT with State Equation took 11990 ms to find 0 implicit places.
[2023-03-15 22:50:14] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-15 22:50:14] [INFO ] Invariant cache hit.
[2023-03-15 22:50:15] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13207 ms. Remains : 2875/2875 places, 442/442 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2023-03-15 22:50:16] [INFO ] Invariant cache hit.
[2023-03-15 22:50:21] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4059 ms returned sat
[2023-03-15 22:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-15 22:50:31] [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: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 62 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7524 reset in 432 ms.
Product exploration explored 100000 steps with 7396 reset in 443 ms.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 2034 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.5 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1977 transition count 328
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1977 transition count 328
Applied a total of 115 rules in 164 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-15 22:50:32] [INFO ] Computed 1652 place invariants in 20 ms
[2023-03-15 22:50:34] [INFO ] Implicit Places using invariants in 2261 ms returned []
[2023-03-15 22:50:34] [INFO ] Invariant cache hit.
[2023-03-15 22:50:38] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 6361 ms to find 0 implicit places.
[2023-03-15 22:50:38] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 22:50:38] [INFO ] Invariant cache hit.
[2023-03-15 22:50:39] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1977/2875 places, 328/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7240 ms. Remains : 1977/2875 places, 328/442 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 68090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(F(p1)))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-08
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.8 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 2005 transition count 327
Applied a total of 119 rules in 270 ms. Remains 2005 /2936 variables (removed 931) and now considering 327/446 (removed 119) transitions.
// Phase 1: matrix 327 rows 2005 cols
[2023-03-15 22:50:40] [INFO ] Computed 1680 place invariants in 19 ms
[2023-03-15 22:50:42] [INFO ] Implicit Places using invariants in 2317 ms returned []
[2023-03-15 22:50:42] [INFO ] Invariant cache hit.
[2023-03-15 22:50:48] [INFO ] Implicit Places using invariants and state equation in 5915 ms returned [1068, 1069, 1071, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1708, 1709, 1710, 1711, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1926]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8236 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1947/2936 places, 327/446 transitions.
Applied a total of 0 rules in 89 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8595 ms. Remains : 1947/2936 places, 327/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s47 1), p0:(LT s29 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2816 reset in 314 ms.
Product exploration explored 100000 steps with 2812 reset in 335 ms.
Computed a total of 1947 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1947 transition count 327
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 950204 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 950204 steps, saw 121823 distinct states, run finished after 3003 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 327 rows 1947 cols
[2023-03-15 22:50:53] [INFO ] Computed 1624 place invariants in 13 ms
[2023-03-15 22:50:53] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 306 ms returned sat
[2023-03-15 22:50:54] [INFO ] After 579ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:50:54] [INFO ] After 725ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-15 22:50:54] [INFO ] After 1467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:50:55] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 280 ms returned sat
[2023-03-15 22:50:56] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 22:50:56] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-15 22:50:56] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 126 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 74 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-15 22:50:57] [INFO ] Invariant cache hit.
[2023-03-15 22:50:59] [INFO ] Implicit Places using invariants in 1987 ms returned []
[2023-03-15 22:50:59] [INFO ] Invariant cache hit.
[2023-03-15 22:51:03] [INFO ] Implicit Places using invariants and state equation in 3568 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
[2023-03-15 22:51:03] [INFO ] Invariant cache hit.
[2023-03-15 22:51:03] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6322 ms. Remains : 1947/1947 places, 327/327 transitions.
Computed a total of 1947 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1947 transition count 327
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 985066 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985066 steps, saw 126134 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 22:51:07] [INFO ] Invariant cache hit.
[2023-03-15 22:51:08] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 316 ms returned sat
[2023-03-15 22:51:08] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:51:09] [INFO ] After 713ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-15 22:51:09] [INFO ] After 1436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-15 22:51:09] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 296 ms returned sat
[2023-03-15 22:51:10] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 22:51:10] [INFO ] After 885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-15 22:51:10] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2819 reset in 336 ms.
Product exploration explored 100000 steps with 2812 reset in 340 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 93 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-15 22:51:12] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 22:51:12] [INFO ] Invariant cache hit.
[2023-03-15 22:51:13] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 797 ms. Remains : 1947/1947 places, 327/327 transitions.
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 70 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-15 22:51:13] [INFO ] Invariant cache hit.
[2023-03-15 22:51:15] [INFO ] Implicit Places using invariants in 2049 ms returned []
[2023-03-15 22:51:15] [INFO ] Invariant cache hit.
[2023-03-15 22:51:19] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 5960 ms to find 0 implicit places.
[2023-03-15 22:51:19] [INFO ] Invariant cache hit.
[2023-03-15 22:51:20] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6693 ms. Remains : 1947/1947 places, 327/327 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 40433 ms.
[2023-03-15 22:51:20] [INFO ] Flatten gal took : 71 ms
[2023-03-15 22:51:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 22:51:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2936 places, 446 transitions and 6222 arcs took 7 ms.
Total runtime 420767 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-28
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
BK_STOP 1678920838560
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-28-LTLFireability-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 3/32 QuasiCertifProtocol-PT-28-LTLFireability-08 250613 m, 50122 m/sec, 1791541 t fired, .
Time elapsed: 7 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 4/32 QuasiCertifProtocol-PT-28-LTLFireability-08 463730 m, 42623 m/sec, 3626554 t fired, .
Time elapsed: 12 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1799 6/32 QuasiCertifProtocol-PT-28-LTLFireability-08 709625 m, 49179 m/sec, 5450145 t fired, .
Time elapsed: 17 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1799 8/32 QuasiCertifProtocol-PT-28-LTLFireability-08 918140 m, 41703 m/sec, 7232951 t fired, .
Time elapsed: 22 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1799 10/32 QuasiCertifProtocol-PT-28-LTLFireability-08 1153754 m, 47122 m/sec, 9023172 t fired, .
Time elapsed: 27 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1799 11/32 QuasiCertifProtocol-PT-28-LTLFireability-08 1362868 m, 41822 m/sec, 10791081 t fired, .
Time elapsed: 32 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1799 13/32 QuasiCertifProtocol-PT-28-LTLFireability-08 1593607 m, 46147 m/sec, 12573769 t fired, .
Time elapsed: 37 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1799 15/32 QuasiCertifProtocol-PT-28-LTLFireability-08 1802302 m, 41739 m/sec, 14338969 t fired, .
Time elapsed: 42 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1799 17/32 QuasiCertifProtocol-PT-28-LTLFireability-08 2028666 m, 45272 m/sec, 16104059 t fired, .
Time elapsed: 47 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1799 18/32 QuasiCertifProtocol-PT-28-LTLFireability-08 2234838 m, 41234 m/sec, 17853765 t fired, .
Time elapsed: 52 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1799 20/32 QuasiCertifProtocol-PT-28-LTLFireability-08 2458451 m, 44722 m/sec, 19612994 t fired, .
Time elapsed: 57 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1799 22/32 QuasiCertifProtocol-PT-28-LTLFireability-08 2661463 m, 40602 m/sec, 21354520 t fired, .
Time elapsed: 62 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1799 24/32 QuasiCertifProtocol-PT-28-LTLFireability-08 2888526 m, 45412 m/sec, 23136658 t fired, .
Time elapsed: 67 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1799 25/32 QuasiCertifProtocol-PT-28-LTLFireability-08 3088376 m, 39970 m/sec, 24910250 t fired, .
Time elapsed: 72 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1799 27/32 QuasiCertifProtocol-PT-28-LTLFireability-08 3316318 m, 45588 m/sec, 26705387 t fired, .
Time elapsed: 77 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1799 29/32 QuasiCertifProtocol-PT-28-LTLFireability-08 3524806 m, 41697 m/sec, 28471311 t fired, .
Time elapsed: 82 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1799 30/32 QuasiCertifProtocol-PT-28-LTLFireability-08 3737792 m, 42597 m/sec, 30204549 t fired, .
Time elapsed: 87 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1799 32/32 QuasiCertifProtocol-PT-28-LTLFireability-08 3946436 m, 41728 m/sec, 31949399 t fired, .
Time elapsed: 92 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-PT-28-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 97 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-28-LTLFireability-04
lola: time limit : 3503 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3503 4/32 QuasiCertifProtocol-PT-28-LTLFireability-04 444497 m, 88899 m/sec, 1637889 t fired, .
Time elapsed: 102 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3503 7/32 QuasiCertifProtocol-PT-28-LTLFireability-04 800623 m, 71225 m/sec, 3273151 t fired, .
Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3503 10/32 QuasiCertifProtocol-PT-28-LTLFireability-04 1203069 m, 80489 m/sec, 4913870 t fired, .
Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3503 13/32 QuasiCertifProtocol-PT-28-LTLFireability-04 1559989 m, 71384 m/sec, 6542810 t fired, .
Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3503 15/32 QuasiCertifProtocol-PT-28-LTLFireability-04 1881539 m, 64310 m/sec, 8151538 t fired, .
Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3503 18/32 QuasiCertifProtocol-PT-28-LTLFireability-04 2169470 m, 57586 m/sec, 9743197 t fired, .
Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3503 21/32 QuasiCertifProtocol-PT-28-LTLFireability-04 2557400 m, 77586 m/sec, 11370699 t fired, .
Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3503 24/32 QuasiCertifProtocol-PT-28-LTLFireability-04 2911753 m, 70870 m/sec, 12993838 t fired, .
Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3503 26/32 QuasiCertifProtocol-PT-28-LTLFireability-04 3246467 m, 66942 m/sec, 14626100 t fired, .
Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3503 29/32 QuasiCertifProtocol-PT-28-LTLFireability-04 3537611 m, 58228 m/sec, 16229671 t fired, .
Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3503 31/32 QuasiCertifProtocol-PT-28-LTLFireability-04 3878347 m, 68147 m/sec, 17846108 t fired, .
Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-PT-28-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-28-LTLFireability-04: LTL unknown AGGR
QuasiCertifProtocol-PT-28-LTLFireability-08: LTL unknown AGGR
Time elapsed: 157 secs. Pages in use: 32
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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-PT-28, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948500900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;