About the Execution of ITS-Tools for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 524.527 | 89722.00 | 130073.00 | 536.40 | TFFFFFFFFFTFTFFF | 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.r101-tall-167814475400459.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 itstools
Input is DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400459
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 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 DES-PT-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678272919074
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 10:55:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 10:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:55:20] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 10:55:20] [INFO ] Transformed 274 places.
[2023-03-08 10:55:20] [INFO ] Transformed 231 transitions.
[2023-03-08 10:55:20] [INFO ] Found NUPN structural information;
[2023-03-08 10:55:20] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-40a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 30 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 10:55:21] [INFO ] Computed 59 place invariants in 24 ms
[2023-03-08 10:55:21] [INFO ] Implicit Places using invariants in 354 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 574 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 21 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 626 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 42 out of 273 places after structural reductions.
[2023-03-08 10:55:21] [INFO ] Flatten gal took : 50 ms
[2023-03-08 10:55:21] [INFO ] Flatten gal took : 23 ms
[2023-03-08 10:55:21] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 36 out of 273 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 10:55:22] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:55:22] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 10:55:22] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 10:55:22] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 10:55:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-08 10:55:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 214 ms returned sat
[2023-03-08 10:55:34] [INFO ] After 10869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 10:55:34] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
[2023-03-08 10:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-08 10:55:34] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-08 10:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 10:55:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-08 10:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 10:55:35] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-08 10:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 10:55:35] [INFO ] After 12494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4067 ms.
[2023-03-08 10:55:40] [INFO ] After 17132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 2 properties in 570 ms.
Support contains 15 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 272 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 272 transition count 215
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 272 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 214
Applied a total of 9 rules in 47 ms. Remains 271 /273 variables (removed 2) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 271/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 811484 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 811484 steps, saw 110355 distinct states, run finished after 3002 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 271 cols
[2023-03-08 10:55:44] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 10:55:44] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:44] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:55:44] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 10:55:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:44] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 49 ms returned sat
[2023-03-08 10:55:44] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 10:55:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:55:44] [INFO ] After 156ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 10:55:45] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-08 10:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 10:55:45] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-08 10:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 10:55:45] [INFO ] After 518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-08 10:55:45] [INFO ] After 1146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 317 ms.
Support contains 15 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 271/271 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 10:55:45] [INFO ] Invariant cache hit.
[2023-03-08 10:55:45] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 10:55:45] [INFO ] Invariant cache hit.
[2023-03-08 10:55:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:55:46] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-08 10:55:46] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 10:55:46] [INFO ] Invariant cache hit.
[2023-03-08 10:55:46] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-08 10:55:46] [INFO ] Invariant cache hit.
[2023-03-08 10:55:46] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:46] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:55:46] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 10:55:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:46] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 67 ms returned sat
[2023-03-08 10:55:47] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 10:55:47] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-08 10:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 10:55:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-08 10:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 10:55:47] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-08 10:55:47] [INFO ] After 969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 176 stabilizing places and 171 stable transitions
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((G(p0)||G(F(p1)))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 32 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:55:47] [INFO ] Computed 58 place invariants in 11 ms
[2023-03-08 10:55:47] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-08 10:55:47] [INFO ] Invariant cache hit.
[2023-03-08 10:55:48] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2023-03-08 10:55:48] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 10:55:48] [INFO ] Invariant cache hit.
[2023-03-08 10:55:48] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 758 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s148 0) (NEQ s18 1)) (EQ s30 0) (EQ s121 1)), p1:(AND (NEQ s235 0) (NEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2298 reset in 366 ms.
Product exploration explored 100000 steps with 2261 reset in 276 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:55:49] [INFO ] Invariant cache hit.
[2023-03-08 10:55:49] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:55:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 10:55:50] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:55:50] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 10:55:50] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1644933 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :{}
Probabilistic random walk after 1644933 steps, saw 230170 distinct states, run finished after 3002 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:55:53] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 10:55:53] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:55:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 10:55:53] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:55:53] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-08 10:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 10:55:53] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 10:55:53] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 10:55:53] [INFO ] Invariant cache hit.
[2023-03-08 10:55:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 10:55:53] [INFO ] Invariant cache hit.
[2023-03-08 10:55:54] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 10:55:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 10:55:54] [INFO ] Invariant cache hit.
[2023-03-08 10:55:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:55:54] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 10:55:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:55:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:55:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 10:55:54] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:55:54] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 10:55:54] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:55:55] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:55:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 10:55:55] [INFO ] Invariant cache hit.
[2023-03-08 10:55:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-08 10:55:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:55:55] [INFO ] Invariant cache hit.
[2023-03-08 10:55:55] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:55:55] [INFO ] Invariant cache hit.
[2023-03-08 10:55:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:55:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:56] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 94 ms returned sat
[2023-03-08 10:55:56] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:55:56] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 10:55:56] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1658802 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :{}
Probabilistic random walk after 1658802 steps, saw 231770 distinct states, run finished after 3001 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:55:59] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 10:55:59] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:55:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:55:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 10:55:59] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:55:59] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2023-03-08 10:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 10:55:59] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:55:59] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 10:55:59] [INFO ] Invariant cache hit.
[2023-03-08 10:56:00] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 10:56:00] [INFO ] Invariant cache hit.
[2023-03-08 10:56:00] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-08 10:56:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 10:56:00] [INFO ] Invariant cache hit.
[2023-03-08 10:56:00] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:56:00] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:56:00] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:56:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:56:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 10:56:00] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:56:00] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:56:00] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2279 reset in 211 ms.
Product exploration explored 100000 steps with 2267 reset in 235 ms.
Built C files in :
/tmp/ltsmin2858848559871409400
[2023-03-08 10:56:01] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2023-03-08 10:56:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:01] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2023-03-08 10:56:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:01] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2023-03-08 10:56:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:01] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2858848559871409400
Running compilation step : cd /tmp/ltsmin2858848559871409400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin2858848559871409400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2858848559871409400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10192170827107552796.hoa' '--buchi-type=spotba'
LTSmin run took 1682 ms.
FORMULA DES-PT-40a-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40a-LTLCardinality-02 finished in 16623 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((G(p0)||G(p1))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 13 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:56:04] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:56:04] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 10:56:04] [INFO ] Invariant cache hit.
[2023-03-08 10:56:04] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-08 10:56:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:56:04] [INFO ] Invariant cache hit.
[2023-03-08 10:56:04] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 624 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s86 1)), p1:(AND (NEQ s80 0) (NEQ s138 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2283 reset in 235 ms.
Product exploration explored 100000 steps with 2265 reset in 290 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 397 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 890091 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 890091 steps, saw 130647 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 10:56:09] [INFO ] Invariant cache hit.
[2023-03-08 10:56:09] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 10:56:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 10:56:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 68 ms returned sat
[2023-03-08 10:56:09] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 10:56:09] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-08 10:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 10:56:09] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-08 10:56:09] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 271 transition count 213
Applied a total of 3 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1063478 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1063478 steps, saw 149554 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:56:13] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 10:56:13] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 10:56:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:56:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 107 ms returned sat
[2023-03-08 10:56:13] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 10:56:13] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-08 10:56:13] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 10:56:13] [INFO ] Invariant cache hit.
[2023-03-08 10:56:13] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 10:56:13] [INFO ] Invariant cache hit.
[2023-03-08 10:56:14] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-08 10:56:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:56:14] [INFO ] Invariant cache hit.
[2023-03-08 10:56:14] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 10:56:14] [INFO ] Invariant cache hit.
[2023-03-08 10:56:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 10:56:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:56:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 10:56:14] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 10:56:14] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-08 10:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 10:56:15] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 10:56:15] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 407 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 271 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 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:56:15] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 10:56:15] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 10:56:15] [INFO ] Invariant cache hit.
[2023-03-08 10:56:16] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-08 10:56:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:56:16] [INFO ] Invariant cache hit.
[2023-03-08 10:56:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 609 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1636756 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1636756 steps, saw 225554 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:56:19] [INFO ] Invariant cache hit.
[2023-03-08 10:56:19] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:56:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:56:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 68 ms returned sat
[2023-03-08 10:56:19] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:56:19] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 10:56:19] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1679841 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :{}
Probabilistic random walk after 1679841 steps, saw 234472 distinct states, run finished after 3003 ms. (steps per millisecond=559 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:56:22] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:56:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:56:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:56:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-08 10:56:23] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:56:23] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 10:56:23] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 10:56:23] [INFO ] Invariant cache hit.
[2023-03-08 10:56:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 10:56:23] [INFO ] Invariant cache hit.
[2023-03-08 10:56:23] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 10:56:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:56:23] [INFO ] Invariant cache hit.
[2023-03-08 10:56:23] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 10:56:23] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 10:56:23] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:56:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:56:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-08 10:56:24] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:56:24] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 10:56:24] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2292 reset in 233 ms.
Product exploration explored 100000 steps with 2303 reset in 217 ms.
Built C files in :
/tmp/ltsmin5294038631843204920
[2023-03-08 10:56:25] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2023-03-08 10:56:25] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:25] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2023-03-08 10:56:25] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:25] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2023-03-08 10:56:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:25] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5294038631843204920
Running compilation step : cd /tmp/ltsmin5294038631843204920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin5294038631843204920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5294038631843204920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7811665436333817195.hoa' '--buchi-type=spotba'
LTSmin run took 969 ms.
FORMULA DES-PT-40a-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40a-LTLCardinality-03 finished in 22239 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' '!(((p0 U !p1) U X(!p2)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 7 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 10:56:26] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:56:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 10:56:26] [INFO ] Invariant cache hit.
[2023-03-08 10:56:27] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-08 10:56:27] [INFO ] Invariant cache hit.
[2023-03-08 10:56:27] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 242 ms :[p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : DES-PT-40a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s165 0) (EQ s39 1)), p0:(OR (EQ s54 0) (EQ s89 1)), p2:(OR (EQ s145 0) (EQ s119 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20019 steps with 3299 reset in 107 ms.
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-04 finished in 977 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(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:56:27] [INFO ] Invariant cache hit.
[2023-03-08 10:56:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 10:56:27] [INFO ] Invariant cache hit.
[2023-03-08 10:56:27] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 10:56:27] [INFO ] Invariant cache hit.
[2023-03-08 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s192 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-05 finished in 671 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(G((F(p1)&&p0)))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 11 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:56:28] [INFO ] Invariant cache hit.
[2023-03-08 10:56:28] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 10:56:28] [INFO ] Invariant cache hit.
[2023-03-08 10:56:28] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-08 10:56:28] [INFO ] Invariant cache hit.
[2023-03-08 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s15 1)), p1:(AND (EQ s49 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-06 finished in 745 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(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:56:28] [INFO ] Invariant cache hit.
[2023-03-08 10:56:29] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 10:56:29] [INFO ] Invariant cache hit.
[2023-03-08 10:56:29] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-08 10:56:29] [INFO ] Invariant cache hit.
[2023-03-08 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s231 0) (EQ s191 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][false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-07 finished in 632 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(p0)&&(p0||X((G(p2)||p1))))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 9 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:56:29] [INFO ] Invariant cache hit.
[2023-03-08 10:56:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 10:56:29] [INFO ] Invariant cache hit.
[2023-03-08 10:56:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-08 10:56:30] [INFO ] Invariant cache hit.
[2023-03-08 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s119 1), p1:(OR (EQ s139 0) (EQ s185 1)), p2:(AND (OR (EQ s197 0) (EQ s251 1)) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23835 reset in 313 ms.
Product exploration explored 100000 steps with 23755 reset in 309 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 223 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-08 10:56:31] [INFO ] Invariant cache hit.
[2023-03-08 10:56:31] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 10:56:31] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 10:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:56:32] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-08 10:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:56:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 10:56:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 129 ms returned sat
[2023-03-08 10:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:56:33] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-08 10:56:33] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-08 10:56:34] [INFO ] Added : 147 causal constraints over 30 iterations in 976 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 272 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 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 25 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:56:34] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:56:34] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-08 10:56:34] [INFO ] Invariant cache hit.
[2023-03-08 10:56:34] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-08 10:56:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:56:34] [INFO ] Invariant cache hit.
[2023-03-08 10:56:34] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 271/272 places, 215/216 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 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 27 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-08 10:56:35] [INFO ] Invariant cache hit.
[2023-03-08 10:56:35] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 10:56:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 10:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:56:35] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-08 10:56:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:56:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 10:56:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 113 ms returned sat
[2023-03-08 10:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:56:36] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2023-03-08 10:56:36] [INFO ] Computed and/alt/rep : 208/325/208 causal constraints (skipped 4 transitions) in 21 ms.
[2023-03-08 10:56:37] [INFO ] Added : 161 causal constraints over 33 iterations in 927 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22884 reset in 246 ms.
Product exploration explored 100000 steps with 22859 reset in 254 ms.
Built C files in :
/tmp/ltsmin10151281354269558184
[2023-03-08 10:56:38] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2023-03-08 10:56:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:38] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2023-03-08 10:56:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:38] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2023-03-08 10:56:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:56:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10151281354269558184
Running compilation step : cd /tmp/ltsmin10151281354269558184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 457 ms.
Running link step : cd /tmp/ltsmin10151281354269558184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10151281354269558184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased599342585108270804.hoa' '--buchi-type=spotba'
LTSmin run took 569 ms.
FORMULA DES-PT-40a-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40a-LTLCardinality-10 finished in 9868 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(p1)))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 14 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 10:56:39] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:56:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 10:56:39] [INFO ] Invariant cache hit.
[2023-03-08 10:56:39] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 10:56:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:56:39] [INFO ] Invariant cache hit.
[2023-03-08 10:56:39] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s267 0) (NEQ s221 1)), p1:(OR (EQ s271 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 440 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-12 finished in 1838 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))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 16 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 10:56:41] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:56:41] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 10:56:41] [INFO ] Invariant cache hit.
[2023-03-08 10:56:41] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-08 10:56:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:56:41] [INFO ] Invariant cache hit.
[2023-03-08 10:56:41] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-13 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}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2275 reset in 202 ms.
Product exploration explored 100000 steps with 2279 reset in 215 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1640501 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1640501 steps, saw 225957 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:56:45] [INFO ] Invariant cache hit.
[2023-03-08 10:56:45] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:56:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:56:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-08 10:56:46] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:56:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-08 10:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-08 10:56:46] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 10:56:46] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1725 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=246 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-13 finished in 4980 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(p0)&&X(G(p1)))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 10:56:46] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:56:46] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-08 10:56:46] [INFO ] Invariant cache hit.
[2023-03-08 10:56:47] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-08 10:56:47] [INFO ] Invariant cache hit.
[2023-03-08 10:56:47] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (NEQ s80 0) (NEQ s261 1)), p0:(AND (EQ s265 0) (EQ s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-15 finished in 1517 ms.
All properties solved by simple procedures.
Total runtime 87243 ms.
BK_STOP 1678273008796
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DES-PT-40a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-40a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;