About the Execution of LTSMin+red for DoubleExponent-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2737.947 | 774046.00 | 923598.00 | 2600.00 | FF?TFFFFFFFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418600500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DoubleExponent-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.5M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678896143028
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 16:02:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 16:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:02:27] [INFO ] Load time of PNML (sax parser for PT used): 649 ms
[2023-03-15 16:02:27] [INFO ] Transformed 10604 places.
[2023-03-15 16:02:27] [INFO ] Transformed 9998 transitions.
[2023-03-15 16:02:27] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 851 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-200-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 5074 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:02:38] [INFO ] Invariants computation overflowed in 564 ms
[2023-03-15 16:02:39] [INFO ] Implicit Places using invariants in 2508 ms returned []
Implicit Place search using SMT only with invariants took 2547 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:02:40] [INFO ] Invariants computation overflowed in 393 ms
[2023-03-15 16:02:41] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9585 ms. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 41 out of 10600 places after structural reductions.
[2023-03-15 16:02:45] [INFO ] Flatten gal took : 819 ms
[2023-03-15 16:02:45] [INFO ] Flatten gal took : 447 ms
[2023-03-15 16:02:46] [INFO ] Input system was already deterministic with 9998 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 24380 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24380 steps, saw 12196 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:02:56] [INFO ] Invariants computation overflowed in 409 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:03:21] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 41 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.44 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2364 transitions
Trivial Post-agglo rules discarded 2364 transitions
Performed 2364 trivial Post agglomeration. Transition count delta: 2364
Iterating post reduction 0 with 2367 rules applied. Total rules applied 2368 place count 10597 transition count 7632
Reduce places removed 2364 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 2376 rules applied. Total rules applied 4744 place count 8233 transition count 7620
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 4756 place count 8221 transition count 7620
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 404 Pre rules applied. Total rules applied 4756 place count 8221 transition count 7216
Deduced a syphon composed of 404 places in 1010 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 3 with 808 rules applied. Total rules applied 5564 place count 7817 transition count 7216
Performed 1786 Post agglomeration using F-continuation condition.Transition count delta: 1786
Deduced a syphon composed of 1786 places in 385 ms
Reduce places removed 1786 places and 0 transitions.
Iterating global reduction 3 with 3572 rules applied. Total rules applied 9136 place count 6031 transition count 5430
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 318 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9338 place count 5930 transition count 5430
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 379 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9540 place count 5829 transition count 5430
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 302 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9742 place count 5728 transition count 5430
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 262 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 9918 place count 5640 transition count 5430
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9919 place count 5640 transition count 5429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9920 place count 5639 transition count 5429
Free-agglomeration rule (complex) applied 795 times.
Iterating global reduction 4 with 795 rules applied. Total rules applied 10715 place count 5639 transition count 4634
Reduce places removed 795 places and 0 transitions.
Iterating post reduction 4 with 795 rules applied. Total rules applied 11510 place count 4844 transition count 4634
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 5 with 801 rules applied. Total rules applied 12311 place count 4844 transition count 4634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12312 place count 4843 transition count 4633
Applied a total of 12312 rules in 12295 ms. Remains 4843 /10600 variables (removed 5757) and now considering 4633/9998 (removed 5365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12299 ms. Remains : 4843/10600 places, 4633/9998 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 43923 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43923 steps, saw 21972 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 4633 rows 4843 cols
[2023-03-15 16:03:38] [INFO ] Invariants computation overflowed in 125 ms
[2023-03-15 16:04:03] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-15 16:04:28] [INFO ] After 19419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-15 16:04:28] [INFO ] State equation strengthened by 786 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:04:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:04:28] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 4843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4843/4843 places, 4633/4633 transitions.
Applied a total of 0 rules in 711 ms. Remains 4843 /4843 variables (removed 0) and now considering 4633/4633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 4843/4843 places, 4633/4633 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4843/4843 places, 4633/4633 transitions.
Applied a total of 0 rules in 727 ms. Remains 4843 /4843 variables (removed 0) and now considering 4633/4633 (removed 0) transitions.
// Phase 1: matrix 4633 rows 4843 cols
[2023-03-15 16:04:30] [INFO ] Invariants computation overflowed in 187 ms
[2023-03-15 16:05:00] [INFO ] Performed 4343/4843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 16:05:02] [INFO ] Implicit Places using invariants in 32554 ms returned []
// Phase 1: matrix 4633 rows 4843 cols
[2023-03-15 16:05:02] [INFO ] Invariants computation overflowed in 120 ms
[2023-03-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 34236 ms to find 0 implicit places.
[2023-03-15 16:05:04] [INFO ] Redundant transitions in 574 ms returned []
// Phase 1: matrix 4633 rows 4843 cols
[2023-03-15 16:05:04] [INFO ] Invariants computation overflowed in 120 ms
[2023-03-15 16:05:11] [INFO ] Dead Transitions using invariants and state equation in 6337 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41889 ms. Remains : 4843/4843 places, 4633/4633 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.60 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4394 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:05:16] [INFO ] Invariants computation overflowed in 321 ms
[2023-03-15 16:05:17] [INFO ] Implicit Places using invariants in 1626 ms returned []
Implicit Place search using SMT only with invariants took 1628 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:05:17] [INFO ] Invariants computation overflowed in 312 ms
[2023-03-15 16:05:19] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7636 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s1579 1), p0:(AND (GEQ s1579 1) (LT s5992 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 7 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-00 finished in 10010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4796 place count 8201 transition count 7599
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7198
Deduced a syphon composed of 401 places in 1239 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 364 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 316 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 280 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 269 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 255 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9999 place count 5599 transition count 5395
Applied a total of 9999 rules in 9025 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2023-03-15 16:05:30] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-15 16:05:31] [INFO ] Implicit Places using invariants in 936 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2023-03-15 16:05:31] [INFO ] Invariants computation overflowed in 153 ms
[2023-03-15 16:05:33] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2513 ms to find 0 implicit places.
[2023-03-15 16:05:33] [INFO ] Redundant transitions in 502 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2023-03-15 16:05:33] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-15 16:05:34] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/10600 places, 5395/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12901 ms. Remains : 5599/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1512 1), p0:(GEQ s3136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-01 finished in 13276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||(p1 U (G(p1)||(p1&&G(p0)))))))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4333 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:05:39] [INFO ] Invariants computation overflowed in 306 ms
[2023-03-15 16:05:40] [INFO ] Implicit Places using invariants in 1607 ms returned []
Implicit Place search using SMT only with invariants took 1612 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:05:41] [INFO ] Invariants computation overflowed in 306 ms
[2023-03-15 16:05:42] [INFO ] Dead Transitions using invariants and state equation in 1606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7558 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(LT s9624 1), p0:(GEQ s2707 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3327 reset in 640 ms.
Product exploration explored 100000 steps with 3292 reset in 560 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 21942 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21942 steps, saw 10977 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:05:55] [INFO ] Invariants computation overflowed in 442 ms
[2023-03-15 16:06:20] [INFO ] After 21194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-15 16:06:20] [INFO ] After 21204ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 16:06:20] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:3
[2023-03-15 16:06:45] [INFO ] After 21503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 16:06:45] [INFO ] After 21504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 16:06:45] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2009 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2403 rules applied. Total rules applied 2404 place count 10597 transition count 7596
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7197
Deduced a syphon composed of 399 places in 867 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1805 Post agglomeration using F-continuation condition.Transition count delta: 1805
Deduced a syphon composed of 1805 places in 366 ms
Reduce places removed 1805 places and 0 transitions.
Iterating global reduction 2 with 3610 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 294 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 282 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 260 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 343 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 10803 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 11600 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 3 with 801 rules applied. Total rules applied 12401 place count 4799 transition count 4595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Applied a total of 12402 rules in 12514 ms. Remains 4798 /10600 variables (removed 5802) and now considering 4594/9998 (removed 5404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12515 ms. Remains : 4798/10600 places, 4594/9998 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 40704 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40704 steps, saw 20363 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:07:05] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 16:07:30] [INFO ] After 23371ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-15 16:07:30] [INFO ] State equation strengthened by 798 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:07:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:07:30] [INFO ] After 25057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 4798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1482 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1485 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1494 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:07:35] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-15 16:08:06] [INFO ] Performed 780/4798 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 16:08:37] [INFO ] Performed 1367/4798 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2023-03-15 16:09:07] [INFO ] Performed 1950/4798 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2023-03-15 16:09:37] [INFO ] Performed 2626/4798 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-15 16:09:37] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-15 16:09:37] [INFO ] Implicit Places using invariants in 122210 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:09:37] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-15 16:09:39] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 123879 ms to find 0 implicit places.
[2023-03-15 16:09:40] [INFO ] Redundant transitions in 944 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:09:40] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 16:09:48] [INFO ] Dead Transitions using invariants and state equation in 8898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135226 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 392 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4670 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:09:56] [INFO ] Invariants computation overflowed in 487 ms
[2023-03-15 16:09:57] [INFO ] Implicit Places using invariants in 2026 ms returned []
Implicit Place search using SMT only with invariants took 2027 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:09:58] [INFO ] Invariants computation overflowed in 338 ms
[2023-03-15 16:09:59] [INFO ] Dead Transitions using invariants and state equation in 1646 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8344 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 18863 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18863 steps, saw 9437 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:10:11] [INFO ] Invariants computation overflowed in 329 ms
[2023-03-15 16:10:36] [INFO ] After 20875ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 16:10:36] [INFO ] After 20882ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 16:10:36] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 16:11:01] [INFO ] After 20300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 16:11:01] [INFO ] After 20301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 16:11:01] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2003 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2403 rules applied. Total rules applied 2404 place count 10597 transition count 7596
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7197
Deduced a syphon composed of 399 places in 1019 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1805 Post agglomeration using F-continuation condition.Transition count delta: 1805
Deduced a syphon composed of 1805 places in 352 ms
Reduce places removed 1805 places and 0 transitions.
Iterating global reduction 2 with 3610 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 286 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 270 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 369 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 254 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 10803 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 11600 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 3 with 801 rules applied. Total rules applied 12401 place count 4799 transition count 4595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Applied a total of 12402 rules in 12490 ms. Remains 4798 /10600 variables (removed 5802) and now considering 4594/9998 (removed 5404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12491 ms. Remains : 4798/10600 places, 4594/9998 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 39642 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39642 steps, saw 19833 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:11:20] [INFO ] Invariants computation overflowed in 134 ms
[2023-03-15 16:11:45] [INFO ] After 23176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-15 16:11:45] [INFO ] State equation strengthened by 798 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:11:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:11:46] [INFO ] After 25056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 4798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1449 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1830 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:11:51] [INFO ] Invariants computation overflowed in 133 ms
[2023-03-15 16:11:52] [INFO ] Implicit Places using invariants in 1090 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:11:52] [INFO ] Invariants computation overflowed in 122 ms
[2023-03-15 16:11:54] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
[2023-03-15 16:11:55] [INFO ] Redundant transitions in 1072 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2023-03-15 16:11:55] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 16:12:03] [INFO ] Dead Transitions using invariants and state equation in 8481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14159 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3309 reset in 501 ms.
Product exploration explored 100000 steps with 3293 reset in 517 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10600 transition count 9998
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 2398 place count 10600 transition count 10397
Deduced a syphon composed of 2798 places in 1203 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 2798 place count 10600 transition count 10397
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2800 place count 10598 transition count 10395
Deduced a syphon composed of 2796 places in 1118 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2802 place count 10598 transition count 10395
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4598 places in 716 ms
Iterating global reduction 1 with 1802 rules applied. Total rules applied 4604 place count 10598 transition count 10795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4605 place count 10597 transition count 10794
Deduced a syphon composed of 4597 places in 672 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4606 place count 10597 transition count 10794
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4698 places in 893 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4707 place count 10597 transition count 11450
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4808 place count 10496 transition count 11248
Deduced a syphon composed of 4597 places in 654 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4909 place count 10496 transition count 11248
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -654
Deduced a syphon composed of 4698 places in 844 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5010 place count 10496 transition count 11902
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5111 place count 10395 transition count 11700
Deduced a syphon composed of 4597 places in 638 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5212 place count 10395 transition count 11700
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -659
Deduced a syphon composed of 4698 places in 648 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5313 place count 10395 transition count 12359
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5414 place count 10294 transition count 12157
Deduced a syphon composed of 4597 places in 630 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5515 place count 10294 transition count 12157
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -618
Deduced a syphon composed of 4693 places in 856 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5611 place count 10294 transition count 12775
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 5707 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 636 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5803 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 638 ms
Applied a total of 5803 rules in 31524 ms. Remains 10198 /10600 variables (removed 402) and now considering 12583/9998 (removed -2585) transitions.
// Phase 1: matrix 12583 rows 10198 cols
[2023-03-15 16:12:39] [INFO ] Invariants computation overflowed in 438 ms
[2023-03-15 16:12:40] [INFO ] Dead Transitions using invariants and state equation in 1903 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10198/10600 places, 12583/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33432 ms. Remains : 10198/10600 places, 12583/9998 transitions.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4380 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:12:45] [INFO ] Invariants computation overflowed in 303 ms
[2023-03-15 16:12:46] [INFO ] Implicit Places using invariants in 1652 ms returned []
Implicit Place search using SMT only with invariants took 1658 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:12:46] [INFO ] Invariants computation overflowed in 336 ms
[2023-03-15 16:12:48] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7778 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Treatment of property DoubleExponent-PT-200-LTLFireability-02 finished in 440547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||F((G(F(p2))||(p0&&F(p2)))))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4725 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:00] [INFO ] Invariants computation overflowed in 318 ms
[2023-03-15 16:13:01] [INFO ] Implicit Places using invariants in 1873 ms returned []
Implicit Place search using SMT only with invariants took 1875 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:02] [INFO ] Invariants computation overflowed in 317 ms
[2023-03-15 16:13:03] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8333 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1000 1), p2:(AND (GEQ s203 1) (GEQ s243 1)), p1:(AND (GEQ s203 1) (GEQ s243 1) (OR (LT s1733 1) (LT s1754 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9250 ms.
Product exploration explored 100000 steps with 50000 reset in 9374 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLFireability-03 finished in 29510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4441 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:29] [INFO ] Invariants computation overflowed in 298 ms
[2023-03-15 16:13:31] [INFO ] Implicit Places using invariants in 1782 ms returned []
Implicit Place search using SMT only with invariants took 1783 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:31] [INFO ] Invariants computation overflowed in 311 ms
[2023-03-15 16:13:32] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8121 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8565 1) (GEQ s8600 1)), p1:(OR (GEQ s7569 1) (AND (GEQ s968 1) (GEQ s1008 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-04 finished in 10307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4398 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:39] [INFO ] Invariants computation overflowed in 306 ms
[2023-03-15 16:13:41] [INFO ] Implicit Places using invariants in 1937 ms returned []
Implicit Place search using SMT only with invariants took 1942 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:41] [INFO ] Invariants computation overflowed in 317 ms
[2023-03-15 16:13:43] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8131 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4904 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-05 finished in 10198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4706 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:50] [INFO ] Invariants computation overflowed in 466 ms
[2023-03-15 16:13:52] [INFO ] Implicit Places using invariants in 1986 ms returned []
Implicit Place search using SMT only with invariants took 1987 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:13:52] [INFO ] Invariants computation overflowed in 331 ms
[2023-03-15 16:13:54] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8682 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-06 finished in 10933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4791 place count 8205 transition count 7600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7200
Deduced a syphon composed of 400 places in 1184 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 372 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 295 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 274 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 268 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 291 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9994 place count 5602 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5397
Applied a total of 9995 rules in 8775 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5601 cols
[2023-03-15 16:14:05] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-15 16:14:06] [INFO ] Implicit Places using invariants in 1024 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2023-03-15 16:14:06] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-15 16:14:07] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2023-03-15 16:14:08] [INFO ] Redundant transitions in 574 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2023-03-15 16:14:08] [INFO ] Invariants computation overflowed in 150 ms
[2023-03-15 16:14:09] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5601/10600 places, 5397/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13243 ms. Remains : 5601/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3881 1), p1:(AND (GEQ s4785 1) (GEQ s4797 1) (GEQ s148 1) (GEQ s156 1)), p2:(GEQ s2776 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-07 finished in 13648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2395 transitions
Trivial Post-agglo rules discarded 2395 transitions
Performed 2395 trivial Post agglomeration. Transition count delta: 2395
Iterating post reduction 0 with 2395 rules applied. Total rules applied 2395 place count 10599 transition count 7602
Reduce places removed 2395 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4792 place count 8204 transition count 7600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7199
Deduced a syphon composed of 401 places in 1053 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 344 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9200 place count 5999 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 304 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9402 place count 5898 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 278 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9604 place count 5797 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 265 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9806 place count 5696 transition count 5397
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 259 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9996 place count 5601 transition count 5397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9997 place count 5600 transition count 5396
Applied a total of 9997 rules in 8484 ms. Remains 5600 /10600 variables (removed 5000) and now considering 5396/9998 (removed 4602) transitions.
// Phase 1: matrix 5396 rows 5600 cols
[2023-03-15 16:14:18] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-15 16:14:19] [INFO ] Implicit Places using invariants in 1042 ms returned []
// Phase 1: matrix 5396 rows 5600 cols
[2023-03-15 16:14:19] [INFO ] Invariants computation overflowed in 124 ms
[2023-03-15 16:14:21] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
[2023-03-15 16:14:21] [INFO ] Redundant transitions in 766 ms returned []
// Phase 1: matrix 5396 rows 5600 cols
[2023-03-15 16:14:22] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-15 16:14:22] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/10600 places, 5396/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12837 ms. Remains : 5600/10600 places, 5396/9998 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3281 1) (GEQ s3288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-08 finished in 13208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(p1)&&X(X(G(p2))))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4594 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:28] [INFO ] Invariants computation overflowed in 438 ms
[2023-03-15 16:14:29] [INFO ] Implicit Places using invariants in 1943 ms returned []
Implicit Place search using SMT only with invariants took 1944 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:29] [INFO ] Invariants computation overflowed in 290 ms
[2023-03-15 16:14:31] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8282 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 658 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p1) p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={0, 1} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 8}, { cond=(NOT p1), acceptance={0, 1} source=4 dest: 9}, { cond=p1, acceptance={1} source=4 dest: 10}, { cond=p1, acceptance={0, 1} source=4 dest: 11}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=9 dest: 2}, { cond=p1, acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=9 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 10}, { cond=(AND p1 p2), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=10 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=10 dest: 12}], [{ cond=p1, acceptance={} source=11 dest: 3}, { cond=(NOT p1), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=11 dest: 9}, { cond=(AND p1 p2), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={1} source=11 dest: 10}, { cond=(AND p1 p2), acceptance={0} source=11 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=11 dest: 11}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(LT s10126 1), p0:(AND (GEQ s4911 1) (GEQ s4932 1)), p2:(AND (LT s10126 1) (GEQ s3600 1) (GEQ s3615 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-09 finished in 11236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X(G((G((p0 U p2))||X(p0)))))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4190 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:38] [INFO ] Invariants computation overflowed in 329 ms
[2023-03-15 16:14:40] [INFO ] Implicit Places using invariants in 1903 ms returned []
Implicit Place search using SMT only with invariants took 1910 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:40] [INFO ] Invariants computation overflowed in 291 ms
[2023-03-15 16:14:42] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7649 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 1289 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(OR (AND p1 p2) p0), acceptance={} source=7 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 14}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=8 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=9 dest: 15}, { cond=(OR (AND p1 p2) p0), acceptance={1} source=9 dest: 16}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=9 dest: 17}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(OR p0 p2), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=13 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 18}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=13 dest: 19}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=15 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=15 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=15 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=15 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=16 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=16 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=16 dest: 16}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=16 dest: 17}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=16 dest: 20}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=17 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=17 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=17 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=17 dest: 16}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=17 dest: 17}], [{ cond=(NOT p1), acceptance={} source=18 dest: 6}, { cond=p1, acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=19 dest: 6}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=19 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=19 dest: 11}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 18}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=19 dest: 19}], [{ cond=p0, acceptance={} source=20 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=20 dest: 15}, { cond=p0, acceptance={1} source=20 dest: 16}, { cond=p0, acceptance={} source=20 dest: 20}, { cond=(AND p0 (NOT p2)), acceptance={0} source=20 dest: 22}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=21 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=21 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=21 dest: 23}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=22 dest: 15}, { cond=(AND p0 (NOT p2)), acceptance={} source=22 dest: 21}, { cond=(AND p0 (NOT p2)), acceptance={0} source=22 dest: 22}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=23 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=23 dest: 12}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=23 dest: 14}]], initial=9, aps=[p1:(GEQ s1714 1), p0:(GEQ s5276 1), p2:(AND (GEQ s6886 1) (GEQ s6967 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-10 finished in 11053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(G(p1)))||(p2 U (G(p4)&&p3))))'
Support contains 6 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4578 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:50] [INFO ] Invariants computation overflowed in 303 ms
[2023-03-15 16:14:51] [INFO ] Implicit Places using invariants in 1719 ms returned []
Implicit Place search using SMT only with invariants took 1723 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 16:14:52] [INFO ] Invariants computation overflowed in 428 ms
[2023-03-15 16:14:53] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8214 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 499 ms :[(NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), true, (NOT p4), (OR (NOT p4) (NOT p3)), (NOT p4)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2 p1) (AND (NOT p0) (NOT p4) p2 p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) p2 (NOT p1)) (AND (NOT p0) (NOT p4) p2 (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p4 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 p4 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p3 p4 p2 (NOT p1)), acceptance={1} source=2 dest: 4}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p4) p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p3 p4 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p3 p4 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p4)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p4), acceptance={} source=3 dest: 3}, { cond=(AND p0 p4), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p4) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p4) p2 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p4) p2 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p4 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p4 p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p4 p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p4) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p4 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p4 p2), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p4) (NOT p2) p1)), acceptance={} source=5 dest: 0}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p4) p2 p1)), acceptance={} source=5 dest: 5}, { cond=(AND p3 p4 (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND p3 p4 p2 p1), acceptance={} source=5 dest: 7}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p4) (NOT p2) (NOT p1))), acceptance={} source=5 dest: 8}, { cond=(AND p3 p4 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p4) p2 (NOT p1))), acceptance={} source=5 dest: 10}, { cond=(AND p3 p4 p2 (NOT p1)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p4) p1), acceptance={} source=6 dest: 0}, { cond=(AND p4 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p4 (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p4) p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p4 p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p4) p2 (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p4 p2 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p4), acceptance={} source=9 dest: 8}, { cond=p4, acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p4) (NOT p2))), acceptance={} source=10 dest: 8}, { cond=(AND p3 p4 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p4) p2)), acceptance={0, 1} source=10 dest: 10}, { cond=(AND p3 p4 p2), acceptance={1} source=10 dest: 11}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(AND p4 (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p4) p2), acceptance={0, 1} source=11 dest: 10}, { cond=(AND p4 p2), acceptance={1} source=11 dest: 11}]], initial=2, aps=[p1:(AND (GEQ s9860 1) (GEQ s9899 1) (GEQ s1527 1) (GEQ s1553 1)), p0:(AND (GEQ s9860 1) (GEQ s9899 1)), p3:(AND (GEQ s1674 1) (GEQ s1716 1)), p2:(AND (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-12 finished in 11032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||(p1 U (G(p1)||(p1&&G(p0)))))))))'
[2023-03-15 16:14:57] [INFO ] Flatten gal took : 528 ms
[2023-03-15 16:14:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 16:14:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10600 places, 9998 transitions and 28190 arcs took 121 ms.
Total runtime 750699 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1299/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-200-LTLFireability-02
BK_STOP 1678896917074
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DoubleExponent-PT-200-LTLFireability-02
ltl formula formula --ltl=/tmp/1299/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10600 places, 9998 transitions and 28190 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.250 real 0.400 user 0.440 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="DoubleExponent-PT-200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-200, 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 r137-smll-167819418600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 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 ;