About the Execution of LTSMin+red for TokenRing-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16185.428 | 2868534.00 | 8463520.00 | 76349.00 | TTF?T?FFFFF?TFT? | 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.r489-tall-167912707100676.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 ltsminxred
Input is TokenRing-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 130M
-rw-r--r-- 1 mcc users 700K Feb 25 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 25 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 25 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 20M Feb 25 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 823K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 725K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17M Feb 25 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62M Feb 25 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.0M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-020-LTLFireability-00
FORMULA_NAME TokenRing-PT-020-LTLFireability-01
FORMULA_NAME TokenRing-PT-020-LTLFireability-02
FORMULA_NAME TokenRing-PT-020-LTLFireability-03
FORMULA_NAME TokenRing-PT-020-LTLFireability-04
FORMULA_NAME TokenRing-PT-020-LTLFireability-05
FORMULA_NAME TokenRing-PT-020-LTLFireability-06
FORMULA_NAME TokenRing-PT-020-LTLFireability-07
FORMULA_NAME TokenRing-PT-020-LTLFireability-08
FORMULA_NAME TokenRing-PT-020-LTLFireability-09
FORMULA_NAME TokenRing-PT-020-LTLFireability-10
FORMULA_NAME TokenRing-PT-020-LTLFireability-11
FORMULA_NAME TokenRing-PT-020-LTLFireability-12
FORMULA_NAME TokenRing-PT-020-LTLFireability-13
FORMULA_NAME TokenRing-PT-020-LTLFireability-14
FORMULA_NAME TokenRing-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679298869825
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:54:32] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2023-03-20 07:54:32] [INFO ] Transformed 441 places.
[2023-03-20 07:54:32] [INFO ] Transformed 8421 transitions.
[2023-03-20 07:54:32] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 238 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TokenRing-PT-020-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 296 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:54:41] [INFO ] Computed 21 place invariants in 52 ms
[2023-03-20 07:54:42] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-20 07:54:42] [INFO ] Invariant cache hit.
[2023-03-20 07:54:42] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2023-03-20 07:54:42] [INFO ] Invariant cache hit.
[2023-03-20 07:54:45] [INFO ] Dead Transitions using invariants and state equation in 2523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3981 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 441 out of 441 places after structural reductions.
[2023-03-20 07:54:46] [INFO ] Flatten gal took : 624 ms
[2023-03-20 07:54:50] [INFO ] Flatten gal took : 701 ms
[2023-03-20 07:54:54] [INFO ] Input system was already deterministic with 8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4102 ms. (steps per millisecond=2 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4885 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4638 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3577 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3584 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3767 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3605 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3484 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3847 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3440 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3431 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3795 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3300 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-20 07:55:44] [INFO ] Invariant cache hit.
[2023-03-20 07:56:01] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-20 07:56:02] [INFO ] After 1286ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:10
[2023-03-20 07:56:02] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:56:04] [INFO ] After 1524ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-20 07:56:04] [INFO ] After 3507ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-20 07:56:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-20 07:56:07] [INFO ] After 2541ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-20 07:56:15] [INFO ] After 8511ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2023-03-20 07:56:19] [INFO ] After 12046ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 2486 ms.
[2023-03-20 07:56:21] [INFO ] After 17694ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 967 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3631 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3952 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3003 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3029 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2910 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2813 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2801 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2831 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2803 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2886 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 2779 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 620922 steps, run timeout after 109983 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 620922 steps, saw 115935 distinct states, run finished after 111007 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-20 07:58:47] [INFO ] Invariant cache hit.
[2023-03-20 08:00:23] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-20 08:00:26] [INFO ] After 2992ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-20 08:00:26] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:00:28] [INFO ] After 1557ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 08:00:28] [INFO ] After 5637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 08:00:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-20 08:00:32] [INFO ] After 2910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 08:00:41] [INFO ] After 9322ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 08:00:42] [INFO ] Deduced a trap composed of 246 places in 929 ms of which 8 ms to minimize.
[2023-03-20 08:00:43] [INFO ] Deduced a trap composed of 243 places in 502 ms of which 2 ms to minimize.
[2023-03-20 08:00:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2070 ms
[2023-03-20 08:00:46] [INFO ] After 14742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2270 ms.
[2023-03-20 08:00:49] [INFO ] After 20771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 935 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 125 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 164 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:00:50] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-20 08:00:50] [INFO ] Invariant cache hit.
[2023-03-20 08:00:51] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-20 08:00:52] [INFO ] Redundant transitions in 1463 ms returned []
[2023-03-20 08:00:52] [INFO ] Invariant cache hit.
[2023-03-20 08:00:54] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4676 ms. Remains : 441/441 places, 8421/8421 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(X(X(F(p0))))'
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:00:56] [INFO ] Invariant cache hit.
[2023-03-20 08:00:56] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 08:00:56] [INFO ] Invariant cache hit.
[2023-03-20 08:00:56] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2023-03-20 08:00:56] [INFO ] Invariant cache hit.
[2023-03-20 08:00:59] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3100 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 475 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s149 1) (GEQ s378 1)) (AND (GEQ s281 1) (GEQ s440 1)) (AND (GEQ s280 1) (GEQ s361 1)) (AND (GEQ s166 1) (GEQ s340 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1414 ms.
Product exploration explored 100000 steps with 33333 reset in 1044 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-020-LTLFireability-01 finished in 6411 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((X(p0)&&F((G(F(!p1))||(F(!p1)&&G(!p0)))))))'
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:01:02] [INFO ] Invariant cache hit.
[2023-03-20 08:01:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 08:01:02] [INFO ] Invariant cache hit.
[2023-03-20 08:01:03] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:05] [INFO ] Dead Transitions using invariants and state equation in 2437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3255 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) p1), (NOT p0), p1, true]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s149 1) (GEQ s378 1)) (AND (GEQ s281 1) (GEQ s440 1)) (AND (GEQ s280 1) (GEQ s361 1)) (AND (GEQ s166 1) (GEQ s340 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA TokenRing-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-020-LTLFireability-02 finished in 3574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 224 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:01:06] [INFO ] Invariant cache hit.
[2023-03-20 08:01:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 08:01:06] [INFO ] Invariant cache hit.
[2023-03-20 08:01:07] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-20 08:01:08] [INFO ] Redundant transitions in 946 ms returned []
[2023-03-20 08:01:08] [INFO ] Invariant cache hit.
[2023-03-20 08:01:10] [INFO ] Dead Transitions using invariants and state equation in 2218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s149 1) (GEQ s378 1)) (AND (GEQ s281 1) (GEQ s440 1)) (AND (GEQ s280 1) (GEQ s361 1)) (AND (GEQ s166 1) (GEQ s340 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 65420 steps with 715 reset in 10001 ms.
Product exploration timeout after 65120 steps with 712 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 163 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:01:31] [INFO ] Invariant cache hit.
[2023-03-20 08:01:31] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-20 08:01:31] [INFO ] Invariant cache hit.
[2023-03-20 08:01:32] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-20 08:01:33] [INFO ] Redundant transitions in 1410 ms returned []
[2023-03-20 08:01:33] [INFO ] Invariant cache hit.
[2023-03-20 08:01:35] [INFO ] Dead Transitions using invariants and state equation in 2114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4560 ms. Remains : 441/441 places, 8421/8421 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 219 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 66130 steps with 709 reset in 10001 ms.
Product exploration timeout after 66680 steps with 722 reset in 10001 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 143 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:01:57] [INFO ] Invariant cache hit.
[2023-03-20 08:01:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 08:01:57] [INFO ] Invariant cache hit.
[2023-03-20 08:01:57] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-20 08:01:59] [INFO ] Redundant transitions in 1405 ms returned []
[2023-03-20 08:01:59] [INFO ] Invariant cache hit.
[2023-03-20 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4588 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLFireability-03 finished in 57012 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)))'
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 178 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:02:03] [INFO ] Invariant cache hit.
[2023-03-20 08:02:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 08:02:03] [INFO ] Invariant cache hit.
[2023-03-20 08:02:03] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2023-03-20 08:02:05] [INFO ] Redundant transitions in 1400 ms returned []
[2023-03-20 08:02:05] [INFO ] Invariant cache hit.
[2023-03-20 08:02:07] [INFO ] Dead Transitions using invariants and state equation in 2502 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4911 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (OR (LT s149 1) (LT s378 1)) (OR (LT s281 1) (LT s440 1)) (OR (LT s280 1) (LT s361 1)) (OR (LT s166 1) (LT s340 1)) (OR (LT s161 1) (LT s286 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 18690 steps with 0 reset in 10002 ms.
Product exploration timeout after 18660 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3250 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3621 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187657 steps, run timeout after 18001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 187657 steps, saw 39146 distinct states, run finished after 18001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:02:53] [INFO ] Invariant cache hit.
[2023-03-20 08:03:04] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 08:03:06] [INFO ] After 1360ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:03:06] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:03:07] [INFO ] After 1317ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:03:07] [INFO ] After 3058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:03:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 08:03:09] [INFO ] After 1653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:03:12] [INFO ] After 3371ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:03:13] [INFO ] After 3899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-20 08:03:13] [INFO ] After 6229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 116 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3317 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4245 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238350 steps, run timeout after 21001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 238350 steps, saw 48253 distinct states, run finished after 21003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:03:42] [INFO ] Invariant cache hit.
[2023-03-20 08:03:50] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 08:03:51] [INFO ] After 1302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:03:52] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:03:53] [INFO ] After 1328ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:03:53] [INFO ] After 3018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:03:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 08:03:54] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:03:57] [INFO ] After 2990ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:03:58] [INFO ] After 3437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-20 08:03:58] [INFO ] After 5318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 140 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 106 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 106 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:03:59] [INFO ] Invariant cache hit.
[2023-03-20 08:03:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 08:03:59] [INFO ] Invariant cache hit.
[2023-03-20 08:04:00] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2023-03-20 08:04:01] [INFO ] Redundant transitions in 1407 ms returned []
[2023-03-20 08:04:01] [INFO ] Invariant cache hit.
[2023-03-20 08:04:03] [INFO ] Dead Transitions using invariants and state equation in 2363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4817 ms. Remains : 441/441 places, 8421/8421 transitions.
Drop transitions removed 7511 transitions
Redundant transition composition rules discarded 7511 transitions
Iterating global reduction 0 with 7511 rules applied. Total rules applied 7511 place count 441 transition count 910
Applied a total of 7511 rules in 96 ms. Remains 441 /441 variables (removed 0) and now considering 910/8421 (removed 7511) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 910 rows 441 cols
[2023-03-20 08:04:04] [INFO ] Computed 21 place invariants in 41 ms
[2023-03-20 08:04:11] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 08:04:57] [INFO ] After 45446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 823 ms :[(NOT p0)]
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 159 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:04:58] [INFO ] Computed 21 place invariants in 27 ms
[2023-03-20 08:04:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 08:04:58] [INFO ] Invariant cache hit.
[2023-03-20 08:04:59] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-20 08:05:00] [INFO ] Redundant transitions in 1440 ms returned []
[2023-03-20 08:05:00] [INFO ] Invariant cache hit.
[2023-03-20 08:05:03] [INFO ] Dead Transitions using invariants and state equation in 2389 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4981 ms. Remains : 441/441 places, 8421/8421 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 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 46 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3419 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4391 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233680 steps, run timeout after 21001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 233680 steps, saw 47439 distinct states, run finished after 21001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:05:32] [INFO ] Invariant cache hit.
[2023-03-20 08:05:40] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 08:05:42] [INFO ] After 1584ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:05:42] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:05:43] [INFO ] After 1420ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:05:43] [INFO ] After 3368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:05:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 08:05:45] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:05:48] [INFO ] After 3073ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:05:49] [INFO ] After 3555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-20 08:05:49] [INFO ] After 5412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 159 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3198 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4082 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230356 steps, run timeout after 21001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 230356 steps, saw 46854 distinct states, run finished after 21001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:06:17] [INFO ] Invariant cache hit.
[2023-03-20 08:06:28] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 08:06:30] [INFO ] After 1413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:06:30] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:06:31] [INFO ] After 1296ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:06:31] [INFO ] After 3126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:06:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 08:06:33] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:06:36] [INFO ] After 2862ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:06:36] [INFO ] After 3321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-20 08:06:37] [INFO ] After 5297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 135 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 184 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:06:37] [INFO ] Invariant cache hit.
[2023-03-20 08:06:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 08:06:37] [INFO ] Invariant cache hit.
[2023-03-20 08:06:38] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2023-03-20 08:06:39] [INFO ] Redundant transitions in 1425 ms returned []
[2023-03-20 08:06:39] [INFO ] Invariant cache hit.
[2023-03-20 08:06:42] [INFO ] Dead Transitions using invariants and state equation in 2082 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4644 ms. Remains : 441/441 places, 8421/8421 transitions.
Drop transitions removed 7511 transitions
Redundant transition composition rules discarded 7511 transitions
Iterating global reduction 0 with 7511 rules applied. Total rules applied 7511 place count 441 transition count 910
Applied a total of 7511 rules in 29 ms. Remains 441 /441 variables (removed 0) and now considering 910/8421 (removed 7511) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 910 rows 441 cols
[2023-03-20 08:06:42] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 08:06:52] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-20 08:07:36] [INFO ] After 45154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration timeout after 18580 steps with 0 reset in 10002 ms.
Product exploration timeout after 18860 steps with 0 reset in 10007 ms.
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 133 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:07:57] [INFO ] Computed 21 place invariants in 24 ms
[2023-03-20 08:07:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-20 08:07:57] [INFO ] Invariant cache hit.
[2023-03-20 08:07:58] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2023-03-20 08:07:59] [INFO ] Redundant transitions in 938 ms returned []
[2023-03-20 08:07:59] [INFO ] Invariant cache hit.
[2023-03-20 08:08:01] [INFO ] Dead Transitions using invariants and state equation in 2230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4149 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLFireability-05 finished in 359461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 441 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 12 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:02] [INFO ] Invariant cache hit.
[2023-03-20 08:08:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 08:08:02] [INFO ] Invariant cache hit.
[2023-03-20 08:08:03] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2023-03-20 08:08:03] [INFO ] Invariant cache hit.
[2023-03-20 08:08:05] [INFO ] Dead Transitions using invariants and state equation in 2446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3293 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s149 1) (GEQ s378 1)) (AND (GEQ s281 1) (GEQ s440 1)) (AND (GEQ s280 1) (GEQ s361 1)) (AND (GEQ s166 1) (GEQ s340 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 14 ms.
FORMULA TokenRing-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-020-LTLFireability-06 finished in 3561 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||X(p1)))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 216 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:06] [INFO ] Invariant cache hit.
[2023-03-20 08:08:06] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-20 08:08:06] [INFO ] Invariant cache hit.
[2023-03-20 08:08:08] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2023-03-20 08:08:08] [INFO ] Invariant cache hit.
[2023-03-20 08:08:10] [INFO ] Dead Transitions using invariants and state equation in 2193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4587 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s111 1) (GEQ s431 1)), p0:(AND (GEQ s252 1) (GEQ s427 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TokenRing-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-020-LTLFireability-08 finished in 4758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 375 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:11] [INFO ] Invariant cache hit.
[2023-03-20 08:08:11] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-20 08:08:11] [INFO ] Invariant cache hit.
[2023-03-20 08:08:13] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2023-03-20 08:08:14] [INFO ] Redundant transitions in 960 ms returned []
[2023-03-20 08:08:14] [INFO ] Invariant cache hit.
[2023-03-20 08:08:16] [INFO ] Dead Transitions using invariants and state equation in 2185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5599 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s199 1) (GEQ s425 1)), p1:(AND (GEQ s40 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 738 ms.
Stack based approach found an accepted trace after 505 steps with 0 reset with depth 506 and stack size 506 in 4 ms.
FORMULA TokenRing-PT-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-020-LTLFireability-09 finished in 6482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((X((G(p3)&&p2))&&p1)))))'
Support contains 8 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 139 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:17] [INFO ] Invariant cache hit.
[2023-03-20 08:08:18] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-20 08:08:18] [INFO ] Invariant cache hit.
[2023-03-20 08:08:19] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
[2023-03-20 08:08:19] [INFO ] Invariant cache hit.
[2023-03-20 08:08:22] [INFO ] Dead Transitions using invariants and state equation in 2411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4844 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 561 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (OR (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={1} source=4 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 6}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(AND (GEQ s82 1) (GEQ s351 1)), p1:(AND (GEQ s206 1) (GEQ s315 1)), p2:(AND (GEQ s124 1) (GEQ s230 1)), p3:(AND (GEQ s206 1) (GEQ s315 1) (GEQ s75 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 999 ms.
Stack based approach found an accepted trace after 510 steps with 0 reset with depth 511 and stack size 511 in 6 ms.
FORMULA TokenRing-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-020-LTLFireability-10 finished in 6452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (!p1&&X(G(!p2)))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 100 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:23] [INFO ] Invariant cache hit.
[2023-03-20 08:08:24] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-20 08:08:24] [INFO ] Invariant cache hit.
[2023-03-20 08:08:25] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
[2023-03-20 08:08:25] [INFO ] Invariant cache hit.
[2023-03-20 08:08:28] [INFO ] Dead Transitions using invariants and state equation in 2176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4446 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR p1 p2), p0, p2, (AND p0 (NOT p1) p2)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s252 1) (GEQ s427 1)) (AND (GEQ s54 1) (GEQ s263 1))), p0:(AND (GEQ s252 1) (GEQ s427 1)), p2:(AND (GEQ s14 1) (GEQ s382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 100 reset in 847 ms.
Product exploration explored 100000 steps with 106 reset in 829 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 967 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR p1 p2), p0, p2, (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-20 08:08:32] [INFO ] Invariant cache hit.
[2023-03-20 08:08:32] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:08:33] [INFO ] After 1405ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-20 08:08:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:08:35] [INFO ] After 1299ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-20 08:08:35] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:08:38] [INFO ] After 2923ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-20 08:08:39] [INFO ] After 3666ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 513 ms.
[2023-03-20 08:08:39] [INFO ] After 5653ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 218 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 36641 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36641 steps, saw 8938 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:08:43] [INFO ] Invariant cache hit.
[2023-03-20 08:08:43] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:08:44] [INFO ] After 1437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:08:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:08:46] [INFO ] After 1329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:08:46] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:08:49] [INFO ] After 2993ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:08:50] [INFO ] After 3728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 520 ms.
[2023-03-20 08:08:50] [INFO ] After 5783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 215 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 267 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:08:51] [INFO ] Invariant cache hit.
[2023-03-20 08:08:51] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-20 08:08:51] [INFO ] Invariant cache hit.
[2023-03-20 08:08:53] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2023-03-20 08:08:54] [INFO ] Redundant transitions in 999 ms returned []
[2023-03-20 08:08:54] [INFO ] Invariant cache hit.
[2023-03-20 08:08:56] [INFO ] Dead Transitions using invariants and state equation in 2214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5591 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8219 edges and 441 vertex of which 415 / 441 are part of one of the 20 SCC in 235 ms
Free SCC test removed 395 places
Drop transitions removed 8200 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8390 transitions.
Graph (complete) has 31 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 31 transition count 13
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 12 transition count 12
Applied a total of 40 rules in 262 ms. Remains 12 /441 variables (removed 429) and now considering 12/8421 (removed 8409) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-20 08:08:56] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-20 08:08:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:08:56] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:08:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:08:56] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:08:56] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 08:08:56] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F p0), (F p2), (F p1), (F (AND p0 p1)), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 23 factoid took 1116 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 71 ms :[(OR p2 p1), p2]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 243 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:08:58] [INFO ] Computed 21 place invariants in 40 ms
[2023-03-20 08:08:58] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-20 08:08:58] [INFO ] Invariant cache hit.
[2023-03-20 08:09:00] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-20 08:09:01] [INFO ] Redundant transitions in 1029 ms returned []
[2023-03-20 08:09:01] [INFO ] Invariant cache hit.
[2023-03-20 08:09:03] [INFO ] Dead Transitions using invariants and state equation in 2219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5687 ms. Remains : 441/441 places, 8421/8421 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR p2 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 08:09:04] [INFO ] Invariant cache hit.
[2023-03-20 08:09:04] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:09:06] [INFO ] After 1446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:09:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:09:07] [INFO ] After 1461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:09:07] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:09:12] [INFO ] After 4471ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 08:09:13] [INFO ] After 5766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 870 ms.
[2023-03-20 08:09:14] [INFO ] After 8275ms 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 88 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 231 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 36924 steps, run timeout after 3011 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36924 steps, saw 8996 distinct states, run finished after 3011 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 08:09:18] [INFO ] Invariant cache hit.
[2023-03-20 08:09:18] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:09:19] [INFO ] After 1414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:09:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:09:21] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:09:21] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:09:26] [INFO ] After 4549ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 08:09:27] [INFO ] After 5818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 866 ms.
[2023-03-20 08:09:28] [INFO ] After 8300ms 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 47 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 255 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 207 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:09:28] [INFO ] Invariant cache hit.
[2023-03-20 08:09:29] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-20 08:09:29] [INFO ] Invariant cache hit.
[2023-03-20 08:09:30] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2023-03-20 08:09:31] [INFO ] Redundant transitions in 994 ms returned []
[2023-03-20 08:09:31] [INFO ] Invariant cache hit.
[2023-03-20 08:09:33] [INFO ] Dead Transitions using invariants and state equation in 2135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5420 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8219 edges and 441 vertex of which 415 / 441 are part of one of the 20 SCC in 2 ms
Free SCC test removed 395 places
Drop transitions removed 8200 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8390 transitions.
Graph (complete) has 31 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 31 transition count 13
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 12 transition count 12
Applied a total of 40 rules in 9 ms. Remains 12 /441 variables (removed 429) and now considering 12/8421 (removed 8409) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-20 08:09:33] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-20 08:09:33] [INFO ] [Real]Absence check using 6 positive place invariants in 0 ms returned sat
[2023-03-20 08:09:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:09:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:09:33] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:09:33] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 08:09:33] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 74 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 64 ms :[(OR p2 p1), p2]
Product exploration explored 100000 steps with 0 reset in 882 ms.
Product exploration explored 100000 steps with 0 reset in 796 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 199 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:09:36] [INFO ] Computed 21 place invariants in 19 ms
[2023-03-20 08:09:37] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-20 08:09:37] [INFO ] Invariant cache hit.
[2023-03-20 08:09:38] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-03-20 08:09:39] [INFO ] Redundant transitions in 1013 ms returned []
[2023-03-20 08:09:39] [INFO ] Invariant cache hit.
[2023-03-20 08:09:41] [INFO ] Dead Transitions using invariants and state equation in 2112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5394 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLFireability-11 finished in 78948 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||F(p1)) U p1))'
Support contains 2 out of 441 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 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 318 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:09:42] [INFO ] Invariant cache hit.
[2023-03-20 08:09:43] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-20 08:09:43] [INFO ] Invariant cache hit.
[2023-03-20 08:09:45] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-20 08:09:46] [INFO ] Redundant transitions in 981 ms returned []
[2023-03-20 08:09:46] [INFO ] Invariant cache hit.
[2023-03-20 08:09:48] [INFO ] Dead Transitions using invariants and state equation in 2245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5681 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s208 1) (GEQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 845 ms.
Stack based approach found an accepted trace after 500 steps with 0 reset with depth 501 and stack size 501 in 4 ms.
FORMULA TokenRing-PT-020-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-020-LTLFireability-13 finished in 6604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||X((!p1||(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 107 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:09:49] [INFO ] Invariant cache hit.
[2023-03-20 08:09:49] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-20 08:09:49] [INFO ] Invariant cache hit.
[2023-03-20 08:09:51] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
[2023-03-20 08:09:51] [INFO ] Invariant cache hit.
[2023-03-20 08:09:53] [INFO ] Dead Transitions using invariants and state equation in 2232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4460 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 332 ms :[false, (AND (NOT p0) (NOT p3) p2 p1), false, false, (NOT p0), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s389 1) (GEQ s412 1)), p0:(AND (GEQ s111 1) (GEQ s431 1)), p3:(AND (NOT (AND (GEQ s389 1) (GEQ s412 1))) (NOT (AND (GEQ s46 1) (GEQ s384 1)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 944 ms.
Product exploration explored 100000 steps with 50000 reset in 856 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p3))))
Knowledge based reduction with 16 factoid took 866 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-020-LTLFireability-14 finished in 7518 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(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(!p0)&&(!p0 U (p1||G(!p0))))))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 100 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:09:56] [INFO ] Invariant cache hit.
[2023-03-20 08:09:57] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-20 08:09:57] [INFO ] Invariant cache hit.
[2023-03-20 08:09:58] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-20 08:09:58] [INFO ] Invariant cache hit.
[2023-03-20 08:10:01] [INFO ] Dead Transitions using invariants and state equation in 2224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4394 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 577 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TokenRing-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s84 1) (GEQ s268 1)), p1:(AND (NOT (AND (GEQ s84 1) (GEQ s268 1))) (OR (AND (GEQ s215 1) (GEQ s352 1)) (AND (GEQ s169 1) (GEQ s210 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1755 reset in 838 ms.
Product exploration explored 100000 steps with 1744 reset in 855 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:10:04] [INFO ] Invariant cache hit.
[2023-03-20 08:10:04] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 08:10:05] [INFO ] After 1240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:10:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 08:10:06] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:06] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:10:09] [INFO ] After 2931ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:09] [INFO ] After 3320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-20 08:10:10] [INFO ] After 4915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40009 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40009 steps, saw 9569 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:10:13] [INFO ] Invariant cache hit.
[2023-03-20 08:10:13] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:10:14] [INFO ] After 1233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:10:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:10:16] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:16] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:10:19] [INFO ] After 2927ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:19] [INFO ] After 3298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-20 08:10:19] [INFO ] After 4903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 221 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 209 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:10:20] [INFO ] Invariant cache hit.
[2023-03-20 08:10:20] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-20 08:10:20] [INFO ] Invariant cache hit.
[2023-03-20 08:10:22] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-03-20 08:10:23] [INFO ] Redundant transitions in 1047 ms returned []
[2023-03-20 08:10:23] [INFO ] Invariant cache hit.
[2023-03-20 08:10:25] [INFO ] Dead Transitions using invariants and state equation in 2128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5494 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8341 edges and 441 vertex of which 439 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 418 places
Drop transitions removed 8341 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 8417 transitions.
Graph (complete) has 4 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 7 ms. Remains 4 /441 variables (removed 437) and now considering 4/8421 (removed 8417) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 08:10:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 08:10:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 08:10:25] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:10:25] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 08:10:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 123 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:10:26] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-20 08:10:26] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-20 08:10:26] [INFO ] Invariant cache hit.
[2023-03-20 08:10:28] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-20 08:10:28] [INFO ] Invariant cache hit.
[2023-03-20 08:10:30] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4665 ms. Remains : 441/441 places, 8421/8421 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:10:31] [INFO ] Invariant cache hit.
[2023-03-20 08:10:31] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 08:10:32] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:10:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 08:10:33] [INFO ] After 1117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:33] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:10:37] [INFO ] After 3391ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:37] [INFO ] After 3771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-20 08:10:37] [INFO ] After 5360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 233 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38422 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38422 steps, saw 9278 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:10:41] [INFO ] Invariant cache hit.
[2023-03-20 08:10:41] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:10:42] [INFO ] After 1291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:10:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:10:43] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:43] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:10:46] [INFO ] After 2974ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:10:47] [INFO ] After 3342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-20 08:10:47] [INFO ] After 4937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 200 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 222 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:10:48] [INFO ] Invariant cache hit.
[2023-03-20 08:10:48] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-20 08:10:48] [INFO ] Invariant cache hit.
[2023-03-20 08:10:50] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2023-03-20 08:10:51] [INFO ] Redundant transitions in 1045 ms returned []
[2023-03-20 08:10:51] [INFO ] Invariant cache hit.
[2023-03-20 08:10:53] [INFO ] Dead Transitions using invariants and state equation in 2360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5763 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8341 edges and 441 vertex of which 439 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 418 places
Drop transitions removed 8341 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 8417 transitions.
Graph (complete) has 4 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 7 ms. Remains 4 /441 variables (removed 437) and now considering 4/8421 (removed 8417) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 08:10:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 08:10:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 08:10:53] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 08:10:53] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 08:10:53] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 897 reset in 931 ms.
Product exploration explored 100000 steps with 894 reset in 980 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 338 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:10:57] [INFO ] Redundant transitions in 989 ms returned []
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:10:57] [INFO ] Computed 21 place invariants in 17 ms
[2023-03-20 08:11:00] [INFO ] Dead Transitions using invariants and state equation in 2319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3658 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 110 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:11:00] [INFO ] Invariant cache hit.
[2023-03-20 08:11:00] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-20 08:11:00] [INFO ] Invariant cache hit.
[2023-03-20 08:11:02] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-20 08:11:02] [INFO ] Invariant cache hit.
[2023-03-20 08:11:04] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4583 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLFireability-15 finished in 68900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (!p1&&X(G(!p2)))))'
Found a Lengthening insensitive property : TokenRing-PT-020-LTLFireability-11
Stuttering acceptance computed with spot in 288 ms :[(OR p1 p2), p0, p2, (AND p0 (NOT p1) p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 123 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:11:06] [INFO ] Invariant cache hit.
[2023-03-20 08:11:07] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-20 08:11:07] [INFO ] Invariant cache hit.
[2023-03-20 08:11:08] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
[2023-03-20 08:11:08] [INFO ] Invariant cache hit.
[2023-03-20 08:11:10] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4468 ms. Remains : 441/441 places, 8421/8421 transitions.
Running random walk in product with property : TokenRing-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s252 1) (GEQ s427 1)) (AND (GEQ s54 1) (GEQ s263 1))), p0:(AND (GEQ s252 1) (GEQ s427 1)), p2:(AND (GEQ s14 1) (GEQ s382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 115 reset in 891 ms.
Product exploration explored 100000 steps with 103 reset in 777 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 933 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR p1 p2), p0, p2, (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 08:11:14] [INFO ] Invariant cache hit.
[2023-03-20 08:11:14] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 08:11:16] [INFO ] After 1539ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-20 08:11:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:18] [INFO ] After 1550ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-20 08:11:18] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:11:21] [INFO ] After 3105ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-20 08:11:22] [INFO ] After 4385ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 940 ms.
[2023-03-20 08:11:23] [INFO ] After 7083ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-20 08:11:24] [INFO ] Invariant cache hit.
[2023-03-20 08:11:24] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:25] [INFO ] After 1420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:11:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:27] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:11:27] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:11:30] [INFO ] After 2963ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:11:31] [INFO ] After 3683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 515 ms.
[2023-03-20 08:11:31] [INFO ] After 5690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 196 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 37196 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37196 steps, saw 9041 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:11:35] [INFO ] Invariant cache hit.
[2023-03-20 08:11:35] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:36] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:11:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:38] [INFO ] After 1322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:11:38] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:11:41] [INFO ] After 2963ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:11:41] [INFO ] After 3688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 517 ms.
[2023-03-20 08:11:42] [INFO ] After 5685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 195 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:11:42] [INFO ] Invariant cache hit.
[2023-03-20 08:11:43] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-20 08:11:43] [INFO ] Invariant cache hit.
[2023-03-20 08:11:44] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2023-03-20 08:11:45] [INFO ] Redundant transitions in 1009 ms returned []
[2023-03-20 08:11:45] [INFO ] Invariant cache hit.
[2023-03-20 08:11:47] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5350 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8219 edges and 441 vertex of which 415 / 441 are part of one of the 20 SCC in 1 ms
Free SCC test removed 395 places
Drop transitions removed 8200 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8390 transitions.
Graph (complete) has 31 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 31 transition count 13
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 12 transition count 12
Applied a total of 40 rules in 8 ms. Remains 12 /441 variables (removed 429) and now considering 12/8421 (removed 8409) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-20 08:11:47] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-20 08:11:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:11:47] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:11:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:11:47] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:11:47] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 08:11:47] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F p0), (F p2), (F p1), (F (AND p0 p1)), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 23 factoid took 945 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 76 ms :[(OR p2 p1), p2]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 198 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:11:49] [INFO ] Computed 21 place invariants in 21 ms
[2023-03-20 08:11:49] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-20 08:11:49] [INFO ] Invariant cache hit.
[2023-03-20 08:11:51] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2023-03-20 08:11:52] [INFO ] Redundant transitions in 933 ms returned []
[2023-03-20 08:11:52] [INFO ] Invariant cache hit.
[2023-03-20 08:11:54] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5286 ms. Remains : 441/441 places, 8421/8421 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR p2 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-20 08:11:55] [INFO ] Invariant cache hit.
[2023-03-20 08:11:55] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:56] [INFO ] After 1226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:11:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:11:57] [INFO ] After 1164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:11:57] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:12:00] [INFO ] After 2577ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:12:00] [INFO ] After 2910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-20 08:12:00] [INFO ] After 4449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 194 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40307 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40307 steps, saw 9625 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:12:04] [INFO ] Invariant cache hit.
[2023-03-20 08:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 08:12:05] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:12:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 08:12:06] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:12:06] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:12:09] [INFO ] After 2578ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:12:09] [INFO ] After 2934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-20 08:12:09] [INFO ] After 4457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 213 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 212 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:12:10] [INFO ] Invariant cache hit.
[2023-03-20 08:12:10] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-20 08:12:10] [INFO ] Invariant cache hit.
[2023-03-20 08:12:12] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
[2023-03-20 08:12:13] [INFO ] Redundant transitions in 1050 ms returned []
[2023-03-20 08:12:13] [INFO ] Invariant cache hit.
[2023-03-20 08:12:15] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5695 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8219 edges and 441 vertex of which 415 / 441 are part of one of the 20 SCC in 1 ms
Free SCC test removed 395 places
Drop transitions removed 8200 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8390 transitions.
Graph (complete) has 31 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 31 transition count 13
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 12 transition count 12
Applied a total of 40 rules in 10 ms. Remains 12 /441 variables (removed 429) and now considering 12/8421 (removed 8409) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-20 08:12:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 08:12:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:12:15] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:12:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 08:12:15] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:12:15] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 08:12:15] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F p1), (F p2)]
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 80 ms :[(OR p2 p1), p2]
Stuttering acceptance computed with spot in 83 ms :[(OR p2 p1), p2]
Product exploration explored 100000 steps with 0 reset in 638 ms.
Product exploration explored 100000 steps with 0 reset in 635 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 215 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:12:18] [INFO ] Computed 21 place invariants in 19 ms
[2023-03-20 08:12:18] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-20 08:12:18] [INFO ] Invariant cache hit.
[2023-03-20 08:12:20] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2023-03-20 08:12:21] [INFO ] Redundant transitions in 1013 ms returned []
[2023-03-20 08:12:21] [INFO ] Invariant cache hit.
[2023-03-20 08:12:23] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5655 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLFireability-11 finished in 78316 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(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(!p0)&&(!p0 U (p1||G(!p0))))))))'
[2023-03-20 08:12:24] [INFO ] Flatten gal took : 310 ms
[2023-03-20 08:12:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 67 ms.
[2023-03-20 08:12:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 34 ms.
Total runtime 1072686 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2268/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 8998764 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16162020 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2268/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 9120068 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16114000 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2268/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2268/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TokenRing-PT-020-LTLFireability-03
Could not compute solution for formula : TokenRing-PT-020-LTLFireability-05
Could not compute solution for formula : TokenRing-PT-020-LTLFireability-11
Could not compute solution for formula : TokenRing-PT-020-LTLFireability-15
BK_STOP 1679301738359
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TokenRing-PT-020-LTLFireability-03
ltl formula formula --ltl=/tmp/2268/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.580 real 0.270 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2268/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2268/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2268/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2268/ltl_0_
Killing (15) : 2274 2275 2276 2277 2278
Killing (9) : 2274 2275 2276 2277 2278
ltl formula name TokenRing-PT-020-LTLFireability-05
ltl formula formula --ltl=/tmp/2268/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.300 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2268/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2268/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2268/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2268/ltl_1_
Killing (15) : 2291 2292 2293 2294 2295
Killing (9) : 2291 2292 2293 2294 2295
ltl formula name TokenRing-PT-020-LTLFireability-11
ltl formula formula --ltl=/tmp/2268/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.260 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2268/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2268/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2268/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2268/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name TokenRing-PT-020-LTLFireability-15
ltl formula formula --ltl=/tmp/2268/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.270 user 0.250 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2268/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2268/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2268/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2268/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="TokenRing-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is TokenRing-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707100676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-020.tgz
mv TokenRing-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;