About the Execution of 2023-gold for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13258.380 | 3600000.00 | 12351608.00 | 2499.70 | FFF?FFFFTFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280000128.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EisenbergMcGuire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280000128
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 EisenbergMcGuire-PT-10-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716571074991
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 17:17:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 17:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:17:58] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-24 17:17:59] [INFO ] Transformed 1090 places.
[2024-05-24 17:17:59] [INFO ] Transformed 5200 transitions.
[2024-05-24 17:17:59] [INFO ] Found NUPN structural information;
[2024-05-24 17:17:59] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 1006 transition count 4360
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 1006 transition count 4360
Applied a total of 168 rules in 380 ms. Remains 1006 /1090 variables (removed 84) and now considering 4360/5200 (removed 840) transitions.
[2024-05-24 17:17:59] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
// Phase 1: matrix 1490 rows 1006 cols
[2024-05-24 17:17:59] [INFO ] Computed 31 invariants in 62 ms
[2024-05-24 17:18:01] [INFO ] Implicit Places using invariants in 2050 ms returned []
[2024-05-24 17:18:01] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-05-24 17:18:01] [INFO ] Invariant cache hit.
[2024-05-24 17:18:03] [INFO ] State equation strengthened by 490 read => feed constraints.
[2024-05-24 17:18:13] [INFO ] Implicit Places using invariants and state equation in 11574 ms returned []
Implicit Place search using SMT with State Equation took 13694 ms to find 0 implicit places.
[2024-05-24 17:18:13] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-05-24 17:18:13] [INFO ] Invariant cache hit.
[2024-05-24 17:18:16] [INFO ] Dead Transitions using invariants and state equation in 3114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1090 places, 4360/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17192 ms. Remains : 1006/1090 places, 4360/5200 transitions.
Support contains 51 out of 1006 places after structural reductions.
[2024-05-24 17:18:17] [INFO ] Flatten gal took : 560 ms
[2024-05-24 17:18:17] [INFO ] Flatten gal took : 208 ms
[2024-05-24 17:18:18] [INFO ] Input system was already deterministic with 4360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 30) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-24 17:18:19] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-05-24 17:18:19] [INFO ] Invariant cache hit.
[2024-05-24 17:18:20] [INFO ] [Real]Absence check using 21 positive place invariants in 67 ms returned sat
[2024-05-24 17:18:20] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 22 ms returned sat
[2024-05-24 17:18:20] [INFO ] After 1370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-24 17:18:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 68 ms returned sat
[2024-05-24 17:18:21] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2024-05-24 17:18:26] [INFO ] After 3377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-24 17:18:26] [INFO ] State equation strengthened by 490 read => feed constraints.
[2024-05-24 17:18:30] [INFO ] After 4237ms SMT Verify possible using 490 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2024-05-24 17:18:31] [INFO ] Deduced a trap composed of 3 places in 976 ms of which 9 ms to minimize.
[2024-05-24 17:18:32] [INFO ] Deduced a trap composed of 3 places in 971 ms of which 3 ms to minimize.
[2024-05-24 17:18:33] [INFO ] Deduced a trap composed of 3 places in 680 ms of which 6 ms to minimize.
[2024-05-24 17:18:33] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 3 ms to minimize.
[2024-05-24 17:18:34] [INFO ] Deduced a trap composed of 46 places in 367 ms of which 1 ms to minimize.
[2024-05-24 17:18:34] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2024-05-24 17:18:35] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 2 ms to minimize.
[2024-05-24 17:18:35] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 1 ms to minimize.
[2024-05-24 17:18:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5314 ms
[2024-05-24 17:18:36] [INFO ] Deduced a trap composed of 3 places in 571 ms of which 2 ms to minimize.
[2024-05-24 17:18:37] [INFO ] Deduced a trap composed of 3 places in 468 ms of which 1 ms to minimize.
[2024-05-24 17:18:37] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 1 ms to minimize.
[2024-05-24 17:18:37] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 1 ms to minimize.
[2024-05-24 17:18:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2184 ms
[2024-05-24 17:18:38] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 1 ms to minimize.
[2024-05-24 17:18:39] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2024-05-24 17:18:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 761 ms
[2024-05-24 17:18:40] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2024-05-24 17:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-05-24 17:18:41] [INFO ] Deduced a trap composed of 42 places in 919 ms of which 1 ms to minimize.
[2024-05-24 17:18:41] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 0 ms to minimize.
[2024-05-24 17:18:42] [INFO ] Deduced a trap composed of 40 places in 847 ms of which 2 ms to minimize.
[2024-05-24 17:18:43] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 0 ms to minimize.
[2024-05-24 17:18:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2872 ms
[2024-05-24 17:18:44] [INFO ] Deduced a trap composed of 38 places in 553 ms of which 1 ms to minimize.
[2024-05-24 17:18:44] [INFO ] Deduced a trap composed of 46 places in 539 ms of which 1 ms to minimize.
[2024-05-24 17:18:45] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 1 ms to minimize.
[2024-05-24 17:18:46] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 17:18:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 17:18:46] [INFO ] After 25185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Parikh walk visited 0 properties in 2554 ms.
Support contains 47 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1006 transition count 4353
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 999 transition count 4353
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 14 place count 999 transition count 4046
Deduced a syphon composed of 307 places in 6 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 628 place count 692 transition count 4046
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 629 place count 691 transition count 4036
Iterating global reduction 2 with 1 rules applied. Total rules applied 630 place count 691 transition count 4036
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 6 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 808 place count 602 transition count 3947
Applied a total of 808 rules in 725 ms. Remains 602 /1006 variables (removed 404) and now considering 3947/4360 (removed 413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 602/1006 places, 3947/4360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 80223 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{22=1}
Probabilistic random walk after 80223 steps, saw 60181 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :1
Running SMT prover for 22 properties.
[2024-05-24 17:18:53] [INFO ] Flow matrix only has 1077 transitions (discarded 2870 similar events)
// Phase 1: matrix 1077 rows 602 cols
[2024-05-24 17:18:53] [INFO ] Computed 31 invariants in 13 ms
[2024-05-24 17:18:53] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2024-05-24 17:18:53] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 17:18:53] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-24 17:18:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 28 ms returned sat
[2024-05-24 17:18:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 17:18:56] [INFO ] After 1614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 17:18:56] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-24 17:18:58] [INFO ] After 1918ms SMT Verify possible using 481 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 17:18:58] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 1 ms to minimize.
[2024-05-24 17:18:59] [INFO ] Deduced a trap composed of 36 places in 604 ms of which 1 ms to minimize.
[2024-05-24 17:18:59] [INFO ] Deduced a trap composed of 3 places in 472 ms of which 1 ms to minimize.
[2024-05-24 17:19:00] [INFO ] Deduced a trap composed of 36 places in 484 ms of which 2 ms to minimize.
[2024-05-24 17:19:01] [INFO ] Deduced a trap composed of 27 places in 383 ms of which 1 ms to minimize.
[2024-05-24 17:19:01] [INFO ] Deduced a trap composed of 18 places in 512 ms of which 1 ms to minimize.
[2024-05-24 17:19:02] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 0 ms to minimize.
[2024-05-24 17:19:02] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 1 ms to minimize.
[2024-05-24 17:19:02] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 1 ms to minimize.
[2024-05-24 17:19:03] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 1 ms to minimize.
[2024-05-24 17:19:03] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2024-05-24 17:19:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5323 ms
[2024-05-24 17:19:03] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 6 ms to minimize.
[2024-05-24 17:19:04] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2024-05-24 17:19:04] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 0 ms to minimize.
[2024-05-24 17:19:04] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2024-05-24 17:19:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2024-05-24 17:19:04] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2024-05-24 17:19:06] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 1 ms to minimize.
[2024-05-24 17:19:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 957 ms
[2024-05-24 17:19:06] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2024-05-24 17:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-24 17:19:07] [INFO ] Deduced a trap composed of 3 places in 564 ms of which 0 ms to minimize.
[2024-05-24 17:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2024-05-24 17:19:07] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 1 ms to minimize.
[2024-05-24 17:19:07] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1283 ms
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2024-05-24 17:19:09] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 1 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 1 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 64 places in 291 ms of which 5 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 1 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1001 ms
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-24 17:19:11] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2024-05-24 17:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-05-24 17:19:11] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 1 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 1 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 0 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2024-05-24 17:19:13] [INFO ] Deduced a trap composed of 43 places in 373 ms of which 2 ms to minimize.
[2024-05-24 17:19:13] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 0 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1267 ms
[2024-05-24 17:19:14] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-24 17:19:14] [INFO ] After 18781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1794 ms.
[2024-05-24 17:19:16] [INFO ] After 23129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 461 ms.
Support contains 45 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 3947/3947 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 602 transition count 3946
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 601 transition count 3946
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 600 transition count 3945
Applied a total of 4 rules in 299 ms. Remains 600 /602 variables (removed 2) and now considering 3945/3947 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 600/602 places, 3945/3947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 83567 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83567 steps, saw 62230 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 22 properties.
[2024-05-24 17:19:21] [INFO ] Flow matrix only has 1075 transitions (discarded 2870 similar events)
// Phase 1: matrix 1075 rows 600 cols
[2024-05-24 17:19:21] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 17:19:21] [INFO ] [Real]Absence check using 21 positive place invariants in 29 ms returned sat
[2024-05-24 17:19:21] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:19:21] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-24 17:19:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-24 17:19:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:19:24] [INFO ] After 2192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 17:19:24] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-24 17:19:26] [INFO ] After 1821ms SMT Verify possible using 481 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 17:19:27] [INFO ] Deduced a trap composed of 3 places in 536 ms of which 1 ms to minimize.
[2024-05-24 17:19:27] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 1 ms to minimize.
[2024-05-24 17:19:28] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 1 ms to minimize.
[2024-05-24 17:19:28] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 1 ms to minimize.
[2024-05-24 17:19:29] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 1 ms to minimize.
[2024-05-24 17:19:29] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 1 ms to minimize.
[2024-05-24 17:19:29] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 1 ms to minimize.
[2024-05-24 17:19:29] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 0 ms to minimize.
[2024-05-24 17:19:30] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2024-05-24 17:19:30] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2024-05-24 17:19:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3752 ms
[2024-05-24 17:19:31] [INFO ] Deduced a trap composed of 3 places in 598 ms of which 1 ms to minimize.
[2024-05-24 17:19:31] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 2 ms to minimize.
[2024-05-24 17:19:32] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2024-05-24 17:19:32] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2024-05-24 17:19:33] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2024-05-24 17:19:33] [INFO ] Deduced a trap composed of 39 places in 430 ms of which 1 ms to minimize.
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 0 ms to minimize.
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 1 ms to minimize.
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 1 ms to minimize.
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2024-05-24 17:19:35] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-24 17:19:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4613 ms
[2024-05-24 17:19:35] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-24 17:19:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-24 17:19:36] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2024-05-24 17:19:36] [INFO ] Deduced a trap composed of 58 places in 443 ms of which 1 ms to minimize.
[2024-05-24 17:19:37] [INFO ] Deduced a trap composed of 92 places in 427 ms of which 1 ms to minimize.
[2024-05-24 17:19:37] [INFO ] Deduced a trap composed of 57 places in 438 ms of which 1 ms to minimize.
[2024-05-24 17:19:38] [INFO ] Deduced a trap composed of 51 places in 446 ms of which 1 ms to minimize.
[2024-05-24 17:19:38] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 1 ms to minimize.
[2024-05-24 17:19:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3066 ms
[2024-05-24 17:19:39] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 1 ms to minimize.
[2024-05-24 17:19:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2024-05-24 17:19:40] [INFO ] Deduced a trap composed of 45 places in 404 ms of which 0 ms to minimize.
[2024-05-24 17:19:40] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 0 ms to minimize.
[2024-05-24 17:19:40] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 1 ms to minimize.
[2024-05-24 17:19:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1449 ms
[2024-05-24 17:19:41] [INFO ] Deduced a trap composed of 50 places in 371 ms of which 1 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1664 ms
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-24 17:19:44] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-24 17:19:44] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2024-05-24 17:19:44] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2024-05-24 17:19:45] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2024-05-24 17:19:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 932 ms
[2024-05-24 17:19:45] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-05-24 17:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-24 17:19:46] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2024-05-24 17:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-05-24 17:19:46] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 17:19:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 17:19:46] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Parikh walk visited 0 properties in 415 ms.
Support contains 45 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 3945/3945 transitions.
Applied a total of 0 rules in 299 ms. Remains 600 /600 variables (removed 0) and now considering 3945/3945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 600/600 places, 3945/3945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 3945/3945 transitions.
Applied a total of 0 rules in 295 ms. Remains 600 /600 variables (removed 0) and now considering 3945/3945 (removed 0) transitions.
[2024-05-24 17:19:47] [INFO ] Flow matrix only has 1075 transitions (discarded 2870 similar events)
[2024-05-24 17:19:47] [INFO ] Invariant cache hit.
[2024-05-24 17:19:48] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2024-05-24 17:19:48] [INFO ] Flow matrix only has 1075 transitions (discarded 2870 similar events)
[2024-05-24 17:19:48] [INFO ] Invariant cache hit.
[2024-05-24 17:19:49] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-24 17:19:55] [INFO ] Implicit Places using invariants and state equation in 6139 ms returned []
Implicit Place search using SMT with State Equation took 7167 ms to find 0 implicit places.
[2024-05-24 17:19:55] [INFO ] Redundant transitions in 548 ms returned []
[2024-05-24 17:19:55] [INFO ] Flow matrix only has 1075 transitions (discarded 2870 similar events)
[2024-05-24 17:19:55] [INFO ] Invariant cache hit.
[2024-05-24 17:19:58] [INFO ] Dead Transitions using invariants and state equation in 3380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11401 ms. Remains : 600/600 places, 3945/3945 transitions.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F(p1))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 996 transition count 4040
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 686 transition count 4040
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 646 place count 680 transition count 3980
Iterating global reduction 2 with 6 rules applied. Total rules applied 652 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 832 place count 590 transition count 3890
Applied a total of 832 rules in 719 ms. Remains 590 /1006 variables (removed 416) and now considering 3890/4360 (removed 470) transitions.
[2024-05-24 17:19:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:19:59] [INFO ] Computed 31 invariants in 6 ms
[2024-05-24 17:20:01] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-24 17:20:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:01] [INFO ] Invariant cache hit.
[2024-05-24 17:20:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:20:07] [INFO ] Implicit Places using invariants and state equation in 6700 ms returned []
Implicit Place search using SMT with State Equation took 7836 ms to find 0 implicit places.
[2024-05-24 17:20:08] [INFO ] Redundant transitions in 342 ms returned []
[2024-05-24 17:20:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:08] [INFO ] Invariant cache hit.
[2024-05-24 17:20:10] [INFO ] Dead Transitions using invariants and state equation in 2867 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1006 places, 3890/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11775 ms. Remains : 590/1006 places, 3890/4360 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s11 1) (EQ s431 1)), p0:(OR (EQ s0 0) (EQ s11 0) (EQ s431 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 766 ms.
Product exploration explored 100000 steps with 0 reset in 607 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 132858 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132858 steps, saw 94897 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 17:20:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:16] [INFO ] Invariant cache hit.
[2024-05-24 17:20:16] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-24 17:20:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:20:17] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-24 17:20:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-24 17:20:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:20:18] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-24 17:20:18] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:20:18] [INFO ] After 439ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-24 17:20:19] [INFO ] Deduced a trap composed of 3 places in 889 ms of which 1 ms to minimize.
[2024-05-24 17:20:20] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 1 ms to minimize.
[2024-05-24 17:20:20] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 1 ms to minimize.
[2024-05-24 17:20:21] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 1 ms to minimize.
[2024-05-24 17:20:21] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 1 ms to minimize.
[2024-05-24 17:20:23] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2024-05-24 17:20:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4328 ms
[2024-05-24 17:20:23] [INFO ] Deduced a trap composed of 3 places in 453 ms of which 1 ms to minimize.
[2024-05-24 17:20:24] [INFO ] Deduced a trap composed of 34 places in 426 ms of which 1 ms to minimize.
[2024-05-24 17:20:24] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2044 ms
[2024-05-24 17:20:25] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-05-24 17:20:25] [INFO ] After 7369ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 373 ms.
[2024-05-24 17:20:26] [INFO ] After 8767ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 294 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175538 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175538 steps, saw 123002 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 17:20:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:29] [INFO ] Invariant cache hit.
[2024-05-24 17:20:30] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 17:20:30] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:20:30] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 17:20:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 17:20:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 17:20:31] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 17:20:31] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:20:31] [INFO ] After 398ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 17:20:32] [INFO ] Deduced a trap composed of 3 places in 686 ms of which 1 ms to minimize.
[2024-05-24 17:20:33] [INFO ] Deduced a trap composed of 3 places in 609 ms of which 1 ms to minimize.
[2024-05-24 17:20:33] [INFO ] Deduced a trap composed of 3 places in 658 ms of which 1 ms to minimize.
[2024-05-24 17:20:34] [INFO ] Deduced a trap composed of 3 places in 580 ms of which 1 ms to minimize.
[2024-05-24 17:20:35] [INFO ] Deduced a trap composed of 3 places in 522 ms of which 1 ms to minimize.
[2024-05-24 17:20:35] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 1 ms to minimize.
[2024-05-24 17:20:36] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 1 ms to minimize.
[2024-05-24 17:20:36] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 3 ms to minimize.
[2024-05-24 17:20:36] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2024-05-24 17:20:37] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 1 ms to minimize.
[2024-05-24 17:20:37] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2024-05-24 17:20:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5573 ms
[2024-05-24 17:20:37] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 1 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 0 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 1 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 0 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1442 ms
[2024-05-24 17:20:39] [INFO ] After 7745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-24 17:20:39] [INFO ] After 8848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 293 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 310 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:20:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:40] [INFO ] Invariant cache hit.
[2024-05-24 17:20:41] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-05-24 17:20:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:41] [INFO ] Invariant cache hit.
[2024-05-24 17:20:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:20:47] [INFO ] Implicit Places using invariants and state equation in 6435 ms returned []
Implicit Place search using SMT with State Equation took 7479 ms to find 0 implicit places.
[2024-05-24 17:20:47] [INFO ] Redundant transitions in 278 ms returned []
[2024-05-24 17:20:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:47] [INFO ] Invariant cache hit.
[2024-05-24 17:20:51] [INFO ] Dead Transitions using invariants and state equation in 3398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11489 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 7 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 753 place count 163 transition count 344
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 762 place count 163 transition count 335
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 772 place count 163 transition count 325
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 863 place count 163 transition count 234
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 954 place count 72 transition count 234
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 964 place count 72 transition count 234
Applied a total of 964 rules in 103 ms. Remains 72 /590 variables (removed 518) and now considering 234/3890 (removed 3656) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 234 rows 72 cols
[2024-05-24 17:20:51] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 17:20:51] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 17:20:51] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 17:20:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-24 17:20:51] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 17:20:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 17:20:51] [INFO ] After 56ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 17:20:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 17:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 17:20:51] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:20:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:20:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2024-05-24 17:20:51] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 17:20:51] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 188 ms :[true, p1, (NOT p1), false]
[2024-05-24 17:20:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:20:52] [INFO ] Computed 31 invariants in 13 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [true]
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (NOT p1), false]
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 188 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:20:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:54] [INFO ] Invariant cache hit.
[2024-05-24 17:20:55] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2024-05-24 17:20:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:20:55] [INFO ] Invariant cache hit.
[2024-05-24 17:20:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:21:02] [INFO ] Implicit Places using invariants and state equation in 6347 ms returned []
Implicit Place search using SMT with State Equation took 7681 ms to find 0 implicit places.
[2024-05-24 17:21:02] [INFO ] Redundant transitions in 176 ms returned []
[2024-05-24 17:21:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:02] [INFO ] Invariant cache hit.
[2024-05-24 17:21:05] [INFO ] Dead Transitions using invariants and state equation in 2828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10886 ms. Remains : 590/590 places, 3890/3890 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[true, p1, (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289267 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289267 steps, saw 195275 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:21:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:08] [INFO ] Invariant cache hit.
[2024-05-24 17:21:08] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2024-05-24 17:21:08] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 17:21:08] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:21:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 26 ms returned sat
[2024-05-24 17:21:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:21:09] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:21:10] [INFO ] After 294ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:10] [INFO ] Deduced a trap composed of 6 places in 579 ms of which 1 ms to minimize.
[2024-05-24 17:21:11] [INFO ] Deduced a trap composed of 40 places in 592 ms of which 1 ms to minimize.
[2024-05-24 17:21:12] [INFO ] Deduced a trap composed of 3 places in 586 ms of which 1 ms to minimize.
[2024-05-24 17:21:12] [INFO ] Deduced a trap composed of 13 places in 581 ms of which 1 ms to minimize.
[2024-05-24 17:21:13] [INFO ] Deduced a trap composed of 36 places in 617 ms of which 1 ms to minimize.
[2024-05-24 17:21:14] [INFO ] Deduced a trap composed of 3 places in 570 ms of which 1 ms to minimize.
[2024-05-24 17:21:14] [INFO ] Deduced a trap composed of 37 places in 593 ms of which 1 ms to minimize.
[2024-05-24 17:21:15] [INFO ] Deduced a trap composed of 3 places in 541 ms of which 1 ms to minimize.
[2024-05-24 17:21:16] [INFO ] Deduced a trap composed of 45 places in 597 ms of which 1 ms to minimize.
[2024-05-24 17:21:16] [INFO ] Deduced a trap composed of 58 places in 604 ms of which 0 ms to minimize.
[2024-05-24 17:21:17] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 1 ms to minimize.
[2024-05-24 17:21:17] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 1 ms to minimize.
[2024-05-24 17:21:18] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 1 ms to minimize.
[2024-05-24 17:21:18] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 1 ms to minimize.
[2024-05-24 17:21:19] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 0 ms to minimize.
[2024-05-24 17:21:19] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 1 ms to minimize.
[2024-05-24 17:21:19] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 0 ms to minimize.
[2024-05-24 17:21:20] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 0 ms to minimize.
[2024-05-24 17:21:20] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 17:21:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10123 ms
[2024-05-24 17:21:20] [INFO ] After 10559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-24 17:21:20] [INFO ] After 11543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 302 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267454 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267454 steps, saw 181909 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:21:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:23] [INFO ] Invariant cache hit.
[2024-05-24 17:21:24] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 17:21:24] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:21:24] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:21:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-24 17:21:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:21:25] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:21:25] [INFO ] After 294ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:26] [INFO ] Deduced a trap composed of 6 places in 575 ms of which 1 ms to minimize.
[2024-05-24 17:21:26] [INFO ] Deduced a trap composed of 40 places in 632 ms of which 1 ms to minimize.
[2024-05-24 17:21:27] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 1 ms to minimize.
[2024-05-24 17:21:28] [INFO ] Deduced a trap composed of 13 places in 580 ms of which 1 ms to minimize.
[2024-05-24 17:21:28] [INFO ] Deduced a trap composed of 36 places in 607 ms of which 1 ms to minimize.
[2024-05-24 17:21:29] [INFO ] Deduced a trap composed of 3 places in 587 ms of which 1 ms to minimize.
[2024-05-24 17:21:30] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 1 ms to minimize.
[2024-05-24 17:21:30] [INFO ] Deduced a trap composed of 3 places in 585 ms of which 1 ms to minimize.
[2024-05-24 17:21:31] [INFO ] Deduced a trap composed of 45 places in 581 ms of which 1 ms to minimize.
[2024-05-24 17:21:32] [INFO ] Deduced a trap composed of 58 places in 590 ms of which 1 ms to minimize.
[2024-05-24 17:21:32] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-24 17:21:33] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 1 ms to minimize.
[2024-05-24 17:21:33] [INFO ] Deduced a trap composed of 35 places in 384 ms of which 1 ms to minimize.
[2024-05-24 17:21:34] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2024-05-24 17:21:34] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 1 ms to minimize.
[2024-05-24 17:21:34] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 1 ms to minimize.
[2024-05-24 17:21:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2024-05-24 17:21:35] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 1 ms to minimize.
[2024-05-24 17:21:35] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2024-05-24 17:21:35] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10244 ms
[2024-05-24 17:21:35] [INFO ] After 10680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-24 17:21:36] [INFO ] After 11656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 280 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 273 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:21:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:36] [INFO ] Invariant cache hit.
[2024-05-24 17:21:37] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-05-24 17:21:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:37] [INFO ] Invariant cache hit.
[2024-05-24 17:21:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:21:45] [INFO ] Implicit Places using invariants and state equation in 7289 ms returned []
Implicit Place search using SMT with State Equation took 8488 ms to find 0 implicit places.
[2024-05-24 17:21:45] [INFO ] Redundant transitions in 265 ms returned []
[2024-05-24 17:21:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:21:45] [INFO ] Invariant cache hit.
[2024-05-24 17:21:48] [INFO ] Dead Transitions using invariants and state equation in 2911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11946 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 753 place count 163 transition count 344
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 762 place count 163 transition count 335
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 772 place count 163 transition count 325
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 863 place count 163 transition count 234
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 954 place count 72 transition count 234
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 964 place count 72 transition count 234
Applied a total of 964 rules in 59 ms. Remains 72 /590 variables (removed 518) and now considering 234/3890 (removed 3656) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 72 cols
[2024-05-24 17:21:48] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 17:21:48] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 17:21:48] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:21:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-24 17:21:48] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 17:21:48] [INFO ] After 22ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:21:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 17:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-24 17:21:48] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 17:21:48] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 183 ms :[true, p1, (NOT p1), false]
[2024-05-24 17:21:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:21:49] [INFO ] Computed 31 invariants in 8 ms
Proved EG true
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [true]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 134 ms :[true, p1, (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-00 finished in 112479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(G(p2)&&p1))))))'
Support contains 7 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 996 transition count 4042
Deduced a syphon composed of 308 places in 6 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 688 transition count 4042
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 642 place count 682 transition count 3982
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 682 transition count 3982
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 828 place count 592 transition count 3892
Applied a total of 828 rules in 510 ms. Remains 592 /1006 variables (removed 414) and now considering 3892/4360 (removed 468) transitions.
[2024-05-24 17:21:52] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2024-05-24 17:21:52] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 17:21:53] [INFO ] Implicit Places using invariants in 1535 ms returned []
[2024-05-24 17:21:53] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2024-05-24 17:21:53] [INFO ] Invariant cache hit.
[2024-05-24 17:21:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:21:59] [INFO ] Implicit Places using invariants and state equation in 5650 ms returned []
Implicit Place search using SMT with State Equation took 7193 ms to find 0 implicit places.
[2024-05-24 17:21:59] [INFO ] Redundant transitions in 179 ms returned []
[2024-05-24 17:21:59] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2024-05-24 17:21:59] [INFO ] Invariant cache hit.
[2024-05-24 17:22:01] [INFO ] Dead Transitions using invariants and state equation in 2346 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1006 places, 3892/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10241 ms. Remains : 592/1006 places, 3892/4360 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s35 1) (EQ s260 1)), p2:(AND (NOT (AND (EQ s10 1) (EQ s466 1))) (EQ s7 1) (EQ s33 1) (EQ s361 1)), p0:(AND (EQ s35 1) (EQ s260 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-01 finished in 10908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (X(p2)&&p1))))'
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 65 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-05-24 17:22:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 17:22:02] [INFO ] Computed 31 invariants in 8 ms
[2024-05-24 17:22:03] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-24 17:22:03] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:22:03] [INFO ] Invariant cache hit.
[2024-05-24 17:22:04] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:22:14] [INFO ] Implicit Places using invariants and state equation in 10246 ms returned []
Implicit Place search using SMT with State Equation took 11471 ms to find 0 implicit places.
[2024-05-24 17:22:14] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:22:14] [INFO ] Invariant cache hit.
[2024-05-24 17:22:17] [INFO ] Dead Transitions using invariants and state equation in 3373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14911 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s20 1) (EQ s701 1)), p0:(AND (EQ s3 1) (EQ s20 1) (EQ s701 1) (EQ s415 1)), p2:(AND (EQ s3 1) (EQ s19 1) (EQ s736 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 347 ms.
Product exploration explored 100000 steps with 0 reset in 538 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 196 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 142296 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142296 steps, saw 114188 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 17:22:22] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:22:22] [INFO ] Invariant cache hit.
[2024-05-24 17:22:23] [INFO ] [Real]Absence check using 21 positive place invariants in 51 ms returned sat
[2024-05-24 17:22:23] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2024-05-24 17:22:23] [INFO ] After 1214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 17:22:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 32 ms returned sat
[2024-05-24 17:22:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 17:22:25] [INFO ] After 1336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 17:22:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:22:27] [INFO ] After 1406ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 17:22:28] [INFO ] Deduced a trap composed of 6 places in 1188 ms of which 1 ms to minimize.
[2024-05-24 17:22:29] [INFO ] Deduced a trap composed of 3 places in 858 ms of which 2 ms to minimize.
[2024-05-24 17:22:30] [INFO ] Deduced a trap composed of 3 places in 752 ms of which 1 ms to minimize.
[2024-05-24 17:22:31] [INFO ] Deduced a trap composed of 3 places in 748 ms of which 2 ms to minimize.
[2024-05-24 17:22:31] [INFO ] Deduced a trap composed of 3 places in 595 ms of which 1 ms to minimize.
[2024-05-24 17:22:32] [INFO ] Deduced a trap composed of 60 places in 706 ms of which 1 ms to minimize.
[2024-05-24 17:22:33] [INFO ] Deduced a trap composed of 35 places in 619 ms of which 1 ms to minimize.
[2024-05-24 17:22:34] [INFO ] Deduced a trap composed of 68 places in 609 ms of which 1 ms to minimize.
[2024-05-24 17:22:34] [INFO ] Deduced a trap composed of 61 places in 474 ms of which 1 ms to minimize.
[2024-05-24 17:22:35] [INFO ] Deduced a trap composed of 59 places in 383 ms of which 0 ms to minimize.
[2024-05-24 17:22:35] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 1 ms to minimize.
[2024-05-24 17:22:35] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 0 ms to minimize.
[2024-05-24 17:22:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 8941 ms
[2024-05-24 17:22:36] [INFO ] Deduced a trap composed of 3 places in 502 ms of which 1 ms to minimize.
[2024-05-24 17:22:37] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 1 ms to minimize.
[2024-05-24 17:22:37] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 1 ms to minimize.
[2024-05-24 17:22:38] [INFO ] Deduced a trap composed of 62 places in 283 ms of which 1 ms to minimize.
[2024-05-24 17:22:38] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2024-05-24 17:22:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2520 ms
[2024-05-24 17:22:39] [INFO ] Deduced a trap composed of 3 places in 648 ms of which 1 ms to minimize.
[2024-05-24 17:22:40] [INFO ] Deduced a trap composed of 56 places in 519 ms of which 1 ms to minimize.
[2024-05-24 17:22:40] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2024-05-24 17:22:41] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 1 ms to minimize.
[2024-05-24 17:22:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2370 ms
[2024-05-24 17:22:41] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2024-05-24 17:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2024-05-24 17:22:42] [INFO ] After 16772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1439 ms.
[2024-05-24 17:22:43] [INFO ] After 19941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 229 ms.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 990 transition count 3981
Deduced a syphon composed of 309 places in 6 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 406 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 591/1000 places, 3891/4300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 152273 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152273 steps, saw 107258 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 17:22:47] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 17:22:48] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 17:22:48] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-24 17:22:48] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:22:48] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 17:22:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2024-05-24 17:22:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 17:22:49] [INFO ] After 980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 17:22:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:22:50] [INFO ] After 747ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 17:22:51] [INFO ] Deduced a trap composed of 3 places in 696 ms of which 2 ms to minimize.
[2024-05-24 17:22:51] [INFO ] Deduced a trap composed of 20 places in 729 ms of which 1 ms to minimize.
[2024-05-24 17:22:52] [INFO ] Deduced a trap composed of 3 places in 647 ms of which 1 ms to minimize.
[2024-05-24 17:22:53] [INFO ] Deduced a trap composed of 3 places in 550 ms of which 1 ms to minimize.
[2024-05-24 17:22:53] [INFO ] Deduced a trap composed of 27 places in 532 ms of which 1 ms to minimize.
[2024-05-24 17:22:54] [INFO ] Deduced a trap composed of 29 places in 529 ms of which 1 ms to minimize.
[2024-05-24 17:22:55] [INFO ] Deduced a trap composed of 3 places in 529 ms of which 1 ms to minimize.
[2024-05-24 17:22:55] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2024-05-24 17:22:55] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 1 ms to minimize.
[2024-05-24 17:22:56] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2024-05-24 17:22:56] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-24 17:22:56] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 5 ms to minimize.
[2024-05-24 17:22:57] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 1 ms to minimize.
[2024-05-24 17:22:57] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2024-05-24 17:22:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7080 ms
[2024-05-24 17:22:57] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 1 ms to minimize.
[2024-05-24 17:22:58] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 11 ms to minimize.
[2024-05-24 17:22:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 723 ms
[2024-05-24 17:22:58] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-05-24 17:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-24 17:22:58] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2024-05-24 17:22:59] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2024-05-24 17:22:59] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2024-05-24 17:22:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 797 ms
[2024-05-24 17:22:59] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2024-05-24 17:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2024-05-24 17:23:00] [INFO ] After 10637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 631 ms.
[2024-05-24 17:23:00] [INFO ] After 12561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 91 ms.
Support contains 6 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 266 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 254 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-05-24 17:23:01] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 17:23:01] [INFO ] Invariant cache hit.
[2024-05-24 17:23:02] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-24 17:23:02] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 17:23:02] [INFO ] Invariant cache hit.
[2024-05-24 17:23:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:23:08] [INFO ] Implicit Places using invariants and state equation in 5737 ms returned []
Implicit Place search using SMT with State Equation took 6707 ms to find 0 implicit places.
[2024-05-24 17:23:08] [INFO ] Redundant transitions in 296 ms returned []
[2024-05-24 17:23:08] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 17:23:08] [INFO ] Invariant cache hit.
[2024-05-24 17:23:10] [INFO ] Dead Transitions using invariants and state equation in 2387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9655 ms. Remains : 591/591 places, 3891/3891 transitions.
Graph (trivial) has 3613 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 501 transition count 634
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 384 transition count 634
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 235 place count 384 transition count 613
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 287 place count 353 transition count 613
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 641 place count 176 transition count 436
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 727 place count 176 transition count 350
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 745 place count 167 transition count 350
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 754 place count 167 transition count 341
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 765 place count 167 transition count 330
Free-agglomeration rule applied 89 times.
Iterating global reduction 4 with 89 rules applied. Total rules applied 854 place count 167 transition count 241
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 4 with 89 rules applied. Total rules applied 943 place count 78 transition count 241
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 952 place count 78 transition count 241
Applied a total of 952 rules in 40 ms. Remains 78 /591 variables (removed 513) and now considering 241/3891 (removed 3650) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 241 rows 78 cols
[2024-05-24 17:23:10] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 17:23:10] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 17:23:10] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 17:23:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-24 17:23:11] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 17:23:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 17:23:11] [INFO ] After 82ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 17:23:11] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-24 17:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 17:23:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 17:23:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 17:23:11] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-24 17:23:11] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
[2024-05-24 17:23:12] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 17:23:12] [INFO ] Computed 31 invariants in 11 ms
[2024-05-24 17:23:16] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2024-05-24 17:23:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 62 ms returned unsat
Proved EG (NOT p1)
[2024-05-24 17:23:16] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:23:16] [INFO ] Invariant cache hit.
[2024-05-24 17:23:20] [INFO ] [Real]Absence check using 21 positive place invariants in 35 ms returned sat
[2024-05-24 17:23:20] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 81 ms returned sat
[2024-05-24 17:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 17:23:22] [INFO ] [Real]Absence check using state equation in 2275 ms returned sat
[2024-05-24 17:23:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:23:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 36 ms returned sat
[2024-05-24 17:23:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 82 ms returned sat
[2024-05-24 17:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 17:23:29] [INFO ] [Nat]Absence check using state equation in 2301 ms returned sat
[2024-05-24 17:23:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:23:29] [INFO ] [Nat]Added 436 Read/Feed constraints in 172 ms returned sat
[2024-05-24 17:23:30] [INFO ] Deduced a trap composed of 3 places in 1217 ms of which 1 ms to minimize.
[2024-05-24 17:23:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1271 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 148 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-02 finished in 88197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p2)||p1))))'
Support contains 9 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 56 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-05-24 17:23:30] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:23:30] [INFO ] Invariant cache hit.
[2024-05-24 17:23:32] [INFO ] Implicit Places using invariants in 1627 ms returned []
[2024-05-24 17:23:32] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:23:32] [INFO ] Invariant cache hit.
[2024-05-24 17:23:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:23:41] [INFO ] Implicit Places using invariants and state equation in 9353 ms returned []
Implicit Place search using SMT with State Equation took 10983 ms to find 0 implicit places.
[2024-05-24 17:23:41] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:23:41] [INFO ] Invariant cache hit.
[2024-05-24 17:23:45] [INFO ] Dead Transitions using invariants and state equation in 3289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14329 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s7 0) (EQ s31 0) (EQ s674 0)), p1:(OR (EQ s6 0) (EQ s29 0) (EQ s757 0)), p2:(AND (EQ s2 1) (EQ s16 1) (EQ s677 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]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (OR (AND p0 p1) (AND p0 p2))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290059 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290059 steps, saw 224881 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:23:49] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:23:49] [INFO ] Invariant cache hit.
[2024-05-24 17:23:49] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:23:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 35 ms returned sat
[2024-05-24 17:23:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-24 17:23:50] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:23:50] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:23:50] [INFO ] After 380ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:23:51] [INFO ] Deduced a trap composed of 3 places in 950 ms of which 1 ms to minimize.
[2024-05-24 17:23:52] [INFO ] Deduced a trap composed of 3 places in 951 ms of which 2 ms to minimize.
[2024-05-24 17:23:53] [INFO ] Deduced a trap composed of 3 places in 948 ms of which 1 ms to minimize.
[2024-05-24 17:23:55] [INFO ] Deduced a trap composed of 3 places in 962 ms of which 1 ms to minimize.
[2024-05-24 17:23:56] [INFO ] Deduced a trap composed of 3 places in 1004 ms of which 1 ms to minimize.
[2024-05-24 17:23:57] [INFO ] Deduced a trap composed of 99 places in 931 ms of which 1 ms to minimize.
[2024-05-24 17:23:58] [INFO ] Deduced a trap composed of 3 places in 1062 ms of which 2 ms to minimize.
[2024-05-24 17:23:59] [INFO ] Deduced a trap composed of 3 places in 821 ms of which 1 ms to minimize.
[2024-05-24 17:24:00] [INFO ] Deduced a trap composed of 99 places in 901 ms of which 3 ms to minimize.
[2024-05-24 17:24:01] [INFO ] Deduced a trap composed of 119 places in 852 ms of which 1 ms to minimize.
[2024-05-24 17:24:02] [INFO ] Deduced a trap composed of 3 places in 814 ms of which 1 ms to minimize.
[2024-05-24 17:24:02] [INFO ] Deduced a trap composed of 99 places in 811 ms of which 1 ms to minimize.
[2024-05-24 17:24:03] [INFO ] Deduced a trap composed of 32 places in 818 ms of which 1 ms to minimize.
[2024-05-24 17:24:04] [INFO ] Deduced a trap composed of 50 places in 833 ms of which 1 ms to minimize.
[2024-05-24 17:24:05] [INFO ] Deduced a trap composed of 162 places in 463 ms of which 1 ms to minimize.
[2024-05-24 17:24:05] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 1 ms to minimize.
[2024-05-24 17:24:06] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 1 ms to minimize.
[2024-05-24 17:24:06] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 0 ms to minimize.
[2024-05-24 17:24:06] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2024-05-24 17:24:07] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 1 ms to minimize.
[2024-05-24 17:24:07] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 1 ms to minimize.
[2024-05-24 17:24:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 16604 ms
[2024-05-24 17:24:07] [INFO ] After 17151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-24 17:24:07] [INFO ] After 18179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 268 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 590/1000 places, 3890/4300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290983 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290983 steps, saw 196395 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:24:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:24:11] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 17:24:11] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:24:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 17:24:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:24:11] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:24:11] [INFO ] After 249ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:12] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 0 ms to minimize.
[2024-05-24 17:24:12] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
[2024-05-24 17:24:13] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 1 ms to minimize.
[2024-05-24 17:24:13] [INFO ] Deduced a trap composed of 4 places in 476 ms of which 2 ms to minimize.
[2024-05-24 17:24:14] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 1 ms to minimize.
[2024-05-24 17:24:14] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 0 ms to minimize.
[2024-05-24 17:24:15] [INFO ] Deduced a trap composed of 3 places in 439 ms of which 1 ms to minimize.
[2024-05-24 17:24:15] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 0 ms to minimize.
[2024-05-24 17:24:16] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 1 ms to minimize.
[2024-05-24 17:24:16] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 1 ms to minimize.
[2024-05-24 17:24:17] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2024-05-24 17:24:17] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2024-05-24 17:24:17] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 0 ms to minimize.
[2024-05-24 17:24:18] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 1 ms to minimize.
[2024-05-24 17:24:18] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 0 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 0 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7647 ms
[2024-05-24 17:24:19] [INFO ] After 7954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-24 17:24:19] [INFO ] After 8622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:24:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:20] [INFO ] Invariant cache hit.
[2024-05-24 17:24:21] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2024-05-24 17:24:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:21] [INFO ] Invariant cache hit.
[2024-05-24 17:24:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:24:26] [INFO ] Implicit Places using invariants and state equation in 5187 ms returned []
Implicit Place search using SMT with State Equation took 6437 ms to find 0 implicit places.
[2024-05-24 17:24:26] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-24 17:24:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:26] [INFO ] Invariant cache hit.
[2024-05-24 17:24:30] [INFO ] Dead Transitions using invariants and state equation in 3595 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10398 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 56 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 17:24:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 17:24:30] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:24:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-24 17:24:30] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 17:24:30] [INFO ] After 28ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:30] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 17:24:30] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (OR (AND p0 p1) (AND p0 p2))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 271 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
[2024-05-24 17:24:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:24:31] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 17:24:32] [INFO ] Implicit Places using invariants in 982 ms returned []
[2024-05-24 17:24:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:32] [INFO ] Invariant cache hit.
[2024-05-24 17:24:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:24:37] [INFO ] Implicit Places using invariants and state equation in 5314 ms returned []
Implicit Place search using SMT with State Equation took 6297 ms to find 0 implicit places.
[2024-05-24 17:24:37] [INFO ] Redundant transitions in 188 ms returned []
[2024-05-24 17:24:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:37] [INFO ] Invariant cache hit.
[2024-05-24 17:24:39] [INFO ] Dead Transitions using invariants and state equation in 2126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1000 places, 3890/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8890 ms. Remains : 590/1000 places, 3890/4300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291115 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291115 steps, saw 196472 distinct states, run finished after 3003 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:24:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:43] [INFO ] Invariant cache hit.
[2024-05-24 17:24:43] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:24:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-24 17:24:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:24:43] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:24:43] [INFO ] After 167ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:44] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 0 ms to minimize.
[2024-05-24 17:24:44] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 0 ms to minimize.
[2024-05-24 17:24:45] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 1 ms to minimize.
[2024-05-24 17:24:45] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 0 ms to minimize.
[2024-05-24 17:24:46] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 1 ms to minimize.
[2024-05-24 17:24:46] [INFO ] Deduced a trap composed of 38 places in 365 ms of which 0 ms to minimize.
[2024-05-24 17:24:46] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 0 ms to minimize.
[2024-05-24 17:24:47] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 0 ms to minimize.
[2024-05-24 17:24:47] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 1 ms to minimize.
[2024-05-24 17:24:48] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 1 ms to minimize.
[2024-05-24 17:24:48] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 1 ms to minimize.
[2024-05-24 17:24:48] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 0 ms to minimize.
[2024-05-24 17:24:49] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2024-05-24 17:24:49] [INFO ] Deduced a trap composed of 62 places in 332 ms of which 1 ms to minimize.
[2024-05-24 17:24:50] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 1 ms to minimize.
[2024-05-24 17:24:50] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 0 ms to minimize.
[2024-05-24 17:24:50] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 1 ms to minimize.
[2024-05-24 17:24:51] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 1 ms to minimize.
[2024-05-24 17:24:51] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 0 ms to minimize.
[2024-05-24 17:24:51] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2024-05-24 17:24:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7903 ms
[2024-05-24 17:24:51] [INFO ] After 8155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-24 17:24:51] [INFO ] After 8791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290521 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290521 steps, saw 196157 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:24:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:24:55] [INFO ] Invariant cache hit.
[2024-05-24 17:24:55] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:24:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 17:24:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 17:24:55] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:24:56] [INFO ] After 178ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:24:56] [INFO ] Deduced a trap composed of 3 places in 441 ms of which 1 ms to minimize.
[2024-05-24 17:24:57] [INFO ] Deduced a trap composed of 3 places in 502 ms of which 0 ms to minimize.
[2024-05-24 17:24:57] [INFO ] Deduced a trap composed of 3 places in 473 ms of which 1 ms to minimize.
[2024-05-24 17:24:58] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 0 ms to minimize.
[2024-05-24 17:24:58] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 0 ms to minimize.
[2024-05-24 17:24:59] [INFO ] Deduced a trap composed of 38 places in 403 ms of which 1 ms to minimize.
[2024-05-24 17:24:59] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 1 ms to minimize.
[2024-05-24 17:24:59] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 1 ms to minimize.
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 1 ms to minimize.
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 1 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 0 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 1 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 0 ms to minimize.
[2024-05-24 17:25:02] [INFO ] Deduced a trap composed of 62 places in 329 ms of which 1 ms to minimize.
[2024-05-24 17:25:02] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 0 ms to minimize.
[2024-05-24 17:25:03] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 1 ms to minimize.
[2024-05-24 17:25:03] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 0 ms to minimize.
[2024-05-24 17:25:03] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 1 ms to minimize.
[2024-05-24 17:25:04] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 0 ms to minimize.
[2024-05-24 17:25:04] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2024-05-24 17:25:04] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8386 ms
[2024-05-24 17:25:04] [INFO ] After 8653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 17:25:04] [INFO ] After 9333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:25:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:25:04] [INFO ] Invariant cache hit.
[2024-05-24 17:25:06] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2024-05-24 17:25:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:25:06] [INFO ] Invariant cache hit.
[2024-05-24 17:25:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:25:11] [INFO ] Implicit Places using invariants and state equation in 5324 ms returned []
Implicit Place search using SMT with State Equation took 6501 ms to find 0 implicit places.
[2024-05-24 17:25:11] [INFO ] Redundant transitions in 194 ms returned []
[2024-05-24 17:25:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:25:11] [INFO ] Invariant cache hit.
[2024-05-24 17:25:15] [INFO ] Dead Transitions using invariants and state equation in 3624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10492 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 34 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 17:25:15] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 17:25:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:25:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 17:25:15] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:25:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 17:25:15] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:25:15] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 17:25:15] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 417 ms.
Built C files in :
/tmp/ltsmin16636578418092555029
[2024-05-24 17:25:16] [INFO ] Too many transitions (3890) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:25:16] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16636578418092555029
Running compilation step : cd /tmp/ltsmin16636578418092555029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16636578418092555029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16636578418092555029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 178 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 17:25:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 17:25:19] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 17:25:21] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-24 17:25:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:25:21] [INFO ] Invariant cache hit.
[2024-05-24 17:25:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:25:26] [INFO ] Implicit Places using invariants and state equation in 5535 ms returned []
Implicit Place search using SMT with State Equation took 6690 ms to find 0 implicit places.
[2024-05-24 17:25:26] [INFO ] Redundant transitions in 188 ms returned []
[2024-05-24 17:25:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 17:25:26] [INFO ] Invariant cache hit.
[2024-05-24 17:25:30] [INFO ] Dead Transitions using invariants and state equation in 3593 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10660 ms. Remains : 590/590 places, 3890/3890 transitions.
Built C files in :
/tmp/ltsmin4469646616821177215
[2024-05-24 17:25:30] [INFO ] Too many transitions (3890) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:25:30] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4469646616821177215
Running compilation step : cd /tmp/ltsmin4469646616821177215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4469646616821177215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4469646616821177215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 17:25:33] [INFO ] Flatten gal took : 174 ms
[2024-05-24 17:25:34] [INFO ] Flatten gal took : 195 ms
[2024-05-24 17:25:34] [INFO ] Time to serialize gal into /tmp/LTL14336648775574760759.gal : 50 ms
[2024-05-24 17:25:34] [INFO ] Time to serialize properties into /tmp/LTL15626869268531385935.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14336648775574760759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11636289498619716601.hoa' '-atoms' '/tmp/LTL15626869268531385935.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15626869268531385935.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11636289498619716601.hoa
Detected timeout of ITS tools.
[2024-05-24 17:25:49] [INFO ] Flatten gal took : 122 ms
[2024-05-24 17:25:49] [INFO ] Flatten gal took : 141 ms
[2024-05-24 17:25:49] [INFO ] Time to serialize gal into /tmp/LTL18086913586749789640.gal : 23 ms
[2024-05-24 17:25:49] [INFO ] Time to serialize properties into /tmp/LTL16796192772475701937.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18086913586749789640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16796192772475701937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(((turn_7==0)||(flag_7_idle==0))||(p25_1_5==0))"))&&(("((turn_6==0)||(flag_6_waiting==0))")||(("(p25_9_7==0)")||(F("(((turn_2...201
Formula 0 simplified : X(F!"(((turn_7==0)||(flag_7_idle==0))||(p25_1_5==0))" | (!"((turn_6==0)||(flag_6_waiting==0))" & !"(p25_9_7==0)" & G!"(((turn_2==1)&...191
Detected timeout of ITS tools.
[2024-05-24 17:26:04] [INFO ] Flatten gal took : 108 ms
[2024-05-24 17:26:04] [INFO ] Applying decomposition
[2024-05-24 17:26:04] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1554952595603536704.txt' '-o' '/tmp/graph1554952595603536704.bin' '-w' '/tmp/graph1554952595603536704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1554952595603536704.bin' '-l' '-1' '-v' '-w' '/tmp/graph1554952595603536704.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:26:05] [INFO ] Decomposing Gal with order
[2024-05-24 17:26:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:26:06] [INFO ] Removed a total of 8636 redundant transitions.
[2024-05-24 17:26:06] [INFO ] Flatten gal took : 882 ms
[2024-05-24 17:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 835 labels/synchronizations in 260 ms.
[2024-05-24 17:26:07] [INFO ] Time to serialize gal into /tmp/LTL3361263004675860030.gal : 36 ms
[2024-05-24 17:26:07] [INFO ] Time to serialize properties into /tmp/LTL2582270799925060159.ltl : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3361263004675860030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2582270799925060159.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("(((i3.u4.turn_7==0)||(i10.u80.flag_7_idle==0))||(i0.u0.p25_1_5==0))"))&&(("((u1.turn_6==0)||(i1.u2.flag_6_waiting==0))")||(("...257
Formula 0 simplified : X(F!"(((i3.u4.turn_7==0)||(i10.u80.flag_7_idle==0))||(i0.u0.p25_1_5==0))" | (!"((u1.turn_6==0)||(i1.u2.flag_6_waiting==0))" & !"(i15...247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4813477902118919925
[2024-05-24 17:26:22] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4813477902118919925
Running compilation step : cd /tmp/ltsmin4813477902118919925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4813477902118919925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4813477902118919925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-03 finished in 174439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (G(p1) U X(p2))))||G(p3)))'
Support contains 8 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 60 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-05-24 17:26:25] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:26:25] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 17:26:26] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-24 17:26:26] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:26:26] [INFO ] Invariant cache hit.
[2024-05-24 17:26:27] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:26:36] [INFO ] Implicit Places using invariants and state equation in 10152 ms returned []
Implicit Place search using SMT with State Equation took 11223 ms to find 0 implicit places.
[2024-05-24 17:26:36] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:26:36] [INFO ] Invariant cache hit.
[2024-05-24 17:26:39] [INFO ] Dead Transitions using invariants and state equation in 2822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14115 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 p0), acceptance={} source=2 dest: 8}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 11}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p1), acceptance={} source=10 dest: 6}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(NOT p3), acceptance={} source=11 dest: 6}, { cond=p3, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=12 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p3 p1), acceptance={} source=12 dest: 12}]], initial=0, aps=[p3:(AND (EQ s8 1) (EQ s36 1) (EQ s730 1)), p1:(AND (EQ s20 1) (EQ s553 1)), p0:(AND (EQ s1 1) (EQ s250 1)), p2:(EQ s314 1)], nbAcceptance=1, 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 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 14665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p0)))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 58 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-05-24 17:26:39] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:26:39] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 17:26:41] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2024-05-24 17:26:41] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:26:41] [INFO ] Invariant cache hit.
[2024-05-24 17:26:41] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:26:50] [INFO ] Implicit Places using invariants and state equation in 9525 ms returned []
Implicit Place search using SMT with State Equation took 10757 ms to find 0 implicit places.
[2024-05-24 17:26:50] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:26:50] [INFO ] Invariant cache hit.
[2024-05-24 17:26:54] [INFO ] Dead Transitions using invariants and state equation in 4225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15047 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 15186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X((p1||X(p0))) U (p2||F(p3)))))'
Support contains 10 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 104 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-05-24 17:26:55] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:26:55] [INFO ] Computed 31 invariants in 6 ms
[2024-05-24 17:26:56] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2024-05-24 17:26:56] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:26:56] [INFO ] Invariant cache hit.
[2024-05-24 17:26:57] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:27:06] [INFO ] Implicit Places using invariants and state equation in 10306 ms returned []
Implicit Place search using SMT with State Equation took 11574 ms to find 0 implicit places.
[2024-05-24 17:27:06] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:27:06] [INFO ] Invariant cache hit.
[2024-05-24 17:27:11] [INFO ] Dead Transitions using invariants and state equation in 4428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16107 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s250 1)), p3:(AND (EQ s4 1) (EQ s24 1) (EQ s664 1)), p1:(AND (EQ s4 1) (EQ s22 1) (EQ s739 1)), p0:(AND (EQ s8 1) (EQ s35 1) (EQ s68...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 504 ms.
Stack based approach found an accepted trace after 595 steps with 0 reset with depth 596 and stack size 596 in 6 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-07 finished in 16776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 68 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-05-24 17:27:11] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:27:11] [INFO ] Computed 31 invariants in 12 ms
[2024-05-24 17:27:13] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2024-05-24 17:27:13] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:27:13] [INFO ] Invariant cache hit.
[2024-05-24 17:27:14] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:27:23] [INFO ] Implicit Places using invariants and state equation in 10471 ms returned []
Implicit Place search using SMT with State Equation took 11755 ms to find 0 implicit places.
[2024-05-24 17:27:23] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:27:23] [INFO ] Invariant cache hit.
[2024-05-24 17:27:26] [INFO ] Dead Transitions using invariants and state equation in 3173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15003 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s8 0) (EQ s35 0) (EQ s720 0)), p0:(OR (EQ s9 0) (EQ s250 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2051 ms.
Product exploration explored 100000 steps with 50000 reset in 1891 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 19139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(p1 U X(G(p1)))))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 59 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-05-24 17:27:31] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 17:27:31] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 17:27:32] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-05-24 17:27:32] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:27:32] [INFO ] Invariant cache hit.
[2024-05-24 17:27:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:27:41] [INFO ] Implicit Places using invariants and state equation in 9439 ms returned []
Implicit Place search using SMT with State Equation took 10687 ms to find 0 implicit places.
[2024-05-24 17:27:41] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 17:27:41] [INFO ] Invariant cache hit.
[2024-05-24 17:27:45] [INFO ] Dead Transitions using invariants and state equation in 3364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14112 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s1 1) (EQ s13 1) (EQ s745 1)), p1:(EQ s291 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-09 finished in 14341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1006 transition count 4351
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 997 transition count 4351
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 997 transition count 4041
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 687 transition count 4041
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 644 place count 681 transition count 3981
Iterating global reduction 2 with 6 rules applied. Total rules applied 650 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 830 place count 591 transition count 3891
Applied a total of 830 rules in 292 ms. Remains 591 /1006 variables (removed 415) and now considering 3891/4360 (removed 469) transitions.
[2024-05-24 17:27:45] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 17:27:45] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 17:27:46] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2024-05-24 17:27:46] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 17:27:46] [INFO ] Invariant cache hit.
[2024-05-24 17:27:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 17:27:52] [INFO ] Implicit Places using invariants and state equation in 5221 ms returned []
Implicit Place search using SMT with State Equation took 6429 ms to find 0 implicit places.
[2024-05-24 17:27:52] [INFO ] Redundant transitions in 189 ms returned []
[2024-05-24 17:27:52] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 17:27:52] [INFO ] Invariant cache hit.
[2024-05-24 17:27:55] [INFO ] Dead Transitions using invariants and state equation in 3646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1006 places, 3891/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10568 ms. Remains : 591/1006 places, 3891/4360 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s27 1) (EQ s450 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 489 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 11131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 996 transition count 4040
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 686 transition count 4040
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 645 place count 681 transition count 3990
Iterating global reduction 2 with 5 rules applied. Total rules applied 650 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 830 place count 591 transition count 3900
Applied a total of 830 rules in 299 ms. Remains 591 /1006 variables (removed 415) and now considering 3900/4360 (removed 460) transitions.
[2024-05-24 17:27:56] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2024-05-24 17:27:56] [INFO ] Computed 31 invariants in 6 ms
[2024-05-24 17:27:57] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2024-05-24 17:27:57] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-05-24 17:27:57] [INFO ] Invariant cache hit.
[2024-05-24 17:27:58] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:28:03] [INFO ] Implicit Places using invariants and state equation in 5920 ms returned []
Implicit Place search using SMT with State Equation took 7054 ms to find 0 implicit places.
[2024-05-24 17:28:03] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-24 17:28:03] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-05-24 17:28:03] [INFO ] Invariant cache hit.
[2024-05-24 17:28:07] [INFO ] Dead Transitions using invariants and state equation in 3428 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1006 places, 3900/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10983 ms. Remains : 591/1006 places, 3900/4360 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s160 1)) (AND (EQ s4 1) (EQ s24 1) (EQ s436 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-14 finished in 11463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(F(p1)))) U X(G(p0))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 59 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-05-24 17:28:07] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:28:07] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 17:28:09] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2024-05-24 17:28:09] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:28:09] [INFO ] Invariant cache hit.
[2024-05-24 17:28:09] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:28:20] [INFO ] Implicit Places using invariants and state equation in 11212 ms returned []
Implicit Place search using SMT with State Equation took 12478 ms to find 0 implicit places.
[2024-05-24 17:28:20] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:28:20] [INFO ] Invariant cache hit.
[2024-05-24 17:28:25] [INFO ] Dead Transitions using invariants and state equation in 4578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17117 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 186 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s250 1)), p1:(AND (EQ s29 1) (EQ s867 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 25033 reset in 1459 ms.
Product exploration explored 100000 steps with 24965 reset in 1489 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 273977 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 273977 steps, saw 213040 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-24 17:28:31] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-05-24 17:28:31] [INFO ] Invariant cache hit.
[2024-05-24 17:28:31] [INFO ] [Real]Absence check using 21 positive place invariants in 41 ms returned sat
[2024-05-24 17:28:31] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-24 17:28:32] [INFO ] After 928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:28:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 38 ms returned sat
[2024-05-24 17:28:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-24 17:28:33] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:28:33] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:28:34] [INFO ] After 373ms SMT Verify possible using 445 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:28:35] [INFO ] Deduced a trap composed of 3 places in 1050 ms of which 2 ms to minimize.
[2024-05-24 17:28:36] [INFO ] Deduced a trap composed of 3 places in 1152 ms of which 1 ms to minimize.
[2024-05-24 17:28:37] [INFO ] Deduced a trap composed of 99 places in 1012 ms of which 2 ms to minimize.
[2024-05-24 17:28:38] [INFO ] Deduced a trap composed of 56 places in 939 ms of which 1 ms to minimize.
[2024-05-24 17:28:39] [INFO ] Deduced a trap composed of 8 places in 995 ms of which 1 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 50 places in 991 ms of which 1 ms to minimize.
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 3 places in 1109 ms of which 1 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 72 places in 880 ms of which 1 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 117 places in 933 ms of which 1 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 47 places in 902 ms of which 1 ms to minimize.
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 50 places in 910 ms of which 1 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 63 places in 868 ms of which 1 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 3 places in 801 ms of which 2 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 3 places in 478 ms of which 1 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 36 places in 398 ms of which 1 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 69 places in 382 ms of which 1 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 3 places in 323 ms of which 1 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 0 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 0 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 0 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 16876 ms
[2024-05-24 17:28:51] [INFO ] After 17378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-24 17:28:51] [INFO ] After 18439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 991 transition count 3990
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 591 transition count 3900
Applied a total of 820 rules in 263 ms. Remains 591 /1001 variables (removed 410) and now considering 3900/4310 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 591/1001 places, 3900/4310 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 286935 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286935 steps, saw 194983 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 17:28:54] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2024-05-24 17:28:54] [INFO ] Computed 31 invariants in 9 ms
[2024-05-24 17:28:54] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2024-05-24 17:28:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 17:28:55] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:28:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 17:28:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 17:28:55] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:28:55] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:28:55] [INFO ] After 200ms SMT Verify possible using 445 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 1 ms to minimize.
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 1 ms to minimize.
[2024-05-24 17:28:57] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 1 ms to minimize.
[2024-05-24 17:28:57] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 0 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 0 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 1 ms to minimize.
[2024-05-24 17:28:59] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 1 ms to minimize.
[2024-05-24 17:28:59] [INFO ] Deduced a trap composed of 32 places in 418 ms of which 1 ms to minimize.
[2024-05-24 17:28:59] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2024-05-24 17:29:00] [INFO ] Deduced a trap composed of 57 places in 354 ms of which 1 ms to minimize.
[2024-05-24 17:29:00] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 1 ms to minimize.
[2024-05-24 17:29:00] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 0 ms to minimize.
[2024-05-24 17:29:01] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 0 ms to minimize.
[2024-05-24 17:29:01] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-05-24 17:29:01] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 0 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6829 ms
[2024-05-24 17:29:02] [INFO ] After 7106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-24 17:29:02] [INFO ] After 7812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3900/3900 transitions.
Applied a total of 0 rules in 166 ms. Remains 591 /591 variables (removed 0) and now considering 3900/3900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 591/591 places, 3900/3900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3900/3900 transitions.
Applied a total of 0 rules in 169 ms. Remains 591 /591 variables (removed 0) and now considering 3900/3900 (removed 0) transitions.
[2024-05-24 17:29:03] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-05-24 17:29:03] [INFO ] Invariant cache hit.
[2024-05-24 17:29:04] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2024-05-24 17:29:04] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-05-24 17:29:04] [INFO ] Invariant cache hit.
[2024-05-24 17:29:04] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:29:09] [INFO ] Implicit Places using invariants and state equation in 5357 ms returned []
Implicit Place search using SMT with State Equation took 6484 ms to find 0 implicit places.
[2024-05-24 17:29:09] [INFO ] Redundant transitions in 194 ms returned []
[2024-05-24 17:29:09] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-05-24 17:29:09] [INFO ] Invariant cache hit.
[2024-05-24 17:29:13] [INFO ] Dead Transitions using invariants and state equation in 3733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10589 ms. Remains : 591/591 places, 3900/3900 transitions.
Graph (trivial) has 3668 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 348 transitions
Ensure Unique test removed 2799 transitions
Reduce isomorphic transitions removed 3147 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 501 transition count 634
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 382 transition count 634
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 239 place count 382 transition count 614
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 288 place count 353 transition count 614
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 648 place count 173 transition count 434
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 738 place count 173 transition count 344
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 164 transition count 344
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 164 transition count 335
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 775 place count 164 transition count 325
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 866 place count 164 transition count 234
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 957 place count 73 transition count 234
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 967 place count 73 transition count 234
Applied a total of 967 rules in 36 ms. Remains 73 /591 variables (removed 518) and now considering 234/3900 (removed 3666) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 73 cols
[2024-05-24 17:29:13] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 17:29:13] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 17:29:13] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 17:29:13] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:29:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 17:29:13] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 17:29:13] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 17:29:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 17:29:13] [INFO ] After 20ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-24 17:29:14] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 17:29:14] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
[2024-05-24 17:29:14] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-05-24 17:29:14] [INFO ] Computed 31 invariants in 8 ms
[2024-05-24 17:29:19] [INFO ] [Real]Absence check using 21 positive place invariants in 44 ms returned sat
[2024-05-24 17:29:19] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 125 ms returned sat
[2024-05-24 17:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 17:29:21] [INFO ] [Real]Absence check using state equation in 2418 ms returned sat
[2024-05-24 17:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:29:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 40 ms returned sat
[2024-05-24 17:29:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 78 ms returned sat
[2024-05-24 17:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 17:29:27] [INFO ] [Nat]Absence check using state equation in 2131 ms returned sat
[2024-05-24 17:29:27] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 17:29:28] [INFO ] [Nat]Added 445 Read/Feed constraints in 169 ms returned sat
[2024-05-24 17:29:29] [INFO ] Deduced a trap composed of 3 places in 1123 ms of which 2 ms to minimize.
[2024-05-24 17:29:30] [INFO ] Deduced a trap composed of 124 places in 1097 ms of which 1 ms to minimize.
[2024-05-24 17:29:31] [INFO ] Deduced a trap composed of 3 places in 916 ms of which 1 ms to minimize.
[2024-05-24 17:29:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 3407 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 83837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p2)||p1))))'
[2024-05-24 17:29:32] [INFO ] Flatten gal took : 135 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9198680295492037294
[2024-05-24 17:29:32] [INFO ] Too many transitions (4360) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:29:32] [INFO ] Applying decomposition
[2024-05-24 17:29:32] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9198680295492037294
Running compilation step : cd /tmp/ltsmin9198680295492037294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 17:29:32] [INFO ] Flatten gal took : 187 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9572344939859061465.txt' '-o' '/tmp/graph9572344939859061465.bin' '-w' '/tmp/graph9572344939859061465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9572344939859061465.bin' '-l' '-1' '-v' '-w' '/tmp/graph9572344939859061465.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:29:32] [INFO ] Decomposing Gal with order
[2024-05-24 17:29:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:29:33] [INFO ] Removed a total of 9276 redundant transitions.
[2024-05-24 17:29:33] [INFO ] Flatten gal took : 438 ms
[2024-05-24 17:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 873 labels/synchronizations in 216 ms.
[2024-05-24 17:29:33] [INFO ] Time to serialize gal into /tmp/LTLFireability3011430452441313384.gal : 41 ms
[2024-05-24 17:29:33] [INFO ] Time to serialize properties into /tmp/LTLFireability18242046218323804441.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3011430452441313384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18242046218323804441.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(((i16.u12.turn_7==0)||(i13.u253.flag_7_idle==0))||(i20.u249.p25_1_5==0))"))&&(("((i12.i1.i0.u9.turn_6==0)||(i20.u249.flag_6_...296
Formula 0 simplified : X(F!"(((i16.u12.turn_7==0)||(i13.u253.flag_7_idle==0))||(i20.u249.p25_1_5==0))" | (!"((i12.i1.i0.u9.turn_6==0)||(i20.u249.flag_6_wai...286
Compilation finished in 21690 ms.
Running link step : cd /tmp/ltsmin9198680295492037294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin9198680295492037294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 17:53:26] [INFO ] Applying decomposition
[2024-05-24 17:53:26] [INFO ] Flatten gal took : 278 ms
[2024-05-24 17:53:26] [INFO ] Decomposing Gal with order
[2024-05-24 17:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:53:27] [INFO ] Removed a total of 10449 redundant transitions.
[2024-05-24 17:53:28] [INFO ] Flatten gal took : 1195 ms
[2024-05-24 17:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 433 labels/synchronizations in 291 ms.
[2024-05-24 17:53:28] [INFO ] Time to serialize gal into /tmp/LTLFireability4056037227543665247.gal : 83 ms
[2024-05-24 17:53:28] [INFO ] Time to serialize properties into /tmp/LTLFireability3860076771793482482.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4056037227543665247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3860076771793482482.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((u12.turn_7==0)||(u20.flag_7_idle==0))||(i0.u24.p25_1_5==0))"))&&(("((u12.turn_6==0)||(u19.flag_6_waiting==0))")||(("(u7.p2...242
Formula 0 simplified : X(F!"(((u12.turn_7==0)||(u20.flag_7_idle==0))||(i0.u24.p25_1_5==0))" | (!"((u12.turn_6==0)||(u19.flag_6_waiting==0))" & !"(u7.p25_9_...232
Detected timeout of ITS tools.
[2024-05-24 18:17:21] [INFO ] Flatten gal took : 320 ms
[2024-05-24 18:17:22] [INFO ] Input system was already deterministic with 4360 transitions.
[2024-05-24 18:17:22] [INFO ] Transformed 1006 places.
[2024-05-24 18:17:22] [INFO ] Transformed 4360 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 18:17:23] [INFO ] Time to serialize gal into /tmp/LTLFireability14114726266016237077.gal : 50 ms
[2024-05-24 18:17:23] [INFO ] Time to serialize properties into /tmp/LTLFireability15659233785563029707.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14114726266016237077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15659233785563029707.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(((turn_7==0)||(flag_7_idle==0))||(p25_1_5==0))"))&&(("((turn_6==0)||(flag_6_waiting==0))")||(("(p25_9_7==0)")||(F("(((turn_2...201
Formula 0 simplified : X(F!"(((turn_7==0)||(flag_7_idle==0))||(p25_1_5==0))" | (!"((turn_6==0)||(flag_6_waiting==0))" & !"(p25_9_7==0)" & G!"(((turn_2==1)&...191
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12925624 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16035720 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-10, 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 r175-smll-171636280000128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 ;