About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.672 | 3138269.00 | 6893485.00 | 8852.30 | T?FFTT?TFFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 05:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 05:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.6M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717199010050
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:43:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:43:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:43:31] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2024-05-31 23:43:31] [INFO ] Transformed 7032 places.
[2024-05-31 23:43:31] [INFO ] Transformed 10855 transitions.
[2024-05-31 23:43:31] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 653 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 77 out of 7032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 7000 transition count 10855
Discarding 1195 places :
Symmetric choice reduction at 1 with 1195 rule applications. Total rules 1227 place count 5805 transition count 9660
Iterating global reduction 1 with 1195 rules applied. Total rules applied 2422 place count 5805 transition count 9660
Discarding 1092 places :
Symmetric choice reduction at 1 with 1092 rule applications. Total rules 3514 place count 4713 transition count 8568
Iterating global reduction 1 with 1092 rules applied. Total rules applied 4606 place count 4713 transition count 8568
Discarding 538 places :
Symmetric choice reduction at 1 with 538 rule applications. Total rules 5144 place count 4175 transition count 7492
Iterating global reduction 1 with 538 rules applied. Total rules applied 5682 place count 4175 transition count 7492
Applied a total of 5682 rules in 3894 ms. Remains 4175 /7032 variables (removed 2857) and now considering 7492/10855 (removed 3363) transitions.
[2024-05-31 23:43:36] [INFO ] Flow matrix only has 6892 transitions (discarded 600 similar events)
// Phase 1: matrix 6892 rows 4175 cols
[2024-05-31 23:43:36] [INFO ] Computed 781 invariants in 541 ms
[2024-05-31 23:43:43] [INFO ] Implicit Places using invariants in 7280 ms returned [4, 8, 12, 14, 16, 21, 28, 37, 48, 61, 76, 93, 112, 133, 156, 180, 204, 206, 208, 229, 248, 265, 280, 293, 304, 313, 320, 325, 328, 346, 349, 350, 351, 354, 359, 366, 375, 386, 399, 414, 431, 450, 471, 493, 516, 517, 536, 553, 571, 584, 595, 604, 611, 616, 619, 621, 632, 639, 642, 643, 644, 646, 649, 654, 661, 670, 681, 694, 709, 726, 745, 765, 785, 786, 787, 804, 819, 832, 843, 852, 859, 864, 867, 869, 871, 882, 889, 892, 893, 894, 896, 898, 901, 906, 913, 922, 933, 946, 961, 978, 996, 1014, 1015, 1016, 1031, 1044, 1055, 1064, 1071, 1076, 1079, 1081, 1083, 1085, 1096, 1103, 1106, 1107, 1108, 1110, 1112, 1114, 1117, 1122, 1129, 1138, 1149, 1162, 1177, 1193, 1209, 1210, 1211, 1224, 1235, 1244, 1251, 1256, 1259, 1261, 1263, 1265, 1267, 1278, 1285, 1288, 1289, 1290, 1292, 1294, 1296, 1298, 1301, 1306, 1313, 1322, 1333, 1346, 1360, 1374, 1375, 1376, 1387, 1396, 1403, 1408, 1411, 1413, 1415, 1417, 1419, 1421, 1432, 1439, 1442, 1444, 1446, 1448, 1450, 1452, 1454, 1459, 1464, 1471, 1480, 1491, 1503, 1515, 1516, 1517, 1526, 1533, 1538, 1541, 1543, 1545, 1547, 1549, 1551, 1553, 1564, 1571, 1574, 1576, 1578, 1580, 1582, 1584, 1586, 1588, 1591, 1596, 1603, 1612, 1624, 1634, 1635, 1636, 1643, 1648, 1651, 1653, 1655, 1657, 1659, 1661, 1664, 1666, 1677, 1684, 1687, 1688, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1706, 1711, 1718, 1726, 1734, 1735, 1736, 1741, 1744, 1746, 1750, 1752, 1754, 1756, 1758, 1760, 1771, 1778, 1781, 1782, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1802, 1807, 1813, 1819, 1820, 1821, 1824, 1826, 1828, 1830, 1834, 1836, 1838, 1840, 1842, 1853, 1860, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1886, 1892, 1896, 1897, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1918, 1929, 1936, 1939, 1940, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1961, 1963, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1988, 2001, 2003, 2007, 2010, 2011, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2038, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2061, 2072, 2079, 2082, 2083, 2084, 2086, 2088, 2090, 2092, 2094, 2096, 2098, 2100, 2102, 2104, 2106, 2109, 2110, 2111, 2113, 2115, 2117, 2119, 2121, 2123, 2125, 2127, 2129, 2131, 2142, 2149, 2152, 2153, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2177, 2182, 2183, 2184, 2187, 2189, 2191, 2193, 2195, 2197, 2199, 2201, 2203, 2205, 2216, 2223, 2226, 2227, 2228, 2230, 2232, 2234, 2236, 2238, 2240, 2242, 2244, 2246, 2249, 2254, 2261, 2262, 2263, 2268, 2271, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2288, 2299, 2306, 2310, 2311, 2313, 2317, 2319, 2321, 2323, 2325, 2327, 2329, 2332, 2337, 2344, 2353, 2354, 2355, 2362, 2367, 2370, 2372, 2374, 2376, 2378, 2380, 2383, 2385, 2396, 2406, 2407, 2408, 2410, 2412, 2414, 2416, 2418, 2420, 2422, 2425, 2430, 2437, 2446, 2457, 2458, 2459, 2468, 2475, 2480, 2483, 2485, 2487, 2489, 2491, 2493, 2495, 2506, 2513, 2516, 2517, 2518, 2520, 2522, 2524, 2526, 2528, 2530, 2533, 2538, 2545, 2554, 2565, 2578, 2579, 2580, 2591, 2600, 2607, 2612, 2615, 2617, 2619, 2621, 2623, 2625, 2643, 2646, 2647, 2648, 2650, 2652, 2654, 2656, 2658, 2661, 2666, 2673, 2682, 2693, 2706, 2721, 2722, 2723, 2736, 2747, 2757, 2764, 2769, 2772, 2774, 2776, 2778, 2780, 2798, 2801, 2802, 2803, 2805, 2807, 2809, 2811, 2814, 2819, 2826, 2835, 2846, 2859, 2874, 2891, 2892, 2893, 2908, 2921, 2932, 2941, 2948, 2953, 2956, 2958, 2960, 2962, 2973, 2980, 2983, 2984, 2985, 2987, 2989, 2991, 2994, 2999, 3006, 3015, 3026, 3039, 3054, 3071, 3090, 3091, 3092, 3109, 3124, 3137, 3148, 3157, 3164, 3169, 3172, 3174, 3176, 3187, 3194, 3197, 3198, 3199, 3201, 3203, 3206, 3211, 3218, 3227, 3238, 3251, 3266, 3283, 3302, 3323, 3324, 3325, 3344, 3361, 3376, 3389, 3400, 3409, 3416, 3421, 3424, 3426, 3437, 3444, 3447, 3448, 3449, 3451, 3454, 3459, 3466, 3475, 3486, 3499, 3514, 3531, 3550, 3571, 3594, 3595, 3596, 3617, 3636, 3653, 3668, 3681, 3692, 3701, 3708, 3713, 3716, 3727, 3729, 3733, 3736, 3737, 3738, 3741, 3746, 3753, 3762, 3773, 3786, 3801, 3818, 3837, 3858, 3881, 3906, 3908, 3931, 3952, 3971, 3988, 4003, 4016, 4027, 4036, 4043, 4050, 4062]
[2024-05-31 23:43:43] [INFO ] Actually due to overlaps returned [632, 882, 1096, 1278, 1432, 1564, 1677, 1771, 1853, 1929, 2001, 2072, 2142, 2216, 2299, 2396, 2506, 2973, 3187, 3437, 3727, 4062, 4, 12, 14, 204, 206, 280, 293, 346, 349, 350, 516, 584, 595, 639, 642, 643, 785, 786, 843, 852, 889, 892, 893, 1014, 1015, 1064, 1071, 1103, 1106, 1107, 1209, 1210, 1251, 1256, 1285, 1288, 1289, 1374, 1375, 1408, 1411, 1439, 1442, 1515, 1516, 1541, 1543, 1571, 1574, 1634, 1635, 1653, 1655, 1684, 1687, 1688, 1734, 1735, 1750, 1778, 1781, 1782, 1819, 1820, 1830, 1860, 1863, 1896, 1897, 1906, 1908, 1936, 1939, 1940, 1966, 1976, 1978, 2003, 2007, 2010, 2011, 2038, 2047, 2049, 2079, 2082, 2083, 2109, 2110, 2119, 2121, 2149, 2152, 2153, 2182, 2183, 2193, 2195, 2223, 2226, 2227, 2261, 2262, 2276, 2278, 2306, 2310, 2353, 2354, 2372, 2374, 2406, 2407, 2457, 2458, 2483, 2485, 2513, 2516, 2517, 2578, 2579, 2615, 2643, 2646, 2647, 2721, 2722, 2769, 2798, 2801, 2802, 2891, 2892, 2948, 2953, 2980, 2983, 2984, 3090, 3091, 3157, 3164, 3194, 3197, 3198, 3323, 3324, 3400, 3409, 3444, 3447, 3448, 3594, 3595, 3681, 3692, 3729, 3733, 3736, 3737, 3906, 4003, 4016]
Discarding 186 places :
Implicit Place search using SMT only with invariants took 7338 ms to find 186 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3989/7032 places, 7492/10855 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 3901 transition count 7404
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 3901 transition count 7404
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 264 place count 3813 transition count 7316
Iterating global reduction 0 with 88 rules applied. Total rules applied 352 place count 3813 transition count 7316
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 439 place count 3726 transition count 7229
Iterating global reduction 0 with 87 rules applied. Total rules applied 526 place count 3726 transition count 7229
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 565 place count 3687 transition count 7151
Iterating global reduction 0 with 39 rules applied. Total rules applied 604 place count 3687 transition count 7151
Applied a total of 604 rules in 2163 ms. Remains 3687 /3989 variables (removed 302) and now considering 7151/7492 (removed 341) transitions.
[2024-05-31 23:43:45] [INFO ] Flow matrix only has 6551 transitions (discarded 600 similar events)
// Phase 1: matrix 6551 rows 3687 cols
[2024-05-31 23:43:45] [INFO ] Computed 595 invariants in 186 ms
[2024-05-31 23:43:50] [INFO ] Implicit Places using invariants in 5023 ms returned [7, 13, 18, 25, 34, 45, 58, 73, 90, 109, 130, 153, 177, 203, 224, 243, 260, 297, 306, 313, 318, 321, 340, 343, 348, 355, 364, 375, 388, 403, 420, 439, 460, 482, 505, 524, 541, 559, 590, 597, 602, 605, 607, 619, 621, 624, 629, 636, 645, 656, 669, 684, 701, 720, 740, 759, 776, 791, 804, 829, 834, 837, 839, 841, 851, 853, 855, 858, 863, 870, 879, 890, 903, 918, 935, 953, 970, 985, 998, 1009, 1028, 1031, 1033, 1035, 1037, 1047, 1049, 1051, 1053, 1056, 1061, 1068, 1077, 1088, 1101, 1116, 1132, 1147, 1160, 1171, 1180, 1193, 1195, 1197, 1199, 1201, 1211, 1213, 1215, 1217, 1219, 1222, 1227, 1234, 1243, 1254, 1267, 1281, 1294, 1305, 1314, 1321, 1329, 1331, 1333, 1335, 1337, 1349, 1351, 1353, 1355, 1357, 1359, 1364, 1369, 1376, 1385, 1396, 1408, 1419, 1428, 1435, 1440, 1445, 1447, 1449, 1451, 1453, 1467, 1469, 1471, 1473, 1475, 1477, 1479, 1482, 1487, 1494, 1503, 1515, 1525, 1532, 1537, 1540, 1544, 1546, 1548, 1551, 1553, 1566, 1568, 1570, 1572, 1574, 1576, 1578, 1580, 1583, 1588, 1595, 1603, 1610, 1615, 1618, 1620, 1625, 1627, 1629, 1631, 1633, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1662, 1667, 1673, 1678, 1681, 1683, 1685, 1690, 1692, 1694, 1696, 1698, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1731, 1737, 1740, 1742, 1744, 1746, 1750, 1752, 1754, 1756, 1758, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1796, 1798, 1800, 1802, 1806, 1808, 1810, 1812, 1814, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1852, 1854, 1856, 1858, 1862, 1864, 1866, 1868, 1872, 1884, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1918, 1920, 1922, 1924, 1926, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1959, 1963, 1966, 1968, 1970, 1974, 1976, 1978, 1980, 1982, 1992, 1994, 1996, 1998, 2000, 2002, 2004, 2006, 2008, 2010, 2013, 2018, 2024, 2029, 2032, 2035, 2039, 2041, 2043, 2045, 2047, 2059, 2061, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2080, 2085, 2092, 2100, 2107, 2112, 2115, 2119, 2121, 2123, 2126, 2128, 2141, 2143, 2145, 2147, 2149, 2151, 2153, 2155, 2158, 2163, 2170, 2179, 2189, 2198, 2205, 2210, 2215, 2217, 2219, 2221, 2223, 2233, 2235, 2237, 2239, 2241, 2243, 2245, 2248, 2253, 2260, 2269, 2280, 2292, 2303, 2312, 2319, 2324, 2328, 2330, 2332, 2334, 2336, 2347, 2349, 2351, 2353, 2355, 2357, 2360, 2365, 2372, 2381, 2392, 2405, 2419, 2432, 2443, 2453, 2460, 2467, 2469, 2471, 2473, 2475, 2486, 2488, 2490, 2492, 2494, 2497, 2502, 2509, 2518, 2529, 2542, 2557, 2573, 2588, 2601, 2612, 2621, 2634, 2636, 2638, 2640, 2650, 2652, 2654, 2656, 2659, 2664, 2671, 2680, 2691, 2704, 2719, 2736, 2754, 2771, 2786, 2799, 2810, 2829, 2832, 2834, 2836, 2846, 2848, 2850, 2853, 2858, 2865, 2874, 2885, 2898, 2913, 2930, 2949, 2969, 2988, 3005, 3020, 3033, 3058, 3063, 3066, 3068, 3078, 3080, 3083, 3088, 3095, 3104, 3115, 3128, 3143, 3160, 3179, 3200, 3222, 3243, 3262, 3279, 3294, 3325, 3332, 3337, 3340, 3348, 3351, 3356, 3363, 3372, 3383, 3396, 3411, 3428, 3447, 3468, 3491, 3517, 3540, 3561, 3580, 3597, 3634, 3643, 3650, 3657]
Discarding 528 places :
Implicit Place search using SMT only with invariants took 5031 ms to find 528 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3159/7032 places, 7151/10855 transitions.
Applied a total of 0 rules in 297 ms. Remains 3159 /3159 variables (removed 0) and now considering 7151/7151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 18741 ms. Remains : 3159/7032 places, 7151/10855 transitions.
Support contains 77 out of 3159 places after structural reductions.
[2024-05-31 23:43:51] [INFO ] Flatten gal took : 434 ms
[2024-05-31 23:43:51] [INFO ] Flatten gal took : 234 ms
[2024-05-31 23:43:52] [INFO ] Input system was already deterministic with 7151 transitions.
Reduction of identical properties reduced properties to check from 37 to 35
RANDOM walk for 40000 steps (1878 resets) in 2890 ms. (13 steps per ms) remains 19/35 properties
BEST_FIRST walk for 4002 steps (32 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 51 ms. (77 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (32 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
[2024-05-31 23:43:53] [INFO ] Flow matrix only has 6551 transitions (discarded 600 similar events)
// Phase 1: matrix 6551 rows 3159 cols
[2024-05-31 23:43:53] [INFO ] Computed 67 invariants in 140 ms
[2024-05-31 23:43:53] [INFO ] State equation strengthened by 2625 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 3 (OVERLAPS) 3026/3071 variables, 20/23 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3071 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-31 23:43:57] [INFO ] Deduced a trap composed of 200 places in 2498 ms of which 154 ms to minimize.
[2024-05-31 23:43:59] [INFO ] Deduced a trap composed of 215 places in 2208 ms of which 19 ms to minimize.
SMT process timed out in 5946ms, After SMT, problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 3159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 3154 transition count 7136
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 3144 transition count 7136
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 41 place count 3133 transition count 7121
Iterating global reduction 2 with 11 rules applied. Total rules applied 52 place count 3133 transition count 7121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 52 place count 3133 transition count 7119
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 3131 transition count 7119
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 3124 transition count 7105
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 3124 transition count 7105
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 122 place count 3098 transition count 7079
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 3097 transition count 7078
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 3097 transition count 7078
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 3096 transition count 7076
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 3096 transition count 7076
Free-agglomeration rule (complex) applied 259 times.
Iterating global reduction 2 with 259 rules applied. Total rules applied 385 place count 3096 transition count 6817
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 2 with 259 rules applied. Total rules applied 644 place count 2837 transition count 6817
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 648 place count 2837 transition count 6817
Applied a total of 648 rules in 4149 ms. Remains 2837 /3159 variables (removed 322) and now considering 6817/7151 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4150 ms. Remains : 2837/3159 places, 6817/7151 transitions.
RANDOM walk for 40000 steps (2779 resets) in 1076 ms. (37 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 29207 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 16
Probabilistic random walk after 29207 steps, saw 12357 distinct states, run finished after 3004 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-31 23:44:07] [INFO ] Flow matrix only has 5960 transitions (discarded 857 similar events)
// Phase 1: matrix 5960 rows 2837 cols
[2024-05-31 23:44:07] [INFO ] Computed 67 invariants in 132 ms
[2024-05-31 23:44:07] [INFO ] State equation strengthened by 2613 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2712/2746 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2746 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2746 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 6/2752 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2752 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 55/2807 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2807 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 26/2833 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2833 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 4/2837 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2837 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 5960/8797 variables, 2837/2904 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/8797 variables, 2613/5517 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8797 variables, 0/5517 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/8797 variables, 0/5517 constraints. Problems are: Problem set: 13 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8797/8797 variables, and 5517 constraints, problems are : Problem set: 13 solved, 3 unsolved in 11005 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 2837/2837 constraints, ReadFeed: 2613/2613 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2692/2698 variables, 5/5 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2698 variables, 0/5 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/2726 variables, 2/7 constraints. Problems are: Problem set: 13 solved, 3 unsolved
[2024-05-31 23:44:20] [INFO ] Deduced a trap composed of 198 places in 1920 ms of which 17 ms to minimize.
[2024-05-31 23:44:22] [INFO ] Deduced a trap composed of 174 places in 1694 ms of which 16 ms to minimize.
[2024-05-31 23:44:24] [INFO ] Deduced a trap composed of 139 places in 1863 ms of which 18 ms to minimize.
[2024-05-31 23:44:26] [INFO ] Deduced a trap composed of 113 places in 1816 ms of which 17 ms to minimize.
[2024-05-31 23:44:28] [INFO ] Deduced a trap composed of 166 places in 1840 ms of which 18 ms to minimize.
[2024-05-31 23:44:30] [INFO ] Deduced a trap composed of 212 places in 1865 ms of which 19 ms to minimize.
[2024-05-31 23:44:31] [INFO ] Deduced a trap composed of 132 places in 1781 ms of which 18 ms to minimize.
[2024-05-31 23:44:33] [INFO ] Deduced a trap composed of 154 places in 1866 ms of which 17 ms to minimize.
[2024-05-31 23:44:35] [INFO ] Deduced a trap composed of 157 places in 1897 ms of which 18 ms to minimize.
[2024-05-31 23:44:37] [INFO ] Deduced a trap composed of 219 places in 1819 ms of which 17 ms to minimize.
[2024-05-31 23:44:39] [INFO ] Deduced a trap composed of 161 places in 1852 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2726 variables, 11/18 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2726 variables, 0/18 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 65/2791 variables, 14/32 constraints. Problems are: Problem set: 13 solved, 3 unsolved
[2024-05-31 23:44:41] [INFO ] Deduced a trap composed of 5 places in 1872 ms of which 18 ms to minimize.
[2024-05-31 23:44:43] [INFO ] Deduced a trap composed of 39 places in 1873 ms of which 19 ms to minimize.
[2024-05-31 23:44:45] [INFO ] Deduced a trap composed of 222 places in 1794 ms of which 16 ms to minimize.
[2024-05-31 23:44:47] [INFO ] Deduced a trap composed of 179 places in 1883 ms of which 17 ms to minimize.
[2024-05-31 23:44:49] [INFO ] Deduced a trap composed of 177 places in 1851 ms of which 19 ms to minimize.
[2024-05-31 23:44:51] [INFO ] Deduced a trap composed of 174 places in 1870 ms of which 18 ms to minimize.
[2024-05-31 23:44:53] [INFO ] Deduced a trap composed of 180 places in 1796 ms of which 18 ms to minimize.
[2024-05-31 23:44:55] [INFO ] Deduced a trap composed of 178 places in 1879 ms of which 18 ms to minimize.
[2024-05-31 23:44:56] [INFO ] Deduced a trap composed of 197 places in 1903 ms of which 18 ms to minimize.
[2024-05-31 23:44:58] [INFO ] Deduced a trap composed of 195 places in 1747 ms of which 18 ms to minimize.
[2024-05-31 23:45:00] [INFO ] Deduced a trap composed of 182 places in 1812 ms of which 18 ms to minimize.
[2024-05-31 23:45:02] [INFO ] Deduced a trap composed of 176 places in 1897 ms of which 17 ms to minimize.
[2024-05-31 23:45:04] [INFO ] Deduced a trap composed of 178 places in 1835 ms of which 18 ms to minimize.
SMT process timed out in 57369ms, After SMT, problems are : Problem set: 13 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2837/2837 places, 6817/6817 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2837 transition count 6816
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2836 transition count 6816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2835 transition count 6815
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2835 transition count 6815
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2834 transition count 6813
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2834 transition count 6813
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 2834 transition count 7143
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 24 place count 2825 transition count 7143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2825 transition count 7143
Applied a total of 25 rules in 1778 ms. Remains 2825 /2837 variables (removed 12) and now considering 7143/6817 (removed -326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1778 ms. Remains : 2825/2837 places, 7143/6817 transitions.
RANDOM walk for 40000 steps (3093 resets) in 616 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (258 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (255 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (259 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 30670 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 3
Probabilistic random walk after 30670 steps, saw 12820 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-31 23:45:09] [INFO ] Flow matrix only has 6286 transitions (discarded 857 similar events)
// Phase 1: matrix 6286 rows 2825 cols
[2024-05-31 23:45:09] [INFO ] Computed 67 invariants in 143 ms
[2024-05-31 23:45:09] [INFO ] State equation strengthened by 2951 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2681/2687 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2687 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/2715 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:45:12] [INFO ] Deduced a trap composed of 163 places in 1913 ms of which 18 ms to minimize.
[2024-05-31 23:45:14] [INFO ] Deduced a trap composed of 207 places in 1917 ms of which 18 ms to minimize.
[2024-05-31 23:45:15] [INFO ] Deduced a trap composed of 143 places in 1754 ms of which 16 ms to minimize.
[2024-05-31 23:45:17] [INFO ] Deduced a trap composed of 137 places in 1844 ms of which 17 ms to minimize.
[2024-05-31 23:45:19] [INFO ] Deduced a trap composed of 128 places in 1876 ms of which 18 ms to minimize.
[2024-05-31 23:45:21] [INFO ] Deduced a trap composed of 106 places in 1907 ms of which 17 ms to minimize.
[2024-05-31 23:45:23] [INFO ] Deduced a trap composed of 155 places in 1932 ms of which 18 ms to minimize.
[2024-05-31 23:45:25] [INFO ] Deduced a trap composed of 1123 places in 1829 ms of which 18 ms to minimize.
[2024-05-31 23:45:27] [INFO ] Deduced a trap composed of 1217 places in 1814 ms of which 18 ms to minimize.
[2024-05-31 23:45:29] [INFO ] Deduced a trap composed of 113 places in 1788 ms of which 17 ms to minimize.
[2024-05-31 23:45:31] [INFO ] Deduced a trap composed of 212 places in 1854 ms of which 17 ms to minimize.
[2024-05-31 23:45:33] [INFO ] Deduced a trap composed of 1120 places in 1822 ms of which 21 ms to minimize.
[2024-05-31 23:45:34] [INFO ] Deduced a trap composed of 179 places in 1817 ms of which 16 ms to minimize.
[2024-05-31 23:45:36] [INFO ] Deduced a trap composed of 1237 places in 1819 ms of which 17 ms to minimize.
[2024-05-31 23:45:38] [INFO ] Deduced a trap composed of 139 places in 1880 ms of which 17 ms to minimize.
[2024-05-31 23:45:40] [INFO ] Deduced a trap composed of 187 places in 1894 ms of which 18 ms to minimize.
[2024-05-31 23:45:42] [INFO ] Deduced a trap composed of 122 places in 1834 ms of which 18 ms to minimize.
[2024-05-31 23:45:44] [INFO ] Deduced a trap composed of 97 places in 1883 ms of which 17 ms to minimize.
[2024-05-31 23:45:46] [INFO ] Deduced a trap composed of 146 places in 1840 ms of which 17 ms to minimize.
[2024-05-31 23:45:48] [INFO ] Deduced a trap composed of 199 places in 1863 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2715 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:45:50] [INFO ] Deduced a trap composed of 102 places in 1810 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2715 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2715 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 64/2779 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:45:52] [INFO ] Deduced a trap composed of 5 places in 1919 ms of which 17 ms to minimize.
[2024-05-31 23:45:54] [INFO ] Deduced a trap composed of 39 places in 2042 ms of which 18 ms to minimize.
[2024-05-31 23:45:56] [INFO ] Deduced a trap composed of 152 places in 1996 ms of which 17 ms to minimize.
[2024-05-31 23:45:58] [INFO ] Deduced a trap composed of 89 places in 1952 ms of which 19 ms to minimize.
[2024-05-31 23:46:00] [INFO ] Deduced a trap composed of 185 places in 1912 ms of which 18 ms to minimize.
[2024-05-31 23:46:02] [INFO ] Deduced a trap composed of 117 places in 1992 ms of which 18 ms to minimize.
[2024-05-31 23:46:04] [INFO ] Deduced a trap composed of 143 places in 1890 ms of which 18 ms to minimize.
[2024-05-31 23:46:06] [INFO ] Deduced a trap composed of 143 places in 1995 ms of which 18 ms to minimize.
[2024-05-31 23:46:08] [INFO ] Deduced a trap composed of 178 places in 2037 ms of which 18 ms to minimize.
[2024-05-31 23:46:10] [INFO ] Deduced a trap composed of 165 places in 1960 ms of which 20 ms to minimize.
[2024-05-31 23:46:12] [INFO ] Deduced a trap composed of 229 places in 1894 ms of which 18 ms to minimize.
[2024-05-31 23:46:14] [INFO ] Deduced a trap composed of 236 places in 1964 ms of which 18 ms to minimize.
[2024-05-31 23:46:16] [INFO ] Deduced a trap composed of 266 places in 1905 ms of which 18 ms to minimize.
[2024-05-31 23:46:18] [INFO ] Deduced a trap composed of 232 places in 1828 ms of which 18 ms to minimize.
[2024-05-31 23:46:20] [INFO ] Deduced a trap composed of 259 places in 1827 ms of which 16 ms to minimize.
[2024-05-31 23:46:22] [INFO ] Deduced a trap composed of 257 places in 1840 ms of which 16 ms to minimize.
[2024-05-31 23:46:24] [INFO ] Deduced a trap composed of 254 places in 1991 ms of which 21 ms to minimize.
[2024-05-31 23:46:26] [INFO ] Deduced a trap composed of 266 places in 1994 ms of which 17 ms to minimize.
SMT process timed out in 76808ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 7143/7143 transitions.
Applied a total of 0 rules in 382 ms. Remains 2825 /2825 variables (removed 0) and now considering 7143/7143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 2825/2825 places, 7143/7143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 7143/7143 transitions.
Applied a total of 0 rules in 390 ms. Remains 2825 /2825 variables (removed 0) and now considering 7143/7143 (removed 0) transitions.
[2024-05-31 23:46:27] [INFO ] Flow matrix only has 6286 transitions (discarded 857 similar events)
[2024-05-31 23:46:27] [INFO ] Invariant cache hit.
[2024-05-31 23:46:31] [INFO ] Implicit Places using invariants in 4052 ms returned [280, 428, 1104, 1186, 1284, 1324, 1338, 1383, 1413, 1530, 1579, 1717, 1820, 2683]
[2024-05-31 23:46:31] [INFO ] Actually due to overlaps returned [1717, 1820, 280, 428, 1104, 1186, 1338, 1383, 1413, 1530, 2683]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4059 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2814/2825 places, 7143/7143 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2807 transition count 7136
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2807 transition count 7136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 2800 transition count 7129
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 2800 transition count 7129
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 2800 transition count 7128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 2799 transition count 7128
Applied a total of 30 rules in 1289 ms. Remains 2799 /2814 variables (removed 15) and now considering 7128/7143 (removed 15) transitions.
[2024-05-31 23:46:32] [INFO ] Flow matrix only has 6271 transitions (discarded 857 similar events)
// Phase 1: matrix 6271 rows 2799 cols
[2024-05-31 23:46:32] [INFO ] Computed 56 invariants in 128 ms
[2024-05-31 23:46:36] [INFO ] Implicit Places using invariants in 4093 ms returned [1277, 1317, 1564]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4102 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2796/2825 places, 7128/7143 transitions.
Applied a total of 0 rules in 416 ms. Remains 2796 /2796 variables (removed 0) and now considering 7128/7128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 10258 ms. Remains : 2796/2825 places, 7128/7143 transitions.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 535 stabilizing places and 1950 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 3154 transition count 7136
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 3144 transition count 7136
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 41 place count 3133 transition count 7121
Iterating global reduction 2 with 11 rules applied. Total rules applied 52 place count 3133 transition count 7121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 52 place count 3133 transition count 7119
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 3131 transition count 7119
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 3124 transition count 7105
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 3124 transition count 7105
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 3096 transition count 7077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 3095 transition count 7076
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 3095 transition count 7076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 3094 transition count 7074
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 3094 transition count 7074
Applied a total of 130 rules in 3272 ms. Remains 3094 /3159 variables (removed 65) and now considering 7074/7151 (removed 77) transitions.
[2024-05-31 23:46:40] [INFO ] Flow matrix only has 6474 transitions (discarded 600 similar events)
// Phase 1: matrix 6474 rows 3094 cols
[2024-05-31 23:46:40] [INFO ] Computed 67 invariants in 176 ms
[2024-05-31 23:46:45] [INFO ] Implicit Places using invariants in 5035 ms returned [302, 461, 1203, 1411, 1455, 1470, 1519, 1550, 1677, 1732, 1888, 2003, 2940]
[2024-05-31 23:46:45] [INFO ] Actually due to overlaps returned [302, 1888, 2003, 461, 1203, 1470, 1519, 1550, 1677, 2940]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 5039 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3084/3159 places, 7074/7151 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3079 transition count 7069
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3079 transition count 7069
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 3074 transition count 7064
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 3074 transition count 7064
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 3069 transition count 7054
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 3069 transition count 7054
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 3067 transition count 7052
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 3065 transition count 7050
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 3065 transition count 7050
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 3063 transition count 7046
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 3063 transition count 7046
Applied a total of 42 rules in 3139 ms. Remains 3063 /3084 variables (removed 21) and now considering 7046/7074 (removed 28) transitions.
[2024-05-31 23:46:48] [INFO ] Flow matrix only has 6446 transitions (discarded 600 similar events)
// Phase 1: matrix 6446 rows 3063 cols
[2024-05-31 23:46:48] [INFO ] Computed 57 invariants in 165 ms
[2024-05-31 23:46:53] [INFO ] Implicit Places using invariants in 4586 ms returned [1404, 1448, 1713]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4590 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3060/3159 places, 7046/7151 transitions.
Applied a total of 0 rules in 520 ms. Remains 3060 /3060 variables (removed 0) and now considering 7046/7046 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 16563 ms. Remains : 3060/3159 places, 7046/7151 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-01
Product exploration explored 100000 steps with 6589 reset in 1056 ms.
Product exploration explored 100000 steps with 6595 reset in 934 ms.
Computed a total of 461 stabilizing places and 1870 stable transitions
Computed a total of 461 stabilizing places and 1870 stable transitions
Detected a total of 461/3060 stabilizing places and 1870/7046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 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)]
RANDOM walk for 25214 steps (1660 resets) in 390 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 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 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 7046/7046 transitions.
Applied a total of 0 rules in 513 ms. Remains 3060 /3060 variables (removed 0) and now considering 7046/7046 (removed 0) transitions.
[2024-05-31 23:46:57] [INFO ] Flow matrix only has 6446 transitions (discarded 600 similar events)
// Phase 1: matrix 6446 rows 3060 cols
[2024-05-31 23:46:57] [INFO ] Computed 54 invariants in 151 ms
[2024-05-31 23:47:01] [INFO ] Implicit Places using invariants in 4624 ms returned []
[2024-05-31 23:47:01] [INFO ] Flow matrix only has 6446 transitions (discarded 600 similar events)
[2024-05-31 23:47:01] [INFO ] Invariant cache hit.
[2024-05-31 23:47:04] [INFO ] State equation strengthened by 2606 read => feed constraints.
[2024-05-31 23:47:35] [INFO ] Performed 1079/3060 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:48:06] [INFO ] Performed 1653/3060 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-31 23:48:36] [INFO ] Performed 2673/3060 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-31 23:48:44] [INFO ] Implicit Places using invariants and state equation in 102974 ms returned [3056]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107604 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3059/3060 places, 7046/7046 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3059 transition count 7045
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3058 transition count 7045
Applied a total of 2 rules in 583 ms. Remains 3058 /3059 variables (removed 1) and now considering 7045/7046 (removed 1) transitions.
[2024-05-31 23:48:45] [INFO ] Flow matrix only has 6445 transitions (discarded 600 similar events)
// Phase 1: matrix 6445 rows 3058 cols
[2024-05-31 23:48:45] [INFO ] Computed 53 invariants in 140 ms
[2024-05-31 23:48:49] [INFO ] Implicit Places using invariants in 4549 ms returned []
[2024-05-31 23:48:49] [INFO ] Flow matrix only has 6445 transitions (discarded 600 similar events)
[2024-05-31 23:48:49] [INFO ] Invariant cache hit.
[2024-05-31 23:48:52] [INFO ] State equation strengthened by 2606 read => feed constraints.
[2024-05-31 23:49:24] [INFO ] Performed 937/3058 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-31 23:49:54] [INFO ] Performed 1489/3058 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-31 23:50:24] [INFO ] Performed 2183/3058 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-05-31 23:50:44] [INFO ] Implicit Places using invariants and state equation in 114547 ms returned []
Implicit Place search using SMT with State Equation took 119098 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3058/3060 places, 7045/7046 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227798 ms. Remains : 3058/3060 places, 7045/7046 transitions.
Computed a total of 459 stabilizing places and 1869 stable transitions
Computed a total of 459 stabilizing places and 1869 stable transitions
Detected a total of 459/3058 stabilizing places and 1869/7045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21332 steps (1425 resets) in 300 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6695 reset in 941 ms.
Product exploration explored 100000 steps with 6692 reset in 934 ms.
Support contains 2 out of 3058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3058/3058 places, 7045/7045 transitions.
Applied a total of 0 rules in 531 ms. Remains 3058 /3058 variables (removed 0) and now considering 7045/7045 (removed 0) transitions.
[2024-05-31 23:50:47] [INFO ] Flow matrix only has 6445 transitions (discarded 600 similar events)
[2024-05-31 23:50:47] [INFO ] Invariant cache hit.
[2024-05-31 23:50:52] [INFO ] Implicit Places using invariants in 4492 ms returned []
[2024-05-31 23:50:52] [INFO ] Flow matrix only has 6445 transitions (discarded 600 similar events)
[2024-05-31 23:50:52] [INFO ] Invariant cache hit.
[2024-05-31 23:50:54] [INFO ] State equation strengthened by 2606 read => feed constraints.
[2024-05-31 23:51:24] [INFO ] Performed 958/3058 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:51:54] [INFO ] Performed 1516/3058 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 23:52:24] [INFO ] Performed 2296/3058 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:52:41] [INFO ] Implicit Places using invariants and state equation in 109413 ms returned []
Implicit Place search using SMT with State Equation took 113906 ms to find 0 implicit places.
[2024-05-31 23:52:42] [INFO ] Redundant transitions in 654 ms returned []
Running 7020 sub problems to find dead transitions.
[2024-05-31 23:52:42] [INFO ] Flow matrix only has 6445 transitions (discarded 600 similar events)
[2024-05-31 23:52:42] [INFO ] Invariant cache hit.
[2024-05-31 23:52:42] [INFO ] State equation strengthened by 2606 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3056 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7020 unsolved
SMT process timed out in 45465ms, After SMT, problems are : Problem set: 0 solved, 7020 unsolved
Search for dead transitions found 0 dead transitions in 45538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 160662 ms. Remains : 3058/3058 places, 7045/7045 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-01 finished in 410898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 3154 transition count 7135
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 3143 transition count 7135
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 44 place count 3131 transition count 7119
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 3131 transition count 7119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 3131 transition count 7116
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 3128 transition count 7116
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 3120 transition count 7100
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 3120 transition count 7100
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 132 place count 3093 transition count 7073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 3092 transition count 7072
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 3092 transition count 7072
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 3091 transition count 7070
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 3091 transition count 7070
Applied a total of 136 rules in 2957 ms. Remains 3091 /3159 variables (removed 68) and now considering 7070/7151 (removed 81) transitions.
[2024-05-31 23:53:31] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3091 cols
[2024-05-31 23:53:31] [INFO ] Computed 67 invariants in 269 ms
[2024-05-31 23:53:36] [INFO ] Implicit Places using invariants in 4959 ms returned [301, 460, 1202, 1295, 1407, 1451, 1466, 1515, 1546, 1673, 1728, 1884, 1999, 2936]
[2024-05-31 23:53:36] [INFO ] Actually due to overlaps returned [301, 1884, 1999, 460, 1202, 1295, 1466, 1515, 1546, 1673, 2936]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4967 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3080/3159 places, 7070/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3073 transition count 7063
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3073 transition count 7063
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3066 transition count 7056
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3066 transition count 7056
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3059 transition count 7042
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3059 transition count 7042
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 3058 transition count 7041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3057 transition count 7040
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3057 transition count 7040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3056 transition count 7038
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3056 transition count 7038
Applied a total of 48 rules in 3736 ms. Remains 3056 /3080 variables (removed 24) and now considering 7038/7070 (removed 32) transitions.
[2024-05-31 23:53:39] [INFO ] Flow matrix only has 6438 transitions (discarded 600 similar events)
// Phase 1: matrix 6438 rows 3056 cols
[2024-05-31 23:53:40] [INFO ] Computed 56 invariants in 158 ms
[2024-05-31 23:53:44] [INFO ] Implicit Places using invariants in 4598 ms returned [1397, 1441, 1706]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4604 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3053/3159 places, 7038/7151 transitions.
Applied a total of 0 rules in 522 ms. Remains 3053 /3053 variables (removed 0) and now considering 7038/7038 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 16789 ms. Remains : 3053/3159 places, 7038/7151 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03 finished in 16903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(G((p0||X(!p1))))))))'
Support contains 4 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3147 transition count 7135
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3147 transition count 7135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 3139 transition count 7120
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 3139 transition count 7120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3138 transition count 7118
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3138 transition count 7118
Applied a total of 42 rules in 1564 ms. Remains 3138 /3159 variables (removed 21) and now considering 7118/7151 (removed 33) transitions.
[2024-05-31 23:53:46] [INFO ] Flow matrix only has 6518 transitions (discarded 600 similar events)
// Phase 1: matrix 6518 rows 3138 cols
[2024-05-31 23:53:46] [INFO ] Computed 67 invariants in 148 ms
[2024-05-31 23:53:51] [INFO ] Implicit Places using invariants in 4876 ms returned [310, 470, 1218, 1313, 1427, 1472, 1541, 1574, 1706, 1763, 1920, 2036, 2978]
[2024-05-31 23:53:51] [INFO ] Actually due to overlaps returned [310, 1920, 2036, 470, 1218, 1313, 1541, 1574, 1706, 2978]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4881 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3128/3159 places, 7118/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3121 transition count 7111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3121 transition count 7111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3114 transition count 7104
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3114 transition count 7104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3107 transition count 7097
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3107 transition count 7097
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 3100 transition count 7083
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 3100 transition count 7083
Applied a total of 56 rules in 2094 ms. Remains 3100 /3128 variables (removed 28) and now considering 7083/7118 (removed 35) transitions.
[2024-05-31 23:53:53] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
// Phase 1: matrix 6483 rows 3100 cols
[2024-05-31 23:53:53] [INFO ] Computed 57 invariants in 154 ms
[2024-05-31 23:53:58] [INFO ] Implicit Places using invariants in 4717 ms returned [1414, 1459, 1738]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4722 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3097/3159 places, 7083/7151 transitions.
Applied a total of 0 rules in 383 ms. Remains 3097 /3097 variables (removed 0) and now considering 7083/7083 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13647 ms. Remains : 3097/3159 places, 7083/7151 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04
Product exploration explored 100000 steps with 4709 reset in 943 ms.
Product exploration explored 100000 steps with 4709 reset in 818 ms.
Computed a total of 473 stabilizing places and 1882 stable transitions
Computed a total of 473 stabilizing places and 1882 stable transitions
Detected a total of 473/3097 stabilizing places and 1882/7083 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (1879 resets) in 613 ms. (65 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
[2024-05-31 23:54:01] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
// Phase 1: matrix 6483 rows 3097 cols
[2024-05-31 23:54:01] [INFO ] Computed 54 invariants in 138 ms
[2024-05-31 23:54:01] [INFO ] State equation strengthened by 2606 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2337/2339 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2339 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 625/2964 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2964 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/3019 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:54:04] [INFO ] Deduced a trap composed of 286 places in 2140 ms of which 18 ms to minimize.
[2024-05-31 23:54:06] [INFO ] Deduced a trap composed of 142 places in 2177 ms of which 19 ms to minimize.
[2024-05-31 23:54:08] [INFO ] Deduced a trap composed of 126 places in 2156 ms of which 18 ms to minimize.
SMT process timed out in 7304ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3097/3097 places, 7083/7083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3097 transition count 7076
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3090 transition count 7076
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 3090 transition count 7071
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 3085 transition count 7071
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 3084 transition count 7070
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 3084 transition count 7070
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 3084 transition count 7069
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 3083 transition count 7069
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 3082 transition count 7067
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 3082 transition count 7067
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 78 place count 3058 transition count 7043
Free-agglomeration rule (complex) applied 281 times.
Iterating global reduction 2 with 281 rules applied. Total rules applied 359 place count 3058 transition count 7072
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 2 with 281 rules applied. Total rules applied 640 place count 2777 transition count 7072
Applied a total of 640 rules in 2441 ms. Remains 2777 /3097 variables (removed 320) and now considering 7072/7083 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2441 ms. Remains : 2777/3097 places, 7072/7083 transitions.
RANDOM walk for 40000 steps (3075 resets) in 742 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (205 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 30296 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 30296 steps, saw 12547 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-31 23:54:14] [INFO ] Flow matrix only has 6196 transitions (discarded 876 similar events)
// Phase 1: matrix 6196 rows 2777 cols
[2024-05-31 23:54:14] [INFO ] Computed 54 invariants in 124 ms
[2024-05-31 23:54:14] [INFO ] State equation strengthened by 2915 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2670/2672 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2672 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/2698 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:54:16] [INFO ] Deduced a trap composed of 446 places in 1900 ms of which 18 ms to minimize.
[2024-05-31 23:54:18] [INFO ] Deduced a trap composed of 132 places in 1963 ms of which 18 ms to minimize.
[2024-05-31 23:54:20] [INFO ] Deduced a trap composed of 107 places in 1840 ms of which 17 ms to minimize.
[2024-05-31 23:54:22] [INFO ] Deduced a trap composed of 205 places in 1873 ms of which 18 ms to minimize.
[2024-05-31 23:54:24] [INFO ] Deduced a trap composed of 294 places in 1941 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2698 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2698 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/2729 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:54:26] [INFO ] Deduced a trap composed of 5 places in 1943 ms of which 18 ms to minimize.
[2024-05-31 23:54:28] [INFO ] Deduced a trap composed of 39 places in 2003 ms of which 18 ms to minimize.
[2024-05-31 23:54:30] [INFO ] Deduced a trap composed of 160 places in 1934 ms of which 18 ms to minimize.
[2024-05-31 23:54:32] [INFO ] Deduced a trap composed of 70 places in 1845 ms of which 18 ms to minimize.
[2024-05-31 23:54:34] [INFO ] Deduced a trap composed of 98 places in 1756 ms of which 18 ms to minimize.
[2024-05-31 23:54:36] [INFO ] Deduced a trap composed of 98 places in 1801 ms of which 19 ms to minimize.
[2024-05-31 23:54:38] [INFO ] Deduced a trap composed of 70 places in 1955 ms of which 18 ms to minimize.
[2024-05-31 23:54:40] [INFO ] Deduced a trap composed of 115 places in 1785 ms of which 19 ms to minimize.
[2024-05-31 23:54:42] [INFO ] Deduced a trap composed of 39 places in 1825 ms of which 19 ms to minimize.
[2024-05-31 23:54:43] [INFO ] Deduced a trap composed of 89 places in 1895 ms of which 18 ms to minimize.
[2024-05-31 23:54:45] [INFO ] Deduced a trap composed of 70 places in 1879 ms of which 18 ms to minimize.
[2024-05-31 23:54:47] [INFO ] Deduced a trap composed of 140 places in 1752 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2729 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2729 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 44/2773 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2773 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/2777 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2777 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 8973/8973 variables, and 2848 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37213 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2777/2777 constraints, ReadFeed: 0/2915 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 37395ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04 finished in 66755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F((!p1||G(F(!p1)))))))))'
Support contains 6 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3147 transition count 7135
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3147 transition count 7135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 3139 transition count 7120
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 3139 transition count 7120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3138 transition count 7118
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3138 transition count 7118
Applied a total of 42 rules in 1705 ms. Remains 3138 /3159 variables (removed 21) and now considering 7118/7151 (removed 33) transitions.
[2024-05-31 23:54:53] [INFO ] Flow matrix only has 6518 transitions (discarded 600 similar events)
// Phase 1: matrix 6518 rows 3138 cols
[2024-05-31 23:54:53] [INFO ] Computed 67 invariants in 152 ms
[2024-05-31 23:54:58] [INFO ] Implicit Places using invariants in 4506 ms returned [310, 470, 1218, 1313, 1474, 1490, 1541, 1574, 1706, 1763, 2036, 2978]
[2024-05-31 23:54:58] [INFO ] Actually due to overlaps returned [310, 2036, 470, 1218, 1313, 1490, 1541, 1574, 1706, 2978]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4510 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3128/3159 places, 7118/7151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3120 transition count 7110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3120 transition count 7110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 3112 transition count 7102
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 3112 transition count 7102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 3104 transition count 7094
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 3104 transition count 7094
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 3096 transition count 7078
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 3096 transition count 7078
Applied a total of 64 rules in 2322 ms. Remains 3096 /3128 variables (removed 32) and now considering 7078/7118 (removed 40) transitions.
[2024-05-31 23:55:00] [INFO ] Flow matrix only has 6478 transitions (discarded 600 similar events)
// Phase 1: matrix 6478 rows 3096 cols
[2024-05-31 23:55:00] [INFO ] Computed 57 invariants in 162 ms
[2024-05-31 23:55:04] [INFO ] Implicit Places using invariants in 4401 ms returned [1461, 1734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4405 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3094/3159 places, 7078/7151 transitions.
Applied a total of 0 rules in 395 ms. Remains 3094 /3094 variables (removed 0) and now considering 7078/7078 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13338 ms. Remains : 3094/3159 places, 7078/7151 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
Product exploration explored 100000 steps with 4709 reset in 777 ms.
Product exploration explored 100000 steps with 4710 reset in 799 ms.
Computed a total of 470 stabilizing places and 1877 stable transitions
Computed a total of 470 stabilizing places and 1877 stable transitions
Detected a total of 470/3094 stabilizing places and 1877/7078 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
RANDOM walk for 6611 steps (310 resets) in 79 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 180 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 72 ms :[p1, p1]
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Support contains 2 out of 3094 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 : 3094/3094 places, 7078/7078 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 3094 transition count 7070
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 3086 transition count 7070
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 3086 transition count 7066
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 3082 transition count 7066
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 74 place count 3057 transition count 7041
Applied a total of 74 rules in 1066 ms. Remains 3057 /3094 variables (removed 37) and now considering 7041/7078 (removed 37) transitions.
[2024-05-31 23:55:08] [INFO ] Flow matrix only has 6441 transitions (discarded 600 similar events)
// Phase 1: matrix 6441 rows 3057 cols
[2024-05-31 23:55:08] [INFO ] Computed 55 invariants in 163 ms
[2024-05-31 23:55:12] [INFO ] Implicit Places using invariants in 4298 ms returned []
[2024-05-31 23:55:12] [INFO ] Flow matrix only has 6441 transitions (discarded 600 similar events)
[2024-05-31 23:55:12] [INFO ] Invariant cache hit.
[2024-05-31 23:55:15] [INFO ] State equation strengthened by 2605 read => feed constraints.
[2024-05-31 23:55:46] [INFO ] Performed 1078/3057 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:56:16] [INFO ] Performed 1607/3057 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 23:56:46] [INFO ] Performed 2222/3057 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:57:07] [INFO ] Implicit Places using invariants and state equation in 114208 ms returned [3048]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 118511 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3056/3094 places, 7041/7078 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3056 transition count 7040
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3055 transition count 7040
Applied a total of 2 rules in 554 ms. Remains 3055 /3056 variables (removed 1) and now considering 7040/7041 (removed 1) transitions.
[2024-05-31 23:57:07] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
// Phase 1: matrix 6440 rows 3055 cols
[2024-05-31 23:57:07] [INFO ] Computed 54 invariants in 169 ms
[2024-05-31 23:57:11] [INFO ] Implicit Places using invariants in 4137 ms returned []
[2024-05-31 23:57:11] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
[2024-05-31 23:57:11] [INFO ] Invariant cache hit.
[2024-05-31 23:57:14] [INFO ] State equation strengthened by 2605 read => feed constraints.
[2024-05-31 23:57:44] [INFO ] Performed 1144/3055 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:58:14] [INFO ] Performed 1682/3055 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 23:58:44] [INFO ] Performed 2583/3055 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:58:54] [INFO ] Implicit Places using invariants and state equation in 102533 ms returned []
Implicit Place search using SMT with State Equation took 106671 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3055/3094 places, 7040/7078 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226802 ms. Remains : 3055/3094 places, 7040/7078 transitions.
Computed a total of 456 stabilizing places and 1864 stable transitions
Computed a total of 456 stabilizing places and 1864 stable transitions
Detected a total of 456/3055 stabilizing places and 1864/7040 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 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 61 ms :[p1, p1]
RANDOM walk for 3296 steps (218 resets) in 52 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 119 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 64 ms :[p1, p1]
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 58 ms :[p1, p1]
Product exploration explored 100000 steps with 6701 reset in 889 ms.
Product exploration explored 100000 steps with 6701 reset in 904 ms.
Support contains 2 out of 3055 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3055/3055 places, 7040/7040 transitions.
Applied a total of 0 rules in 534 ms. Remains 3055 /3055 variables (removed 0) and now considering 7040/7040 (removed 0) transitions.
[2024-05-31 23:58:57] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
[2024-05-31 23:58:57] [INFO ] Invariant cache hit.
[2024-05-31 23:59:01] [INFO ] Implicit Places using invariants in 4305 ms returned [1399, 1862]
[2024-05-31 23:59:01] [INFO ] Actually due to overlaps returned [1862]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4311 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3054/3055 places, 7040/7040 transitions.
Applied a total of 0 rules in 516 ms. Remains 3054 /3054 variables (removed 0) and now considering 7040/7040 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5362 ms. Remains : 3054/3055 places, 7040/7040 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06 finished in 250414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&F(p1))))))))'
Support contains 4 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3148 transition count 7137
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3148 transition count 7137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 3140 transition count 7122
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 3140 transition count 7122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3139 transition count 7120
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3139 transition count 7120
Applied a total of 40 rules in 1606 ms. Remains 3139 /3159 variables (removed 20) and now considering 7120/7151 (removed 31) transitions.
[2024-05-31 23:59:03] [INFO ] Flow matrix only has 6520 transitions (discarded 600 similar events)
// Phase 1: matrix 6520 rows 3139 cols
[2024-05-31 23:59:04] [INFO ] Computed 67 invariants in 147 ms
[2024-05-31 23:59:08] [INFO ] Implicit Places using invariants in 4722 ms returned [310, 470, 1315, 1429, 1474, 1490, 1541, 1574, 1707, 1764, 1921, 2037, 2979]
[2024-05-31 23:59:08] [INFO ] Actually due to overlaps returned [310, 1921, 2037, 470, 1315, 1490, 1541, 1574, 1707, 2979]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4726 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3129/3159 places, 7120/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3122 transition count 7113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3122 transition count 7113
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3115 transition count 7106
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3115 transition count 7106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3108 transition count 7099
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3108 transition count 7099
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 3101 transition count 7085
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 3101 transition count 7085
Applied a total of 56 rules in 2104 ms. Remains 3101 /3129 variables (removed 28) and now considering 7085/7120 (removed 35) transitions.
[2024-05-31 23:59:10] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3101 cols
[2024-05-31 23:59:10] [INFO ] Computed 57 invariants in 140 ms
[2024-05-31 23:59:15] [INFO ] Implicit Places using invariants in 4583 ms returned [1420, 1465, 1739]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4588 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3098/3159 places, 7085/7151 transitions.
Applied a total of 0 rules in 374 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13398 ms. Remains : 3098/3159 places, 7085/7151 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07
Product exploration explored 100000 steps with 20000 reset in 1357 ms.
Product exploration explored 100000 steps with 20000 reset in 1398 ms.
Computed a total of 474 stabilizing places and 1884 stable transitions
Computed a total of 474 stabilizing places and 1884 stable transitions
Detected a total of 474/3098 stabilizing places and 1884/7085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1884 resets) in 477 ms. (83 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 3098 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Applied a total of 0 rules in 369 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
[2024-05-31 23:59:20] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3098 cols
[2024-05-31 23:59:20] [INFO ] Computed 54 invariants in 122 ms
[2024-05-31 23:59:24] [INFO ] Implicit Places using invariants in 4542 ms returned []
[2024-05-31 23:59:24] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-31 23:59:24] [INFO ] Invariant cache hit.
[2024-05-31 23:59:27] [INFO ] State equation strengthened by 2607 read => feed constraints.
[2024-05-31 23:59:57] [INFO ] Performed 949/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:00:27] [INFO ] Performed 1570/3098 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:00:57] [INFO ] Performed 2203/3098 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:01:20] [INFO ] Implicit Places using invariants and state equation in 115422 ms returned []
Implicit Place search using SMT with State Equation took 119966 ms to find 0 implicit places.
Running 7060 sub problems to find dead transitions.
[2024-06-01 00:01:20] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-06-01 00:01:20] [INFO ] Invariant cache hit.
[2024-06-01 00:01:20] [INFO ] State equation strengthened by 2607 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3096 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7060 unsolved
SMT process timed out in 42972ms, After SMT, problems are : Problem set: 0 solved, 7060 unsolved
Search for dead transitions found 0 dead transitions in 43035ms
Finished structural reductions in LTL mode , in 1 iterations and 163401 ms. Remains : 3098/3098 places, 7085/7085 transitions.
Computed a total of 474 stabilizing places and 1884 stable transitions
Computed a total of 474 stabilizing places and 1884 stable transitions
Detected a total of 474/3098 stabilizing places and 1884/7085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 38533 steps (1812 resets) in 432 ms. (88 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 1388 ms.
Product exploration explored 100000 steps with 20000 reset in 1358 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 3098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3098 transition count 7085
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 3098 transition count 7085
Deduced a syphon composed of 11 places in 3 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 3098 transition count 7085
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 3095 transition count 7082
Deduced a syphon composed of 8 places in 4 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 3095 transition count 7082
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 4 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 43 place count 3095 transition count 7082
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 3094 transition count 7081
Deduced a syphon composed of 33 places in 5 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 3094 transition count 7081
Deduced a syphon composed of 33 places in 4 ms
Applied a total of 45 rules in 1903 ms. Remains 3094 /3098 variables (removed 4) and now considering 7081/7085 (removed 4) transitions.
[2024-06-01 00:02:10] [INFO ] Redundant transitions in 798 ms returned []
Running 7056 sub problems to find dead transitions.
[2024-06-01 00:02:10] [INFO ] Flow matrix only has 6481 transitions (discarded 600 similar events)
// Phase 1: matrix 6481 rows 3094 cols
[2024-06-01 00:02:10] [INFO ] Computed 54 invariants in 140 ms
[2024-06-01 00:02:10] [INFO ] State equation strengthened by 2607 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3092 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7056 unsolved
SMT process timed out in 45097ms, After SMT, problems are : Problem set: 0 solved, 7056 unsolved
Search for dead transitions found 0 dead transitions in 45157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3094/3098 places, 7081/7085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47880 ms. Remains : 3094/3098 places, 7081/7085 transitions.
Support contains 4 out of 3098 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Applied a total of 0 rules in 393 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
[2024-06-01 00:02:55] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3098 cols
[2024-06-01 00:02:56] [INFO ] Computed 54 invariants in 126 ms
[2024-06-01 00:03:00] [INFO ] Implicit Places using invariants in 4424 ms returned []
[2024-06-01 00:03:00] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-06-01 00:03:00] [INFO ] Invariant cache hit.
[2024-06-01 00:03:03] [INFO ] State equation strengthened by 2607 read => feed constraints.
[2024-06-01 00:03:34] [INFO ] Performed 948/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:04:04] [INFO ] Performed 1528/3098 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:04:34] [INFO ] Performed 2147/3098 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:04:57] [INFO ] Implicit Places using invariants and state equation in 116790 ms returned []
Implicit Place search using SMT with State Equation took 121216 ms to find 0 implicit places.
Running 7060 sub problems to find dead transitions.
[2024-06-01 00:04:57] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-06-01 00:04:57] [INFO ] Invariant cache hit.
[2024-06-01 00:04:57] [INFO ] State equation strengthened by 2607 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3096 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7060 unsolved
SMT process timed out in 42807ms, After SMT, problems are : Problem set: 0 solved, 7060 unsolved
Search for dead transitions found 0 dead transitions in 42870ms
Finished structural reductions in LTL mode , in 1 iterations and 164494 ms. Remains : 3098/3098 places, 7085/7085 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07 finished in 397968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 4 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3148 transition count 7137
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3148 transition count 7137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 3140 transition count 7122
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 3140 transition count 7122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3139 transition count 7120
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3139 transition count 7120
Applied a total of 40 rules in 1759 ms. Remains 3139 /3159 variables (removed 20) and now considering 7120/7151 (removed 31) transitions.
[2024-06-01 00:05:41] [INFO ] Flow matrix only has 6520 transitions (discarded 600 similar events)
// Phase 1: matrix 6520 rows 3139 cols
[2024-06-01 00:05:42] [INFO ] Computed 67 invariants in 162 ms
[2024-06-01 00:05:46] [INFO ] Implicit Places using invariants in 4879 ms returned [310, 470, 1218, 1313, 1427, 1472, 1488, 1539, 1572, 1704, 1762, 1919, 2035]
[2024-06-01 00:05:46] [INFO ] Actually due to overlaps returned [310, 1919, 2035, 470, 1218, 1313, 1488, 1539, 1572, 1704]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4885 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3129/3159 places, 7120/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3122 transition count 7113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3122 transition count 7113
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3115 transition count 7106
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3115 transition count 7106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3108 transition count 7099
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3108 transition count 7099
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 3101 transition count 7085
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 3101 transition count 7085
Applied a total of 56 rules in 2217 ms. Remains 3101 /3129 variables (removed 28) and now considering 7085/7120 (removed 35) transitions.
[2024-06-01 00:05:49] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3101 cols
[2024-06-01 00:05:49] [INFO ] Computed 57 invariants in 179 ms
[2024-06-01 00:05:53] [INFO ] Implicit Places using invariants in 4817 ms returned [1414, 1459, 1733]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4821 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3098/3159 places, 7085/7151 transitions.
Applied a total of 0 rules in 386 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14071 ms. Remains : 3098/3159 places, 7085/7151 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08 finished in 14209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 3159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 3154 transition count 7135
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 3143 transition count 7135
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 44 place count 3131 transition count 7119
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 3131 transition count 7119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 3131 transition count 7116
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 3128 transition count 7116
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 3120 transition count 7100
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 3120 transition count 7100
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 132 place count 3093 transition count 7073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 3092 transition count 7072
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 3092 transition count 7072
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 3091 transition count 7070
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 3091 transition count 7070
Applied a total of 136 rules in 2914 ms. Remains 3091 /3159 variables (removed 68) and now considering 7070/7151 (removed 81) transitions.
[2024-06-01 00:05:57] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3091 cols
[2024-06-01 00:05:57] [INFO ] Computed 67 invariants in 145 ms
[2024-06-01 00:06:01] [INFO ] Implicit Places using invariants in 4524 ms returned [301, 460, 1202, 1295, 1407, 1451, 1466, 1515, 1546, 1673, 1728, 1884, 1999, 2936]
[2024-06-01 00:06:01] [INFO ] Actually due to overlaps returned [301, 1884, 1999, 460, 1202, 1295, 1466, 1515, 1546, 1673, 2936]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4539 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3080/3159 places, 7070/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3073 transition count 7063
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3073 transition count 7063
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3066 transition count 7056
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3066 transition count 7056
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3059 transition count 7042
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3059 transition count 7042
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 3058 transition count 7041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3057 transition count 7040
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3057 transition count 7040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3056 transition count 7038
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3056 transition count 7038
Applied a total of 48 rules in 3246 ms. Remains 3056 /3080 variables (removed 24) and now considering 7038/7070 (removed 32) transitions.
[2024-06-01 00:06:05] [INFO ] Flow matrix only has 6438 transitions (discarded 600 similar events)
// Phase 1: matrix 6438 rows 3056 cols
[2024-06-01 00:06:05] [INFO ] Computed 56 invariants in 153 ms
[2024-06-01 00:06:09] [INFO ] Implicit Places using invariants in 4492 ms returned [1397, 1441, 1706]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4497 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3053/3159 places, 7038/7151 transitions.
Applied a total of 0 rules in 511 ms. Remains 3053 /3053 variables (removed 0) and now considering 7038/7038 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15710 ms. Remains : 3053/3159 places, 7038/7151 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09 finished in 15780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p2)&&p1)))'
Support contains 3 out of 3159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 3159 transition count 7147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 3155 transition count 7147
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 3155 transition count 7137
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 3145 transition count 7137
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 39 place count 3134 transition count 7122
Iterating global reduction 2 with 11 rules applied. Total rules applied 50 place count 3134 transition count 7122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 50 place count 3134 transition count 7119
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 3131 transition count 7119
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 3124 transition count 7105
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 3124 transition count 7105
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 124 place count 3097 transition count 7078
Applied a total of 124 rules in 2029 ms. Remains 3097 /3159 variables (removed 62) and now considering 7078/7151 (removed 73) transitions.
[2024-06-01 00:06:12] [INFO ] Flow matrix only has 6478 transitions (discarded 600 similar events)
// Phase 1: matrix 6478 rows 3097 cols
[2024-06-01 00:06:12] [INFO ] Computed 67 invariants in 154 ms
[2024-06-01 00:06:16] [INFO ] Implicit Places using invariants in 4610 ms returned [301, 1205, 1298, 1410, 1454, 1469, 1518, 1679, 1734, 1890, 2005, 2942]
[2024-06-01 00:06:16] [INFO ] Actually due to overlaps returned [301, 1890, 2005, 1205, 1298, 1469, 1518, 1679, 2942]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 4622 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3159 places, 7078/7151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3082 transition count 7072
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3082 transition count 7072
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 3076 transition count 7066
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 3076 transition count 7066
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 3070 transition count 7054
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 3070 transition count 7054
Applied a total of 36 rules in 1995 ms. Remains 3070 /3088 variables (removed 18) and now considering 7054/7078 (removed 24) transitions.
[2024-06-01 00:06:18] [INFO ] Flow matrix only has 6454 transitions (discarded 600 similar events)
// Phase 1: matrix 6454 rows 3070 cols
[2024-06-01 00:06:19] [INFO ] Computed 58 invariants in 146 ms
[2024-06-01 00:06:23] [INFO ] Implicit Places using invariants in 4530 ms returned [1403, 1447, 1718]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4537 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3067/3159 places, 7054/7151 transitions.
Applied a total of 0 rules in 536 ms. Remains 3067 /3067 variables (removed 0) and now considering 7054/7054 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 13721 ms. Remains : 3067/3159 places, 7054/7151 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4485 steps with 292 reset in 40 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13 finished in 13913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 8 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3146 transition count 7134
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3146 transition count 7134
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 3137 transition count 7117
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 3137 transition count 7117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3136 transition count 7115
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3136 transition count 7115
Applied a total of 46 rules in 1539 ms. Remains 3136 /3159 variables (removed 23) and now considering 7115/7151 (removed 36) transitions.
[2024-06-01 00:06:25] [INFO ] Flow matrix only has 6515 transitions (discarded 600 similar events)
// Phase 1: matrix 6515 rows 3136 cols
[2024-06-01 00:06:25] [INFO ] Computed 67 invariants in 148 ms
[2024-06-01 00:06:30] [INFO ] Implicit Places using invariants in 4547 ms returned [310, 470, 1218, 1313, 1427, 1472, 1488, 1539, 1572, 1704, 1761, 1918, 2034, 2976]
[2024-06-01 00:06:30] [INFO ] Actually due to overlaps returned [310, 1918, 2034, 470, 1218, 1313, 1488, 1539, 1572, 1704, 2976]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4551 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3125/3159 places, 7115/7151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3117 transition count 7107
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3117 transition count 7107
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 3109 transition count 7099
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 3109 transition count 7099
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 3101 transition count 7091
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 3101 transition count 7091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 3093 transition count 7075
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 3093 transition count 7075
Applied a total of 64 rules in 2015 ms. Remains 3093 /3125 variables (removed 32) and now considering 7075/7115 (removed 40) transitions.
[2024-06-01 00:06:32] [INFO ] Flow matrix only has 6475 transitions (discarded 600 similar events)
// Phase 1: matrix 6475 rows 3093 cols
[2024-06-01 00:06:32] [INFO ] Computed 56 invariants in 168 ms
[2024-06-01 00:06:36] [INFO ] Implicit Places using invariants in 4486 ms returned [1414, 1459, 1732]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4489 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3090/3159 places, 7075/7151 transitions.
Applied a total of 0 rules in 351 ms. Remains 3090 /3090 variables (removed 0) and now considering 7075/7075 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12949 ms. Remains : 3090/3159 places, 7075/7151 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14 finished in 13108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F((!p1||G(F(!p1)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 6 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 3154 transition count 7135
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 3143 transition count 7135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 43 place count 3132 transition count 7120
Iterating global reduction 2 with 11 rules applied. Total rules applied 54 place count 3132 transition count 7120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 54 place count 3132 transition count 7117
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 3129 transition count 7117
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 3122 transition count 7103
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 3122 transition count 7103
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 128 place count 3095 transition count 7076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 3094 transition count 7075
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 3094 transition count 7075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 3093 transition count 7073
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 3093 transition count 7073
Applied a total of 132 rules in 2727 ms. Remains 3093 /3159 variables (removed 66) and now considering 7073/7151 (removed 78) transitions.
[2024-06-01 00:06:40] [INFO ] Flow matrix only has 6473 transitions (discarded 600 similar events)
// Phase 1: matrix 6473 rows 3093 cols
[2024-06-01 00:06:40] [INFO ] Computed 67 invariants in 147 ms
[2024-06-01 00:06:44] [INFO ] Implicit Places using invariants in 4336 ms returned [301, 460, 1202, 1295, 1453, 1468, 1517, 1548, 1675, 1730, 2001, 2938]
[2024-06-01 00:06:44] [INFO ] Actually due to overlaps returned [301, 2001, 460, 1202, 1295, 1468, 1517, 1548, 1675, 2938]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4342 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3083/3159 places, 7073/7151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3076 transition count 7066
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3076 transition count 7066
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3069 transition count 7059
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3069 transition count 7059
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 3062 transition count 7045
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 3062 transition count 7045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 3061 transition count 7044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3060 transition count 7043
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3060 transition count 7043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3059 transition count 7041
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3059 transition count 7041
Applied a total of 48 rules in 3169 ms. Remains 3059 /3083 variables (removed 24) and now considering 7041/7073 (removed 32) transitions.
[2024-06-01 00:06:47] [INFO ] Flow matrix only has 6441 transitions (discarded 600 similar events)
// Phase 1: matrix 6441 rows 3059 cols
[2024-06-01 00:06:47] [INFO ] Computed 57 invariants in 141 ms
[2024-06-01 00:06:51] [INFO ] Implicit Places using invariants in 4146 ms returned [1443, 1708]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4150 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 3057/3159 places, 7041/7151 transitions.
Applied a total of 0 rules in 426 ms. Remains 3057 /3057 variables (removed 0) and now considering 7041/7041 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 14816 ms. Remains : 3057/3159 places, 7041/7151 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
Product exploration explored 100000 steps with 6600 reset in 873 ms.
Product exploration explored 100000 steps with 6597 reset in 892 ms.
Computed a total of 458 stabilizing places and 1865 stable transitions
Computed a total of 458 stabilizing places and 1865 stable transitions
Detected a total of 458/3057 stabilizing places and 1865/7041 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
RANDOM walk for 4333 steps (283 resets) in 61 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 178 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 68 ms :[p1, p1]
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
Support contains 2 out of 3057 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 : 3057/3057 places, 7041/7041 transitions.
Applied a total of 0 rules in 497 ms. Remains 3057 /3057 variables (removed 0) and now considering 7041/7041 (removed 0) transitions.
[2024-06-01 00:06:55] [INFO ] Flow matrix only has 6441 transitions (discarded 600 similar events)
// Phase 1: matrix 6441 rows 3057 cols
[2024-06-01 00:06:55] [INFO ] Computed 55 invariants in 157 ms
[2024-06-01 00:06:59] [INFO ] Implicit Places using invariants in 4136 ms returned []
[2024-06-01 00:06:59] [INFO ] Flow matrix only has 6441 transitions (discarded 600 similar events)
[2024-06-01 00:06:59] [INFO ] Invariant cache hit.
[2024-06-01 00:07:02] [INFO ] State equation strengthened by 2605 read => feed constraints.
[2024-06-01 00:07:32] [INFO ] Performed 972/3057 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:08:02] [INFO ] Performed 1488/3057 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:08:32] [INFO ] Performed 2296/3057 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:08:50] [INFO ] Implicit Places using invariants and state equation in 110840 ms returned [3048]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114982 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3056/3057 places, 7041/7041 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3056 transition count 7040
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3055 transition count 7040
Applied a total of 2 rules in 533 ms. Remains 3055 /3056 variables (removed 1) and now considering 7040/7041 (removed 1) transitions.
[2024-06-01 00:08:50] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
// Phase 1: matrix 6440 rows 3055 cols
[2024-06-01 00:08:50] [INFO ] Computed 54 invariants in 161 ms
[2024-06-01 00:08:55] [INFO ] Implicit Places using invariants in 4278 ms returned []
[2024-06-01 00:08:55] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
[2024-06-01 00:08:55] [INFO ] Invariant cache hit.
[2024-06-01 00:08:57] [INFO ] State equation strengthened by 2605 read => feed constraints.
[2024-06-01 00:09:28] [INFO ] Performed 1078/3055 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-06-01 00:09:59] [INFO ] Performed 1649/3055 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 00:10:29] [INFO ] Performed 2754/3055 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-06-01 00:10:35] [INFO ] Implicit Places using invariants and state equation in 99971 ms returned []
Implicit Place search using SMT with State Equation took 104251 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3055/3057 places, 7040/7041 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220265 ms. Remains : 3055/3057 places, 7040/7041 transitions.
Computed a total of 456 stabilizing places and 1864 stable transitions
Computed a total of 456 stabilizing places and 1864 stable transitions
Detected a total of 456/3055 stabilizing places and 1864/7040 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 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 71 ms :[p1, p1]
RANDOM walk for 6525 steps (433 resets) in 94 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 116 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 70 ms :[p1, p1]
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Stuttering acceptance computed with spot in 50 ms :[p1, p1]
Product exploration explored 100000 steps with 6700 reset in 863 ms.
Product exploration explored 100000 steps with 6704 reset in 888 ms.
Support contains 2 out of 3055 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3055/3055 places, 7040/7040 transitions.
Applied a total of 0 rules in 501 ms. Remains 3055 /3055 variables (removed 0) and now considering 7040/7040 (removed 0) transitions.
[2024-06-01 00:10:37] [INFO ] Flow matrix only has 6440 transitions (discarded 600 similar events)
[2024-06-01 00:10:37] [INFO ] Invariant cache hit.
[2024-06-01 00:10:42] [INFO ] Implicit Places using invariants in 4321 ms returned [1399, 1862]
[2024-06-01 00:10:42] [INFO ] Actually due to overlaps returned [1862]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4324 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3054/3055 places, 7040/7040 transitions.
Applied a total of 0 rules in 512 ms. Remains 3054 /3054 variables (removed 0) and now considering 7040/7040 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5337 ms. Remains : 3054/3055 places, 7040/7040 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06 finished in 245583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&F(p1))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 3159 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3159/3159 places, 7151/7151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3159 transition count 7146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3154 transition count 7146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 3154 transition count 7136
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 3144 transition count 7136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 40 place count 3134 transition count 7123
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 3134 transition count 7123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 3134 transition count 7121
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 3132 transition count 7121
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 3125 transition count 7107
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 3125 transition count 7107
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 124 place count 3097 transition count 7079
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 3096 transition count 7078
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 3096 transition count 7078
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 3095 transition count 7076
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 3095 transition count 7076
Applied a total of 128 rules in 2646 ms. Remains 3095 /3159 variables (removed 64) and now considering 7076/7151 (removed 75) transitions.
[2024-06-01 00:10:45] [INFO ] Flow matrix only has 6476 transitions (discarded 600 similar events)
// Phase 1: matrix 6476 rows 3095 cols
[2024-06-01 00:10:46] [INFO ] Computed 67 invariants in 149 ms
[2024-06-01 00:10:50] [INFO ] Implicit Places using invariants in 4491 ms returned [302, 461, 1299, 1411, 1455, 1470, 1519, 1550, 1678, 1733, 1889, 2004, 2941]
[2024-06-01 00:10:50] [INFO ] Actually due to overlaps returned [302, 1889, 2004, 461, 1299, 1470, 1519, 1550, 1678, 2941]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4495 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3085/3159 places, 7076/7151 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3080 transition count 7071
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3080 transition count 7071
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 3075 transition count 7066
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 3075 transition count 7066
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 3070 transition count 7056
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 3070 transition count 7056
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 3068 transition count 7054
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 3066 transition count 7052
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 3066 transition count 7052
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 3064 transition count 7048
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 3064 transition count 7048
Applied a total of 42 rules in 3383 ms. Remains 3064 /3085 variables (removed 21) and now considering 7048/7076 (removed 28) transitions.
[2024-06-01 00:10:53] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
// Phase 1: matrix 6448 rows 3064 cols
[2024-06-01 00:10:53] [INFO ] Computed 57 invariants in 163 ms
[2024-06-01 00:10:58] [INFO ] Implicit Places using invariants in 4465 ms returned [1404, 1448, 1714]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 4470 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 3061/3159 places, 7048/7151 transitions.
Applied a total of 0 rules in 433 ms. Remains 3061 /3061 variables (removed 0) and now considering 7048/7048 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 15427 ms. Remains : 3061/3159 places, 7048/7151 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07
Product exploration explored 100000 steps with 20000 reset in 1348 ms.
Product exploration explored 100000 steps with 20000 reset in 1357 ms.
Computed a total of 462 stabilizing places and 1872 stable transitions
Computed a total of 462 stabilizing places and 1872 stable transitions
Detected a total of 462/3061 stabilizing places and 1872/7048 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2637 resets) in 518 ms. (77 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 3061 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3061/3061 places, 7048/7048 transitions.
Applied a total of 0 rules in 393 ms. Remains 3061 /3061 variables (removed 0) and now considering 7048/7048 (removed 0) transitions.
[2024-06-01 00:11:02] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
// Phase 1: matrix 6448 rows 3061 cols
[2024-06-01 00:11:03] [INFO ] Computed 54 invariants in 146 ms
[2024-06-01 00:11:07] [INFO ] Implicit Places using invariants in 4480 ms returned []
[2024-06-01 00:11:07] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
[2024-06-01 00:11:07] [INFO ] Invariant cache hit.
[2024-06-01 00:11:09] [INFO ] State equation strengthened by 2607 read => feed constraints.
[2024-06-01 00:11:42] [INFO ] Performed 1079/3061 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 00:12:12] [INFO ] Performed 1626/3061 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 00:12:42] [INFO ] Performed 2643/3061 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-06-01 00:12:50] [INFO ] Implicit Places using invariants and state equation in 103008 ms returned []
Implicit Place search using SMT with State Equation took 107488 ms to find 0 implicit places.
Running 7023 sub problems to find dead transitions.
[2024-06-01 00:12:50] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
[2024-06-01 00:12:50] [INFO ] Invariant cache hit.
[2024-06-01 00:12:50] [INFO ] State equation strengthened by 2607 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3059 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7023 unsolved
SMT process timed out in 44447ms, After SMT, problems are : Problem set: 0 solved, 7023 unsolved
Search for dead transitions found 0 dead transitions in 44509ms
Finished structural reductions in LTL mode , in 1 iterations and 152404 ms. Remains : 3061/3061 places, 7048/7048 transitions.
Computed a total of 462 stabilizing places and 1872 stable transitions
Computed a total of 462 stabilizing places and 1872 stable transitions
Detected a total of 462/3061 stabilizing places and 1872/7048 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2631 resets) in 427 ms. (93 steps per ms) remains 1/3 properties
BEST_FIRST walk for 35778 steps (320 resets) in 88 ms. (402 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 1363 ms.
Product exploration explored 100000 steps with 20000 reset in 1401 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 3061 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3061/3061 places, 7048/7048 transitions.
Applied a total of 0 rules in 521 ms. Remains 3061 /3061 variables (removed 0) and now considering 7048/7048 (removed 0) transitions.
[2024-06-01 00:13:40] [INFO ] Redundant transitions in 456 ms returned []
Running 7023 sub problems to find dead transitions.
[2024-06-01 00:13:40] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
[2024-06-01 00:13:40] [INFO ] Invariant cache hit.
[2024-06-01 00:13:40] [INFO ] State equation strengthened by 2607 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3059 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7023 unsolved
SMT process timed out in 44469ms, After SMT, problems are : Problem set: 0 solved, 7023 unsolved
Search for dead transitions found 0 dead transitions in 44529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45525 ms. Remains : 3061/3061 places, 7048/7048 transitions.
Support contains 4 out of 3061 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3061/3061 places, 7048/7048 transitions.
Applied a total of 0 rules in 383 ms. Remains 3061 /3061 variables (removed 0) and now considering 7048/7048 (removed 0) transitions.
[2024-06-01 00:14:25] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
[2024-06-01 00:14:25] [INFO ] Invariant cache hit.
[2024-06-01 00:14:29] [INFO ] Implicit Places using invariants in 4383 ms returned []
[2024-06-01 00:14:29] [INFO ] Flow matrix only has 6448 transitions (discarded 600 similar events)
[2024-06-01 00:14:29] [INFO ] Invariant cache hit.
[2024-06-01 00:14:32] [INFO ] State equation strengthened by 2607 read => feed constraints.
[2024-06-01 00:15:02] [INFO ] Performed 643/3061 implicitness test of which 0 returned IMPLICIT in 30 seconds.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-01
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-10
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-12
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717202148319
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-00
ltl formula formula --ltl=/tmp/2048/ltl_0_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.140 real 0.340 user 0.570 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10865 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26
pnml2lts-mc( 0/ 4): unique states count: 26
pnml2lts-mc( 0/ 4): unique transitions count: 25
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 40
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 41
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 41 states 104 transitions, fanout: 2.537
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.160 sec minimum, 0.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 228, Transitions per second: 578
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 153.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-01
ltl formula formula --ltl=/tmp/2048/ltl_1_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.180 real 0.370 user 0.440 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~23108 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~40000 states ~45844 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-02
ltl formula formula --ltl=/tmp/2048/ltl_2_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.340 user 0.440 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10873 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.270 sec minimum, 0.275 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 1629
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-03
ltl formula formula --ltl=/tmp/2048/ltl_3_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.410 user 0.340 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 82
pnml2lts-mc( 0/ 4): unique transitions count: 402
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 85
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 85 states 556 transitions, fanout: 6.541
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.260 sec minimum, 0.262 sec on average)
pnml2lts-mc( 0/ 4): States per second: 315, Transitions per second: 2059
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-04
ltl formula formula --ltl=/tmp/2048/ltl_4_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.400 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10865 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~24 levels ~10000 states ~11604 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~23108 transitions
pnml2lts-mc( 2/ 4): ~27 levels ~40000 states ~46108 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-05
ltl formula formula --ltl=/tmp/2048/ltl_5_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.370 user 0.400 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 626
pnml2lts-mc( 0/ 4): unique states count: 626
pnml2lts-mc( 0/ 4): unique transitions count: 625
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 177
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 669
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 669 states 968 transitions, fanout: 1.447
pnml2lts-mc( 0/ 4): Total exploration time 1.970 sec (1.960 sec minimum, 1.965 sec on average)
pnml2lts-mc( 0/ 4): States per second: 340, Transitions per second: 491
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 66.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-06
ltl formula formula --ltl=/tmp/2048/ltl_6_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.090 real 0.410 user 0.340 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10864 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 2/ 4): ~25 levels ~20000 states ~23020 transitions
pnml2lts-mc( 2/ 4): ~25 levels ~40000 states ~45756 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-07
ltl formula formula --ltl=/tmp/2048/ltl_7_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.340 user 0.430 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10862 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1826
pnml2lts-mc( 0/ 4): unique states count: 1826
pnml2lts-mc( 0/ 4): unique transitions count: 1825
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 214
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1905
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1905 states 2266 transitions, fanout: 1.190
pnml2lts-mc( 0/ 4): Total exploration time 5.560 sec (5.550 sec minimum, 5.557 sec on average)
pnml2lts-mc( 0/ 4): States per second: 343, Transitions per second: 408
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 56.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-08
ltl formula formula --ltl=/tmp/2048/ltl_8_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.390 user 0.380 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10863 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.250 sec (0.250 sec minimum, 0.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 336, Transitions per second: 1824
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.8 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-09
ltl formula formula --ltl=/tmp/2048/ltl_9_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.400 user 0.370 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10859 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.340 sec (0.330 sec minimum, 0.335 sec on average)
pnml2lts-mc( 0/ 4): States per second: 247, Transitions per second: 1341
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 67.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-10
ltl formula formula --ltl=/tmp/2048/ltl_10_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.410 user 0.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10875 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~24 levels ~10000 states ~11608 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~20000 states ~23024 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~40000 states ~45852 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-11
ltl formula formula --ltl=/tmp/2048/ltl_11_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.380 user 0.380 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10860 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 82
pnml2lts-mc( 0/ 4): unique transitions count: 378
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 85
pnml2lts-mc( 0/ 4): - cum. max stack depth: 85
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 85 states 457 transitions, fanout: 5.376
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.260 sec minimum, 0.268 sec on average)
pnml2lts-mc( 0/ 4): States per second: 315, Transitions per second: 1693
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 61.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-12
ltl formula formula --ltl=/tmp/2048/ltl_12_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.420 user 0.350 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10872 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~21 levels ~10000 states ~12144 transitions
pnml2lts-mc( 0/ 4): ~21 levels ~20000 states ~24008 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~40000 states ~46740 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-13
ltl formula formula --ltl=/tmp/2048/ltl_13_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.340 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10868 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 75
pnml2lts-mc( 0/ 4): unique transitions count: 717
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 78
pnml2lts-mc( 0/ 4): - cum. max stack depth: 78
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 78 states 796 transitions, fanout: 10.205
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.260 sec minimum, 0.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 3062
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-14
ltl formula formula --ltl=/tmp/2048/ltl_14_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.450 user 0.360 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10897 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.252 sec on average)
pnml2lts-mc( 0/ 4): States per second: 323, Transitions per second: 1754
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLFireability-15
ltl formula formula --ltl=/tmp/2048/ltl_15_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.410 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2048/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2048/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2048/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2048/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10866 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.255 sec on average)
pnml2lts-mc( 0/ 4): States per second: 323, Transitions per second: 1754
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 66.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
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="MultiCrashLeafsetExtension-PT-S24C02"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, 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 r508-tall-171654350800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C02.tgz
mv MultiCrashLeafsetExtension-PT-S24C02 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 ;