About the Execution of LTSMin+red for AutoFlight-PT-24b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2005.611 | 3600000.00 | 10052922.00 | 4595.70 | ?FFF?F??FFFFFFFF | 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.r468-smll-171620167200180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 538K 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 AutoFlight-PT-24b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717194629583
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:30:32] [INFO ] Load time of PNML (sax parser for PT used): 427 ms
[2024-05-31 22:30:32] [INFO ] Transformed 2230 places.
[2024-05-31 22:30:32] [INFO ] Transformed 2228 transitions.
[2024-05-31 22:30:32] [INFO ] Found NUPN structural information;
[2024-05-31 22:30:32] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 715 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-24b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 1928 transition count 1926
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 1928 transition count 1926
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 651 place count 1928 transition count 1879
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 787 place count 1792 transition count 1743
Iterating global reduction 1 with 136 rules applied. Total rules applied 923 place count 1792 transition count 1743
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 944 place count 1771 transition count 1722
Iterating global reduction 1 with 21 rules applied. Total rules applied 965 place count 1771 transition count 1722
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 986 place count 1750 transition count 1701
Iterating global reduction 1 with 21 rules applied. Total rules applied 1007 place count 1750 transition count 1701
Applied a total of 1007 rules in 1471 ms. Remains 1750 /2230 variables (removed 480) and now considering 1701/2228 (removed 527) transitions.
// Phase 1: matrix 1701 rows 1750 cols
[2024-05-31 22:30:34] [INFO ] Computed 148 invariants in 74 ms
[2024-05-31 22:30:36] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2024-05-31 22:30:36] [INFO ] Invariant cache hit.
[2024-05-31 22:30:41] [INFO ] Implicit Places using invariants and state equation in 5391 ms returned []
Implicit Place search using SMT with State Equation took 6862 ms to find 0 implicit places.
Running 1700 sub problems to find dead transitions.
[2024-05-31 22:30:41] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1749/3451 variables, and 0 constraints, problems are : Problem set: 0 solved, 1700 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1750 constraints, PredecessorRefiner: 1700/1700 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1700 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/3451 variables, and 0 constraints, problems are : Problem set: 0 solved, 1700 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1750 constraints, PredecessorRefiner: 0/1700 constraints, Known Traps: 0/0 constraints]
After SMT, in 61062ms problems are : Problem set: 0 solved, 1700 unsolved
Search for dead transitions found 0 dead transitions in 61140ms
Starting structural reductions in LTL mode, iteration 1 : 1750/2230 places, 1701/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69541 ms. Remains : 1750/2230 places, 1701/2228 transitions.
Support contains 44 out of 1750 places after structural reductions.
[2024-05-31 22:31:43] [INFO ] Flatten gal took : 309 ms
[2024-05-31 22:31:43] [INFO ] Flatten gal took : 139 ms
[2024-05-31 22:31:43] [INFO ] Input system was already deterministic with 1701 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (36 resets) in 2725 ms. (14 steps per ms) remains 13/38 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
[2024-05-31 22:31:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 563/582 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/582 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1048/1630 variables, 132/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1630 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 120/1750 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1701/3451 variables, 1750/1898 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3451 variables, 0/1898 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 (/ 3.0 4.0))
(s206 (/ 1.0 4.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 1.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 1.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 (/ 1.0 4.0))
(s850 0.0)
(s851 (/ 3.0 4.0))
(s852 0.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 1.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 1.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 1.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 0.0)
(s919 1.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 1.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 1.0)
(s939 0.0)
(s940 0.0)
(s941 1.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 1.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 1.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 1.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 1.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 1.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 1.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 1.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3451/3451 variables, and 1898 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1750/1750 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 563/582 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/582 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1048/1630 variables, 132/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1630 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1630 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 120/1750 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:31:54] [INFO ] Deduced a trap composed of 17 places in 1273 ms of which 16 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 39 places in 1008 ms of which 11 ms to minimize.
SMT process timed out in 10307ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1750 transition count 1071
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 703 rules applied. Total rules applied 1333 place count 1120 transition count 998
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1382 place count 1072 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1383 place count 1071 transition count 997
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 196 Pre rules applied. Total rules applied 1383 place count 1071 transition count 801
Deduced a syphon composed of 196 places in 4 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 4 with 392 rules applied. Total rules applied 1775 place count 875 transition count 801
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1778 place count 872 transition count 798
Iterating global reduction 4 with 3 rules applied. Total rules applied 1781 place count 872 transition count 798
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1781 place count 872 transition count 797
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1783 place count 871 transition count 797
Performed 342 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 4 with 684 rules applied. Total rules applied 2467 place count 529 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2468 place count 529 transition count 407
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 94 times.
Iterating global reduction 5 with 94 rules applied. Total rules applied 2562 place count 529 transition count 313
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 2656 place count 435 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2657 place count 434 transition count 312
Reduce places removed 107 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 6 with 263 rules applied. Total rules applied 2920 place count 327 transition count 156
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 7 with 156 rules applied. Total rules applied 3076 place count 171 transition count 156
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 49 Pre rules applied. Total rules applied 3076 place count 171 transition count 107
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 3174 place count 122 transition count 107
Applied a total of 3174 rules in 532 ms. Remains 122 /1750 variables (removed 1628) and now considering 107/1701 (removed 1594) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 122/1750 places, 107/1701 transitions.
RANDOM walk for 11219 steps (310 resets) in 273 ms. (40 steps per ms) remains 0/13 properties
Computed a total of 430 stabilizing places and 430 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 634 rules applied. Total rules applied 634 place count 1749 transition count 1066
Reduce places removed 634 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 707 rules applied. Total rules applied 1341 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1389 place count 1067 transition count 993
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1389 place count 1067 transition count 793
Deduced a syphon composed of 200 places in 12 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1789 place count 867 transition count 793
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1797 place count 859 transition count 785
Iterating global reduction 3 with 8 rules applied. Total rules applied 1805 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1805 place count 859 transition count 780
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1815 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2491 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2492 place count 515 transition count 393
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 68 rules applied. Total rules applied 2560 place count 469 transition count 371
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2582 place count 447 transition count 371
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2582 place count 447 transition count 347
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2630 place count 423 transition count 347
Applied a total of 2630 rules in 390 ms. Remains 423 /1750 variables (removed 1327) and now considering 347/1701 (removed 1354) transitions.
// Phase 1: matrix 347 rows 423 cols
[2024-05-31 22:31:57] [INFO ] Computed 102 invariants in 6 ms
[2024-05-31 22:31:57] [INFO ] Implicit Places using invariants in 428 ms returned [175, 249, 323, 327, 331, 335, 339, 343, 348, 352, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 417, 422]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 432 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/1750 places, 347/1701 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 371 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 370 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 348 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 347 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 347 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 346 transition count 297
Applied a total of 100 rules in 202 ms. Remains 346 /396 variables (removed 50) and now considering 297/347 (removed 50) transitions.
// Phase 1: matrix 297 rows 346 cols
[2024-05-31 22:31:58] [INFO ] Computed 75 invariants in 2 ms
[2024-05-31 22:31:58] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 22:31:58] [INFO ] Invariant cache hit.
[2024-05-31 22:31:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:31:59] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1750 places, 297/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2207 ms. Remains : 346/1750 places, 297/1701 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-00
Product exploration explored 100000 steps with 1235 reset in 1132 ms.
Product exploration explored 100000 steps with 1232 reset in 785 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1882 steps (18 resets) in 22 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 242 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 188 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 297/297 transitions.
Applied a total of 0 rules in 24 ms. Remains 346 /346 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-31 22:32:02] [INFO ] Invariant cache hit.
[2024-05-31 22:32:02] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-31 22:32:03] [INFO ] Invariant cache hit.
[2024-05-31 22:32:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:32:03] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2024-05-31 22:32:03] [INFO ] Redundant transitions in 29 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-31 22:32:03] [INFO ] Invariant cache hit.
[2024-05-31 22:32:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 424 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17931 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 175/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 599 constraints, problems are : Problem set: 0 solved, 175 unsolved in 24503 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
After SMT, in 42500ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 42506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43931 ms. Remains : 346/346 places, 297/297 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 137 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8547 steps (102 resets) in 77 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1243 reset in 691 ms.
Product exploration explored 100000 steps with 1225 reset in 549 ms.
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 297/297 transitions.
Applied a total of 0 rules in 18 ms. Remains 346 /346 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-31 22:32:48] [INFO ] Invariant cache hit.
[2024-05-31 22:32:48] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-31 22:32:48] [INFO ] Invariant cache hit.
[2024-05-31 22:32:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:32:49] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2024-05-31 22:32:49] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-31 22:32:49] [INFO ] Invariant cache hit.
[2024-05-31 22:32:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 424 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19807 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 175/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 599 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18892 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
After SMT, in 38727ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40084 ms. Remains : 346/346 places, 297/297 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-00 finished in 91813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1729 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1729 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1727 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1727 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1725 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1725 transition count 1676
Applied a total of 50 rules in 818 ms. Remains 1725 /1750 variables (removed 25) and now considering 1676/1701 (removed 25) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2024-05-31 22:33:29] [INFO ] Computed 148 invariants in 26 ms
[2024-05-31 22:33:30] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-31 22:33:30] [INFO ] Invariant cache hit.
[2024-05-31 22:33:34] [INFO ] Implicit Places using invariants and state equation in 3729 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-31 22:33:34] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3401 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3401 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1675 constraints, Known Traps: 0/0 constraints]
After SMT, in 60623ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1676/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66216 ms. Remains : 1725/1750 places, 1676/1701 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 730 steps with 0 reset in 10 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-01 finished in 66492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(!p1)) U (p2&&X(p3)))))'
Support contains 5 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1737 transition count 1688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1737 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 1732 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 1732 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1730 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 819 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:34:36] [INFO ] Computed 148 invariants in 17 ms
[2024-05-31 22:34:37] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-31 22:34:37] [INFO ] Invariant cache hit.
[2024-05-31 22:34:40] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 4722 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:34:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60753ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66345 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, p1, (NOT p3), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-02 finished in 66843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&F((p2&&X(p3))))))))'
Support contains 3 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1737 transition count 1688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1737 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 1732 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 1732 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1730 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 1005 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:35:43] [INFO ] Computed 148 invariants in 10 ms
[2024-05-31 22:35:44] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-31 22:35:44] [INFO ] Invariant cache hit.
[2024-05-31 22:35:48] [INFO ] Implicit Places using invariants and state equation in 4065 ms returned []
Implicit Place search using SMT with State Equation took 4938 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:35:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60720ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66667 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-03 finished in 67078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||(p2&&(p1 U (G(p1)||(p1&&G((p3&&F(p4)))))))))))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1749 transition count 1073
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 697 rules applied. Total rules applied 1324 place count 1122 transition count 1003
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 49 rules applied. Total rules applied 1373 place count 1076 transition count 1000
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1376 place count 1073 transition count 1000
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 1376 place count 1073 transition count 798
Deduced a syphon composed of 202 places in 6 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1780 place count 871 transition count 798
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1789 place count 862 transition count 789
Iterating global reduction 4 with 9 rules applied. Total rules applied 1798 place count 862 transition count 789
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1798 place count 862 transition count 784
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1808 place count 857 transition count 784
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2484 place count 519 transition count 398
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2486 place count 518 transition count 398
Applied a total of 2486 rules in 328 ms. Remains 518 /1750 variables (removed 1232) and now considering 398/1701 (removed 1303) transitions.
// Phase 1: matrix 398 rows 518 cols
[2024-05-31 22:36:49] [INFO ] Computed 148 invariants in 3 ms
[2024-05-31 22:36:50] [INFO ] Implicit Places using invariants in 1157 ms returned [172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 184, 185, 186, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 221, 222, 223, 224, 298, 372, 378, 384, 390, 396, 402, 408, 414, 420, 426, 432, 438, 444, 450, 456, 462, 468, 474, 480, 486, 492, 498, 504, 510, 517]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 72 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/1750 places, 398/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 446 transition count 353
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 401 transition count 353
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 115 place count 376 transition count 328
Iterating global reduction 2 with 25 rules applied. Total rules applied 140 place count 376 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 375 transition count 327
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 375 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 374 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 374 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 373 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 373 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 372 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 372 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 371 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 371 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 370 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 370 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 369 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 369 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 368 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 368 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 367 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 367 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 366 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 365 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 364 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 363 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 362 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 361 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 360 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 359 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 358 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 357 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 356 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 355 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 354 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 353 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 352 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 352 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 351 transition count 303
Applied a total of 190 rules in 164 ms. Remains 351 /446 variables (removed 95) and now considering 303/398 (removed 95) transitions.
// Phase 1: matrix 303 rows 351 cols
[2024-05-31 22:36:50] [INFO ] Computed 76 invariants in 1 ms
[2024-05-31 22:36:51] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-31 22:36:51] [INFO ] Invariant cache hit.
[2024-05-31 22:36:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:36:52] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 351/1750 places, 303/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3200 ms. Remains : 351/1750 places, 303/1701 transitions.
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-04
Product exploration explored 100000 steps with 1593 reset in 985 ms.
Product exploration explored 100000 steps with 1616 reset in 768 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3 p4), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 1806 ms. Reduced automaton from 7 states, 29 edges and 5 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
RANDOM walk for 2286 steps (25 resets) in 23 ms. (95 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND p0 p1 p2 p3 p4), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT p4)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (OR p1 p4))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 21 factoid took 3358 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 303/303 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-31 22:37:00] [INFO ] Invariant cache hit.
[2024-05-31 22:37:01] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-31 22:37:01] [INFO ] Invariant cache hit.
[2024-05-31 22:37:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:37:02] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
[2024-05-31 22:37:02] [INFO ] Redundant transitions in 6 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-31 22:37:02] [INFO ] Invariant cache hit.
[2024-05-31 22:37:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 499 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 800 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61962 ms. Remains : 351/351 places, 303/303 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p3 p4 p2), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 22 factoid took 1438 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
RANDOM walk for 2444 steps (28 resets) in 31 ms. (76 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND p1 p3 p4 p2), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT p4)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (OR p1 p4))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 22 factoid took 2294 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Product exploration explored 100000 steps with 1606 reset in 834 ms.
Product exploration explored 100000 steps with 1620 reset in 696 ms.
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 303/303 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-31 22:38:09] [INFO ] Invariant cache hit.
[2024-05-31 22:38:09] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-31 22:38:09] [INFO ] Invariant cache hit.
[2024-05-31 22:38:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:38:10] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2024-05-31 22:38:10] [INFO ] Redundant transitions in 3 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-31 22:38:10] [INFO ] Invariant cache hit.
[2024-05-31 22:38:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 499 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 800 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61665 ms. Remains : 351/351 places, 303/303 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-04 finished in 141986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1734 transition count 1685
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1724 transition count 1674
Applied a total of 53 rules in 796 ms. Remains 1724 /1750 variables (removed 26) and now considering 1674/1701 (removed 27) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-31 22:39:12] [INFO ] Computed 148 invariants in 11 ms
[2024-05-31 22:39:13] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-31 22:39:13] [INFO ] Invariant cache hit.
[2024-05-31 22:39:16] [INFO ] Implicit Places using invariants and state equation in 3634 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-31 22:39:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints]
After SMT, in 60709ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1750 places, 1674/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66373 ms. Remains : 1724/1750 places, 1674/1701 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06
Product exploration explored 100000 steps with 347 reset in 439 ms.
Product exploration explored 100000 steps with 340 reset in 493 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1193 steps (0 resets) in 10 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:40:19] [INFO ] Invariant cache hit.
[2024-05-31 22:40:21] [INFO ] [Real]Absence check using 147 positive place invariants in 230 ms returned sat
[2024-05-31 22:40:21] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-31 22:40:34] [INFO ] [Real]Absence check using state equation in 13269 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 94 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2024-05-31 22:40:34] [INFO ] Invariant cache hit.
[2024-05-31 22:40:35] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-31 22:40:35] [INFO ] Invariant cache hit.
[2024-05-31 22:40:38] [INFO ] Implicit Places using invariants and state equation in 3420 ms returned []
Implicit Place search using SMT with State Equation took 4390 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-31 22:40:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Finished structural reductions in LTL mode , in 1 iterations and 64977 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1051 steps (0 resets) in 9 ms. (105 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:41:40] [INFO ] Invariant cache hit.
[2024-05-31 22:41:41] [INFO ] [Real]Absence check using 147 positive place invariants in 193 ms returned sat
[2024-05-31 22:41:41] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-31 22:41:55] [INFO ] [Real]Absence check using state equation in 13422 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 346 reset in 322 ms.
Product exploration explored 100000 steps with 346 reset in 328 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1724 transition count 1674
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 602 place count 1724 transition count 1650
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 602 place count 1724 transition count 1650
Deduced a syphon composed of 800 places in 7 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 824 place count 1724 transition count 1650
Discarding 479 places :
Symmetric choice reduction at 2 with 479 rule applications. Total rules 1303 place count 1245 transition count 1171
Deduced a syphon composed of 321 places in 4 ms
Iterating global reduction 2 with 479 rules applied. Total rules applied 1782 place count 1245 transition count 1171
Performed 411 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 732 places in 1 ms
Iterating global reduction 2 with 411 rules applied. Total rules applied 2193 place count 1245 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 265 places :
Symmetric choice reduction at 2 with 265 rule applications. Total rules 2458 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 265 rules applied. Total rules applied 2723 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2723 rules in 1023 ms. Remains 980 /1724 variables (removed 744) and now considering 858/1674 (removed 816) transitions.
[2024-05-31 22:41:57] [INFO ] Redundant transitions in 9 ms returned []
Running 857 sub problems to find dead transitions.
// Phase 1: matrix 858 rows 980 cols
[2024-05-31 22:41:57] [INFO ] Computed 148 invariants in 28 ms
[2024-05-31 22:41:57] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/979 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/1838 variables, and 1 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/146 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/980 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/979 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/979 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (OVERLAPS) 1/980 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 22:42:46] [INFO ] Deduced a trap composed of 2 places in 659 ms of which 9 ms to minimize.
[2024-05-31 22:42:47] [INFO ] Deduced a trap composed of 2 places in 679 ms of which 9 ms to minimize.
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 2 places in 593 ms of which 8 ms to minimize.
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 2 places in 651 ms of which 7 ms to minimize.
[2024-05-31 22:42:49] [INFO ] Deduced a trap composed of 2 places in 779 ms of which 9 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 2 places in 693 ms of which 9 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 2 places in 662 ms of which 7 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 3 places in 711 ms of which 9 ms to minimize.
[2024-05-31 22:42:52] [INFO ] Deduced a trap composed of 2 places in 576 ms of which 7 ms to minimize.
[2024-05-31 22:42:52] [INFO ] Deduced a trap composed of 2 places in 502 ms of which 8 ms to minimize.
[2024-05-31 22:42:53] [INFO ] Deduced a trap composed of 2 places in 503 ms of which 7 ms to minimize.
[2024-05-31 22:42:53] [INFO ] Deduced a trap composed of 2 places in 488 ms of which 7 ms to minimize.
[2024-05-31 22:42:54] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 7 ms to minimize.
[2024-05-31 22:42:54] [INFO ] Deduced a trap composed of 3 places in 486 ms of which 8 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 10 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 7 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 7 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 7 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 7 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 7 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD752 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 20/168 constraints. Problems are: Problem set: 149 solved, 708 unsolved
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 2 places in 403 ms of which 6 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 2 places in 410 ms of which 6 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 5 ms to minimize.
SMT process timed out in 62107ms, After SMT, problems are : Problem set: 149 solved, 708 unsolved
Search for dead transitions found 149 dead transitions in 62118ms
Found 149 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 149 transitions
Dead transitions reduction (with SMT) removed 149 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1724 places, 709/1674 transitions.
Graph (complete) has 2051 edges and 980 vertex of which 831 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.3 ms
Discarding 149 places :
Also discarding 0 output transitions
Deduced a syphon composed of 318 places in 0 ms
Applied a total of 1 rules in 39 ms. Remains 831 /980 variables (removed 149) and now considering 709/709 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 831/1724 places, 709/1674 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63199 ms. Remains : 831/1724 places, 709/1674 transitions.
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 160 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-31 22:42:59] [INFO ] Computed 148 invariants in 14 ms
[2024-05-31 22:43:00] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-31 22:43:00] [INFO ] Invariant cache hit.
[2024-05-31 22:43:03] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 3911 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-31 22:43:03] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Finished structural reductions in LTL mode , in 1 iterations and 64557 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 292890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 641 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:44:04] [INFO ] Computed 148 invariants in 7 ms
[2024-05-31 22:44:05] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-31 22:44:05] [INFO ] Invariant cache hit.
[2024-05-31 22:44:09] [INFO ] Implicit Places using invariants and state equation in 3415 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:44:09] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65422 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-07
Product exploration explored 100000 steps with 94 reset in 394 ms.
Product exploration explored 100000 steps with 94 reset in 468 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (36 resets) in 217 ms. (183 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-05-31 22:45:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1728 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1728 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1678/3406 variables, 1728/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 1876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1728/1728 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:45:13] [INFO ] Deduced a trap composed of 66 places in 501 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1728 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:45:14] [INFO ] Deduced a trap composed of 15 places in 859 ms of which 11 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 29 places in 874 ms of which 11 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 27 places in 818 ms of which 10 ms to minimize.
[2024-05-31 22:45:17] [INFO ] Deduced a trap composed of 23 places in 810 ms of which 10 ms to minimize.
[2024-05-31 22:45:17] [INFO ] Deduced a trap composed of 35 places in 801 ms of which 11 ms to minimize.
SMT process timed out in 6743ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1728 transition count 1051
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 137 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 61/1728 places, 58/1678 transitions.
RANDOM walk for 172 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT p1)), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 367 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2024-05-31 22:45:18] [INFO ] Invariant cache hit.
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 147 positive place invariants in 177 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 12 ms returned sat
[2024-05-31 22:45:33] [INFO ] [Real]Absence check using state equation in 13498 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 113 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2024-05-31 22:45:33] [INFO ] Invariant cache hit.
[2024-05-31 22:45:34] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-31 22:45:34] [INFO ] Invariant cache hit.
[2024-05-31 22:45:37] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned []
Implicit Place search using SMT with State Equation took 3986 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:45:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in LTL mode , in 1 iterations and 64596 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (36 resets) in 204 ms. (195 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-05-31 22:46:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1728 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1728 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1678/3406 variables, 1728/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 1876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1728/1728 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:46:41] [INFO ] Deduced a trap composed of 66 places in 460 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1728 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:46:42] [INFO ] Deduced a trap composed of 15 places in 828 ms of which 15 ms to minimize.
[2024-05-31 22:46:43] [INFO ] Deduced a trap composed of 29 places in 880 ms of which 10 ms to minimize.
[2024-05-31 22:46:43] [INFO ] Deduced a trap composed of 27 places in 791 ms of which 10 ms to minimize.
[2024-05-31 22:46:44] [INFO ] Deduced a trap composed of 23 places in 781 ms of which 10 ms to minimize.
[2024-05-31 22:46:45] [INFO ] Deduced a trap composed of 35 places in 760 ms of which 10 ms to minimize.
SMT process timed out in 6522ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1728 transition count 1051
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 138 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 61/1728 places, 58/1678 transitions.
RANDOM walk for 132 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2024-05-31 22:46:46] [INFO ] Invariant cache hit.
[2024-05-31 22:46:47] [INFO ] [Real]Absence check using 147 positive place invariants in 170 ms returned sat
[2024-05-31 22:46:47] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 12 ms returned sat
[2024-05-31 22:47:01] [INFO ] [Real]Absence check using state equation in 13710 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 94 reset in 390 ms.
Product exploration explored 100000 steps with 94 reset in 448 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1728 transition count 1678
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 604 place count 1728 transition count 1654
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 604 place count 1728 transition count 1654
Deduced a syphon composed of 801 places in 6 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 825 place count 1728 transition count 1654
Discarding 480 places :
Symmetric choice reduction at 2 with 480 rule applications. Total rules 1305 place count 1248 transition count 1174
Deduced a syphon composed of 321 places in 5 ms
Iterating global reduction 2 with 480 rules applied. Total rules applied 1785 place count 1248 transition count 1174
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 733 places in 0 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2197 place count 1248 transition count 1126
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 2 with 266 rule applications. Total rules 2463 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 266 rules applied. Total rules applied 2729 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2729 rules in 457 ms. Remains 982 /1728 variables (removed 746) and now considering 860/1678 (removed 818) transitions.
[2024-05-31 22:47:03] [INFO ] Redundant transitions in 8 ms returned []
Running 859 sub problems to find dead transitions.
// Phase 1: matrix 860 rows 982 cols
[2024-05-31 22:47:03] [INFO ] Computed 148 invariants in 18 ms
[2024-05-31 22:47:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/1842 variables, and 1 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/146 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/982 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 859/859 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 859 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/981 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 2 (OVERLAPS) 1/982 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-31 22:47:51] [INFO ] Deduced a trap composed of 2 places in 371 ms of which 6 ms to minimize.
[2024-05-31 22:47:51] [INFO ] Deduced a trap composed of 2 places in 333 ms of which 8 ms to minimize.
[2024-05-31 22:47:51] [INFO ] Deduced a trap composed of 2 places in 299 ms of which 5 ms to minimize.
[2024-05-31 22:47:52] [INFO ] Deduced a trap composed of 2 places in 331 ms of which 5 ms to minimize.
[2024-05-31 22:47:52] [INFO ] Deduced a trap composed of 2 places in 349 ms of which 6 ms to minimize.
[2024-05-31 22:47:52] [INFO ] Deduced a trap composed of 2 places in 322 ms of which 5 ms to minimize.
[2024-05-31 22:47:53] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 5 ms to minimize.
[2024-05-31 22:47:53] [INFO ] Deduced a trap composed of 2 places in 307 ms of which 5 ms to minimize.
[2024-05-31 22:47:53] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 5 ms to minimize.
[2024-05-31 22:47:54] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 5 ms to minimize.
[2024-05-31 22:47:54] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 6 ms to minimize.
[2024-05-31 22:47:54] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 4 ms to minimize.
[2024-05-31 22:47:55] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 4 ms to minimize.
[2024-05-31 22:47:55] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 5 ms to minimize.
[2024-05-31 22:47:55] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 4 ms to minimize.
[2024-05-31 22:47:55] [INFO ] Deduced a trap composed of 2 places in 288 ms of which 6 ms to minimize.
[2024-05-31 22:47:56] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 4 ms to minimize.
[2024-05-31 22:47:56] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 4 ms to minimize.
[2024-05-31 22:47:56] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 4 ms to minimize.
[2024-05-31 22:47:56] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 4 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD754 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 20/168 constraints. Problems are: Problem set: 146 solved, 713 unsolved
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:47:57] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 3 places in 445 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD753 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 20/188 constraints. Problems are: Problem set: 180 solved, 679 unsolved
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 20/208 constraints. Problems are: Problem set: 220 solved, 639 unsolved
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-31 22:48:01] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 4 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-31 22:48:02] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 3 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 4 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-31 22:48:03] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 20/228 constraints. Problems are: Problem set: 240 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/1842 variables, and 228 constraints, problems are : Problem set: 240 solved, 619 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 146/146 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/982 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/859 constraints, Known Traps: 80/80 constraints]
After SMT, in 60839ms problems are : Problem set: 240 solved, 619 unsolved
Search for dead transitions found 240 dead transitions in 60850ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 982/1728 places, 620/1678 transitions.
Graph (complete) has 1976 edges and 982 vertex of which 742 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.1 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 227 places in 1 ms
Applied a total of 1 rules in 22 ms. Remains 742 /982 variables (removed 240) and now considering 620/620 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 742/1728 places, 620/1678 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61347 ms. Remains : 742/1728 places, 620/1678 transitions.
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 101 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:48:04] [INFO ] Computed 148 invariants in 6 ms
[2024-05-31 22:48:05] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-31 22:48:05] [INFO ] Invariant cache hit.
[2024-05-31 22:48:08] [INFO ] Implicit Places using invariants and state equation in 3297 ms returned []
Implicit Place search using SMT with State Equation took 4260 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:48:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Finished structural reductions in LTL mode , in 1 iterations and 64849 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-07 finished in 304797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(p1))))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 516 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-31 22:49:09] [INFO ] Computed 148 invariants in 6 ms
[2024-05-31 22:49:10] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-31 22:49:10] [INFO ] Invariant cache hit.
[2024-05-31 22:49:13] [INFO ] Implicit Places using invariants and state equation in 3148 ms returned []
Implicit Place search using SMT with State Equation took 4012 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:49:13] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65026 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-08
Product exploration explored 100000 steps with 138 reset in 363 ms.
Product exploration explored 100000 steps with 141 reset in 417 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1725 stabilizing places and 414/1675 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 2178 steps (0 resets) in 10 ms. (198 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 157 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 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1725 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 1724 transition count 1050
Reduce places removed 624 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 693 rules applied. Total rules applied 1317 place count 1100 transition count 981
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 1363 place count 1054 transition count 981
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1363 place count 1054 transition count 781
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1763 place count 854 transition count 781
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2439 place count 516 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2441 place count 515 transition count 395
Applied a total of 2441 rules in 146 ms. Remains 515 /1725 variables (removed 1210) and now considering 395/1675 (removed 1280) transitions.
// Phase 1: matrix 395 rows 515 cols
[2024-05-31 22:50:15] [INFO ] Computed 148 invariants in 1 ms
[2024-05-31 22:50:16] [INFO ] Implicit Places using invariants in 909 ms returned [171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 295, 369, 375, 381, 387, 393, 399, 405, 411, 417, 423, 429, 435, 441, 447, 453, 459, 465, 471, 477, 483, 489, 495, 501, 507, 514]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 911 ms to find 74 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 441/1725 places, 395/1675 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 441 transition count 348
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 394 transition count 348
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 119 place count 369 transition count 323
Iterating global reduction 2 with 25 rules applied. Total rules applied 144 place count 369 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 368 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 368 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 367 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 367 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 366 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 366 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 365 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 365 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 364 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 364 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 363 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 363 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 362 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 362 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 361 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 361 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 360 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 360 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 359 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 359 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 358 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 358 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 357 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 357 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 356 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 356 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 355 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 355 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 354 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 354 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 353 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 353 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 352 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 352 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 351 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 351 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 350 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 350 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 349 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 349 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 348 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 348 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 347 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 347 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 346 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 346 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 345 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 345 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 344 transition count 298
Applied a total of 194 rules in 140 ms. Remains 344 /441 variables (removed 97) and now considering 298/395 (removed 97) transitions.
// Phase 1: matrix 298 rows 344 cols
[2024-05-31 22:50:16] [INFO ] Computed 74 invariants in 6 ms
[2024-05-31 22:50:17] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-31 22:50:17] [INFO ] Invariant cache hit.
[2024-05-31 22:50:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:50:18] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 344/1725 places, 298/1675 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2776 ms. Remains : 344/1725 places, 298/1675 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 96 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1874 reset in 518 ms.
Stack based approach found an accepted trace after 24486 steps with 454 reset with depth 50 and stack size 50 in 142 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-08 finished in 70609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((((p1||G(p2)) U p3)&&p0)))))'
Support contains 6 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Applied a total of 49 rules in 532 ms. Remains 1726 /1750 variables (removed 24) and now considering 1676/1701 (removed 25) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2024-05-31 22:50:20] [INFO ] Computed 148 invariants in 13 ms
[2024-05-31 22:50:20] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-31 22:50:20] [INFO ] Invariant cache hit.
[2024-05-31 22:50:24] [INFO ] Implicit Places using invariants and state equation in 3189 ms returned []
Implicit Place search using SMT with State Equation took 4133 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-31 22:50:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 0/1675 constraints, Known Traps: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Starting structural reductions in LTL mode, iteration 1 : 1726/1750 places, 1676/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65152 ms. Remains : 1726/1750 places, 1676/1701 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-09 finished in 65463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||F(G((G(p2) U p3)))))))'
Support contains 5 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1736 transition count 1687
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1736 transition count 1687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1736 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1731 transition count 1681
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1731 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1730 transition count 1680
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1729 transition count 1679
Applied a total of 43 rules in 521 ms. Remains 1729 /1750 variables (removed 21) and now considering 1679/1701 (removed 22) transitions.
// Phase 1: matrix 1679 rows 1729 cols
[2024-05-31 22:51:25] [INFO ] Computed 148 invariants in 9 ms
[2024-05-31 22:51:26] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-31 22:51:26] [INFO ] Invariant cache hit.
[2024-05-31 22:51:29] [INFO ] Implicit Places using invariants and state equation in 3376 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
Running 1678 sub problems to find dead transitions.
[2024-05-31 22:51:29] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1728/3408 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1729 constraints, PredecessorRefiner: 1678/1678 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1678 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/3408 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1729 constraints, PredecessorRefiner: 0/1678 constraints, Known Traps: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1678 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Starting structural reductions in LTL mode, iteration 1 : 1729/1750 places, 1679/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65167 ms. Remains : 1729/1750 places, 1679/1701 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-10
Product exploration explored 100000 steps with 93 reset in 735 ms.
Product exploration explored 100000 steps with 93 reset in 851 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1729 stabilizing places and 418/1679 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3) p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p2)), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 120 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (36 resets) in 237 ms. (168 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2024-05-31 22:52:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1427/1606 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 69 places in 424 ms of which 7 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1606 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1729 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 29 places in 752 ms of which 10 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 19 places in 750 ms of which 10 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 27 places in 716 ms of which 9 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 47 places in 734 ms of which 12 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 41 places in 728 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1729/3408 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1729 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1427/1606 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1606 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1729 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 21 places in 769 ms of which 11 ms to minimize.
[2024-05-31 22:52:39] [INFO ] Deduced a trap composed of 25 places in 724 ms of which 9 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 33 places in 734 ms of which 9 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 35 places in 754 ms of which 10 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 49 places in 726 ms of which 9 ms to minimize.
[2024-05-31 22:52:42] [INFO ] Deduced a trap composed of 43 places in 698 ms of which 9 ms to minimize.
SMT process timed out in 10097ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1729/1729 places, 1679/1679 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1729 transition count 1056
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 695 rules applied. Total rules applied 1318 place count 1106 transition count 984
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1058 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1057 transition count 983
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1368 place count 1057 transition count 784
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 place count 858 transition count 784
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1767 place count 857 transition count 783
Iterating global reduction 4 with 1 rules applied. Total rules applied 1768 place count 857 transition count 783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1768 place count 857 transition count 782
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1770 place count 856 transition count 782
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 4 with 682 rules applied. Total rules applied 2452 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2547 place count 515 transition count 298
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2642 place count 420 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2643 place count 419 transition count 297
Reduce places removed 118 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 320 rules applied. Total rules applied 2963 place count 301 transition count 95
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 3165 place count 99 transition count 95
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3165 place count 99 transition count 63
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 3229 place count 67 transition count 63
Applied a total of 3229 rules in 182 ms. Remains 67 /1729 variables (removed 1662) and now considering 63/1679 (removed 1616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 67/1729 places, 63/1679 transitions.
RANDOM walk for 17941 steps (261 resets) in 129 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3) p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p2)), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F p3)]
Knowledge based reduction with 19 factoid took 356 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
[2024-05-31 22:52:43] [INFO ] Invariant cache hit.
[2024-05-31 22:52:44] [INFO ] [Real]Absence check using 147 positive place invariants in 180 ms returned sat
[2024-05-31 22:52:45] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 40 ms returned sat
[2024-05-31 22:52:53] [INFO ] [Real]Absence check using state equation in 8641 ms returned sat
[2024-05-31 22:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:52:55] [INFO ] [Nat]Absence check using 147 positive place invariants in 176 ms returned sat
[2024-05-31 22:52:55] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-31 22:53:08] [INFO ] [Nat]Absence check using state equation in 13479 ms returned unknown
Could not prove EG (NOT p3)
Support contains 3 out of 1729 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 : 1729/1729 places, 1679/1679 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 620 transitions
Trivial Post-agglo rules discarded 620 transitions
Performed 620 trivial Post agglomeration. Transition count delta: 620
Iterating post reduction 0 with 620 rules applied. Total rules applied 620 place count 1728 transition count 1058
Reduce places removed 620 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 692 rules applied. Total rules applied 1312 place count 1108 transition count 986
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1362 place count 1060 transition count 984
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1364 place count 1058 transition count 984
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1364 place count 1058 transition count 785
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1762 place count 859 transition count 785
Performed 342 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 4 with 684 rules applied. Total rules applied 2446 place count 517 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2447 place count 516 transition count 394
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2519 place count 468 transition count 370
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2543 place count 444 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2543 place count 444 transition count 346
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2591 place count 420 transition count 346
Applied a total of 2591 rules in 133 ms. Remains 420 /1729 variables (removed 1309) and now considering 346/1679 (removed 1333) transitions.
// Phase 1: matrix 346 rows 420 cols
[2024-05-31 22:53:08] [INFO ] Computed 100 invariants in 5 ms
[2024-05-31 22:53:09] [INFO ] Implicit Places using invariants in 485 ms returned [173, 247, 321, 325, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 503 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/1729 places, 346/1679 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 368 transition count 321
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 367 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 344 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 343 transition count 296
Applied a total of 100 rules in 147 ms. Remains 343 /393 variables (removed 50) and now considering 296/346 (removed 50) transitions.
// Phase 1: matrix 296 rows 343 cols
[2024-05-31 22:53:09] [INFO ] Computed 73 invariants in 1 ms
[2024-05-31 22:53:09] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-31 22:53:09] [INFO ] Invariant cache hit.
[2024-05-31 22:53:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:53:10] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 343/1729 places, 296/1679 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1684 ms. Remains : 343/1729 places, 296/1679 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/343 stabilizing places and 2/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (OR p2 p3)), (X (NOT (OR p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3))))]
Knowledge based reduction with 8 factoid took 692 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 20734 steps (248 resets) in 303 ms. (68 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (OR p2 p3)), (X (NOT (OR p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F p3)]
Knowledge based reduction with 8 factoid took 1018 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
[2024-05-31 22:53:12] [INFO ] Invariant cache hit.
[2024-05-31 22:53:12] [INFO ] [Real]Absence check using 73 positive place invariants in 25 ms returned sat
[2024-05-31 22:53:14] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2024-05-31 22:53:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:53:14] [INFO ] [Nat]Absence check using 73 positive place invariants in 24 ms returned sat
[2024-05-31 22:53:15] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2024-05-31 22:53:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:53:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:53:15] [INFO ] Computed and/alt/rep : 176/282/176 causal constraints (skipped 0 transitions) in 64 ms.
[2024-05-31 22:53:17] [INFO ] Added : 128 causal constraints over 26 iterations in 1782 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 156 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering criterion allowed to conclude after 4151 steps with 49 reset in 24 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-10 finished in 112317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 632 place count 1749 transition count 1068
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 705 rules applied. Total rules applied 1337 place count 1117 transition count 995
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1386 place count 1069 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1387 place count 1068 transition count 994
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 1387 place count 1068 transition count 792
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1791 place count 866 transition count 792
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1800 place count 857 transition count 783
Iterating global reduction 4 with 9 rules applied. Total rules applied 1809 place count 857 transition count 783
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1809 place count 857 transition count 778
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1819 place count 852 transition count 778
Performed 337 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 4 with 674 rules applied. Total rules applied 2493 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2494 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2562 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2584 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2584 place count 446 transition count 346
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2632 place count 422 transition count 346
Applied a total of 2632 rules in 178 ms. Remains 422 /1750 variables (removed 1328) and now considering 346/1701 (removed 1355) transitions.
// Phase 1: matrix 346 rows 422 cols
[2024-05-31 22:53:17] [INFO ] Computed 102 invariants in 2 ms
[2024-05-31 22:53:17] [INFO ] Implicit Places using invariants in 382 ms returned [172, 246, 320, 324, 328, 332, 336, 340, 345, 349, 354, 358, 362, 366, 370, 374, 378, 382, 386, 396, 400, 404, 408, 412, 416, 421]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 393 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/1750 places, 346/1701 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 372 transition count 322
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 351 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 350 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 350 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 349 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 349 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 348 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 348 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 346 transition count 296
Applied a total of 100 rules in 133 ms. Remains 346 /396 variables (removed 50) and now considering 296/346 (removed 50) transitions.
// Phase 1: matrix 296 rows 346 cols
[2024-05-31 22:53:17] [INFO ] Computed 76 invariants in 1 ms
[2024-05-31 22:53:18] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 22:53:18] [INFO ] Invariant cache hit.
[2024-05-31 22:53:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:53:18] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1750 places, 296/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1680 ms. Remains : 346/1750 places, 296/1701 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-12
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-12 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((F(p2)&&p1)))))'
Support contains 3 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1734 transition count 1685
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1724 transition count 1674
Applied a total of 53 rules in 530 ms. Remains 1724 /1750 variables (removed 26) and now considering 1674/1701 (removed 27) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-31 22:53:19] [INFO ] Computed 148 invariants in 7 ms
[2024-05-31 22:53:20] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-31 22:53:20] [INFO ] Invariant cache hit.
[2024-05-31 22:53:23] [INFO ] Implicit Places using invariants and state equation in 3249 ms returned []
Implicit Place search using SMT with State Equation took 4072 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-31 22:53:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1750 places, 1674/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65094 ms. Remains : 1724/1750 places, 1674/1701 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-13
Product exploration explored 100000 steps with 25075 reset in 411 ms.
Product exploration explored 100000 steps with 25026 reset in 460 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 149 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p2), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (36 resets) in 3107 ms. (12 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
[2024-05-31 22:54:26] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 362/365 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1601 variables, 143/147 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1601 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 5 (OVERLAPS) 123/1724 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1724 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1674/3398 variables, 1724/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3398 variables, 0/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3398 variables, 0/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3398/3398 variables, and 1872 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1724/1724 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 362/365 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1601 variables, 143/147 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:54:28] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1601 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1601 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 123/1724 variables, 1/149 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 21 places in 674 ms of which 9 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 19 places in 599 ms of which 8 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 37 places in 546 ms of which 8 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 27 places in 653 ms of which 9 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 9 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 17 places in 627 ms of which 8 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 25 places in 542 ms of which 8 ms to minimize.
SMT process timed out in 6678ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1724 transition count 1048
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1324 place count 1098 transition count 976
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1372 place count 1050 transition count 976
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 1372 place count 1050 transition count 779
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 1766 place count 853 transition count 779
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2442 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2538 place count 515 transition count 297
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2634 place count 419 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2635 place count 418 transition count 296
Reduce places removed 120 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 4 with 333 rules applied. Total rules applied 2968 place count 298 transition count 83
Reduce places removed 213 places and 0 transitions.
Iterating post reduction 5 with 213 rules applied. Total rules applied 3181 place count 85 transition count 83
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 3181 place count 85 transition count 57
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 3233 place count 59 transition count 57
Applied a total of 3233 rules in 143 ms. Remains 59 /1724 variables (removed 1665) and now considering 57/1674 (removed 1617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 59/1724 places, 57/1674 transitions.
RANDOM walk for 414 steps (0 resets) in 10 ms. (37 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p2), (F p1), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 19 factoid took 172 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-13 finished in 74928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)&&p0))||G(p2)))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 527 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-31 22:54:34] [INFO ] Computed 148 invariants in 6 ms
[2024-05-31 22:54:35] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-31 22:54:35] [INFO ] Invariant cache hit.
[2024-05-31 22:54:38] [INFO ] Implicit Places using invariants and state equation in 2913 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:54:38] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64670 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-14
Product exploration explored 100000 steps with 93 reset in 358 ms.
Product exploration explored 100000 steps with 93 reset in 423 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Detected a total of 415/1725 stabilizing places and 415/1675 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 231 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (36 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 263778 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263778 steps, saw 159037 distinct states, run finished after 3012 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-31 22:55:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 356/357 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1602 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1675/3400 variables, 1725/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3400/3400 variables, and 1873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1725/1725 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 356/357 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1602 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:55:45] [INFO ] Deduced a trap composed of 15 places in 596 ms of which 8 ms to minimize.
[2024-05-31 22:55:46] [INFO ] Deduced a trap composed of 35 places in 574 ms of which 11 ms to minimize.
[2024-05-31 22:55:46] [INFO ] Deduced a trap composed of 19 places in 536 ms of which 8 ms to minimize.
[2024-05-31 22:55:47] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 7 ms to minimize.
[2024-05-31 22:55:47] [INFO ] Deduced a trap composed of 41 places in 496 ms of which 7 ms to minimize.
[2024-05-31 22:55:48] [INFO ] Deduced a trap composed of 51 places in 406 ms of which 6 ms to minimize.
[2024-05-31 22:55:48] [INFO ] Deduced a trap composed of 39 places in 481 ms of which 7 ms to minimize.
[2024-05-31 22:55:49] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 6 ms to minimize.
[2024-05-31 22:55:49] [INFO ] Deduced a trap composed of 72 places in 439 ms of which 6 ms to minimize.
SMT process timed out in 6331ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1725 transition count 1048
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1326 place count 1098 transition count 976
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1050 transition count 976
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1374 place count 1050 transition count 778
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1770 place count 852 transition count 778
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2450 place count 512 transition count 390
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2546 place count 512 transition count 294
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2642 place count 416 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2643 place count 415 transition count 293
Reduce places removed 120 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 4 with 334 rules applied. Total rules applied 2977 place count 295 transition count 79
Reduce places removed 214 places and 0 transitions.
Iterating post reduction 5 with 214 rules applied. Total rules applied 3191 place count 81 transition count 79
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 3191 place count 81 transition count 53
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 3243 place count 55 transition count 53
Applied a total of 3243 rules in 130 ms. Remains 55 /1725 variables (removed 1670) and now considering 53/1675 (removed 1622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 55/1725 places, 53/1675 transitions.
RANDOM walk for 172 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 14 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-14 finished in 75964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 537 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-31 22:55:50] [INFO ] Computed 148 invariants in 6 ms
[2024-05-31 22:55:51] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-31 22:55:51] [INFO ] Invariant cache hit.
[2024-05-31 22:55:54] [INFO ] Implicit Places using invariants and state equation in 3252 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:55:54] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65096 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-15 finished in 65287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||(p2&&(p1 U (G(p1)||(p1&&G((p3&&F(p4)))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-24b-LTLFireability-06
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 634 rules applied. Total rules applied 634 place count 1749 transition count 1066
Reduce places removed 634 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 707 rules applied. Total rules applied 1341 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1390 place count 1067 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1391 place count 1066 transition count 992
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1391 place count 1066 transition count 791
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1793 place count 865 transition count 791
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1802 place count 856 transition count 782
Iterating global reduction 4 with 9 rules applied. Total rules applied 1811 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1811 place count 856 transition count 777
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1821 place count 851 transition count 777
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2493 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2494 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2562 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2584 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2584 place count 446 transition count 346
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2632 place count 422 transition count 346
Applied a total of 2632 rules in 197 ms. Remains 422 /1750 variables (removed 1328) and now considering 346/1701 (removed 1355) transitions.
// Phase 1: matrix 346 rows 422 cols
[2024-05-31 22:56:56] [INFO ] Computed 102 invariants in 2 ms
[2024-05-31 22:56:56] [INFO ] Implicit Places using invariants in 403 ms returned [330, 334, 338, 342, 347, 351, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 412, 416, 421]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 416 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 399/1750 places, 346/1701 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 378 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 378 transition count 325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 373 transition count 320
Applied a total of 52 rules in 33 ms. Remains 373 /399 variables (removed 26) and now considering 320/346 (removed 26) transitions.
// Phase 1: matrix 320 rows 373 cols
[2024-05-31 22:56:56] [INFO ] Computed 79 invariants in 1 ms
[2024-05-31 22:56:56] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 22:56:56] [INFO ] Invariant cache hit.
[2024-05-31 22:56:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:56:57] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 373/1750 places, 320/1701 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1624 ms. Remains : 373/1750 places, 320/1701 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06
Product exploration explored 100000 steps with 2311 reset in 631 ms.
Product exploration explored 100000 steps with 2235 reset in 697 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/373 stabilizing places and 4/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 77 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:56:59] [INFO ] Invariant cache hit.
[2024-05-31 22:56:59] [INFO ] [Real]Absence check using 79 positive place invariants in 57 ms returned sat
[2024-05-31 22:57:00] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-05-31 22:57:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:00] [INFO ] [Nat]Absence check using 79 positive place invariants in 39 ms returned sat
[2024-05-31 22:57:00] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-31 22:57:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:57:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:57:01] [INFO ] Computed and/alt/rep : 201/305/201 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-31 22:57:01] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 320/320 transitions.
Applied a total of 0 rules in 5 ms. Remains 373 /373 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-31 22:57:01] [INFO ] Invariant cache hit.
[2024-05-31 22:57:01] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 22:57:01] [INFO ] Invariant cache hit.
[2024-05-31 22:57:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:57:02] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-31 22:57:02] [INFO ] Invariant cache hit.
[2024-05-31 22:57:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 22:57:04] [INFO ] Deduced a trap composed of 194 places in 145 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 455 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16728 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 201/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 656 constraints, problems are : Problem set: 0 solved, 201 unsolved in 26740 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 43507ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 43510ms
Finished structural reductions in LTL mode , in 1 iterations and 44583 ms. Remains : 373/373 places, 320/320 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/373 stabilizing places and 4/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 139 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:57:46] [INFO ] Invariant cache hit.
[2024-05-31 22:57:46] [INFO ] [Real]Absence check using 79 positive place invariants in 62 ms returned sat
[2024-05-31 22:57:47] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2024-05-31 22:57:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:47] [INFO ] [Nat]Absence check using 79 positive place invariants in 38 ms returned sat
[2024-05-31 22:57:47] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-05-31 22:57:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:57:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:57:47] [INFO ] Computed and/alt/rep : 201/305/201 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-31 22:57:47] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2294 reset in 631 ms.
Stack based approach found an accepted trace after 24623 steps with 568 reset with depth 13 and stack size 13 in 179 ms.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 53372 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
[2024-05-31 22:57:49] [INFO ] Flatten gal took : 83 ms
[2024-05-31 22:57:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 22:57:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1750 places, 1701 transitions and 4132 arcs took 17 ms.
Total runtime 1637177 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
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="AutoFlight-PT-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-24b, 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 r468-smll-171620167200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b 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 ;