About the Execution of LTSMin+red for AutonomousCar-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14437.504 | 1668683.00 | 4538167.00 | 2007.70 | FFFFFTFFTFFFTFFT | 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-171620167500340.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 AutonomousCar-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 517K 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 AutonomousCar-PT-08b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717218851840
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:14:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:14:14] [INFO ] Load time of PNML (sax parser for PT used): 393 ms
[2024-06-01 05:14:15] [INFO ] Transformed 357 places.
[2024-06-01 05:14:15] [INFO ] Transformed 1128 transitions.
[2024-06-01 05:14:15] [INFO ] Found NUPN structural information;
[2024-06-01 05:14:15] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Support contains 52 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 308 transition count 1079
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 308 transition count 1079
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 297 transition count 1068
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 297 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 296 transition count 1067
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 296 transition count 1067
Applied a total of 122 rules in 217 ms. Remains 296 /357 variables (removed 61) and now considering 1067/1128 (removed 61) transitions.
// Phase 1: matrix 1067 rows 296 cols
[2024-06-01 05:14:15] [INFO ] Computed 13 invariants in 62 ms
[2024-06-01 05:14:16] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 05:14:16] [INFO ] Invariant cache hit.
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Running 1066 sub problems to find dead transitions.
[2024-06-01 05:14:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
[2024-06-01 05:14:55] [INFO ] Deduced a trap composed of 21 places in 894 ms of which 64 ms to minimize.
[2024-06-01 05:14:56] [INFO ] Deduced a trap composed of 14 places in 936 ms of which 7 ms to minimize.
[2024-06-01 05:14:56] [INFO ] Deduced a trap composed of 56 places in 620 ms of which 7 ms to minimize.
[2024-06-01 05:14:57] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 2 ms to minimize.
[2024-06-01 05:14:58] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 4 ms to minimize.
[2024-06-01 05:14:58] [INFO ] Deduced a trap composed of 38 places in 598 ms of which 5 ms to minimize.
[2024-06-01 05:14:59] [INFO ] Deduced a trap composed of 40 places in 564 ms of which 5 ms to minimize.
[2024-06-01 05:15:00] [INFO ] Deduced a trap composed of 39 places in 744 ms of which 4 ms to minimize.
[2024-06-01 05:15:00] [INFO ] Deduced a trap composed of 41 places in 657 ms of which 3 ms to minimize.
[2024-06-01 05:15:01] [INFO ] Deduced a trap composed of 43 places in 482 ms of which 3 ms to minimize.
[2024-06-01 05:15:01] [INFO ] Deduced a trap composed of 42 places in 443 ms of which 2 ms to minimize.
SMT process timed out in 44618ms, After SMT, problems are : Problem set: 0 solved, 1066 unsolved
Search for dead transitions found 0 dead transitions in 44687ms
Starting structural reductions in LTL mode, iteration 1 : 296/357 places, 1067/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46427 ms. Remains : 296/357 places, 1067/1128 transitions.
Support contains 52 out of 296 places after structural reductions.
[2024-06-01 05:15:02] [INFO ] Flatten gal took : 262 ms
[2024-06-01 05:15:02] [INFO ] Flatten gal took : 157 ms
[2024-06-01 05:15:02] [INFO ] Input system was already deterministic with 1067 transitions.
Support contains 50 out of 296 places (down from 52) after GAL structural reductions.
RANDOM walk for 40000 steps (337 resets) in 3212 ms. (12 steps per ms) remains 17/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2024-06-01 05:15:04] [INFO ] Invariant cache hit.
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 230/264 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 32/296 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1067/1363 variables, 296/309 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/1363 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1363/1363 variables, and 309 constraints, problems are : Problem set: 1 solved, 16 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 231/264 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 32/296 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-01 05:15:07] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 3 ms to minimize.
[2024-06-01 05:15:07] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 2 ms to minimize.
[2024-06-01 05:15:07] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1067/1363 variables, 296/312 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 16/328 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-01 05:15:11] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 3 ms to minimize.
[2024-06-01 05:15:11] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 3 ms to minimize.
SMT process timed out in 7422ms, After SMT, problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 235 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1365 edges and 294 vertex of which 292 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 292 transition count 958
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 152 rules applied. Total rules applied 259 place count 189 transition count 909
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 288 place count 160 transition count 909
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 288 place count 160 transition count 902
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 302 place count 153 transition count 902
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 304 place count 151 transition count 900
Iterating global reduction 3 with 2 rules applied. Total rules applied 306 place count 151 transition count 900
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 562 place count 151 transition count 644
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 656 place count 104 transition count 597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 657 place count 104 transition count 596
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 664 place count 97 transition count 547
Iterating global reduction 5 with 7 rules applied. Total rules applied 671 place count 97 transition count 547
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 677 place count 97 transition count 541
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 679 place count 96 transition count 540
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 697 place count 96 transition count 522
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 715 place count 78 transition count 522
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 721 place count 78 transition count 522
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 722 place count 77 transition count 521
Applied a total of 722 rules in 308 ms. Remains 77 /296 variables (removed 219) and now considering 521/1067 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 77/296 places, 521/1067 transitions.
RANDOM walk for 40000 steps (666 resets) in 797 ms. (50 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40004 steps (99 resets) in 121 ms. (327 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (109 resets) in 99 ms. (400 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (101 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 113 ms. (350 steps per ms) remains 1/3 properties
// Phase 1: matrix 521 rows 77 cols
[2024-06-01 05:15:12] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:15:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 479/505 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/598 variables, 51/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:15:12] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2024-06-01 05:15:13] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2024-06-01 05:15:13] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/598 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 479/505 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/598 variables, 51/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/598 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 521/521 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 520
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 520
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 74 transition count 504
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 74 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 74 transition count 502
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 65 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 63 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 63 transition count 475
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 46 place count 55 transition count 467
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 55 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 53 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 52 transition count 464
Applied a total of 51 rules in 134 ms. Remains 52 /77 variables (removed 25) and now considering 464/521 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 52/77 places, 464/521 transitions.
RANDOM walk for 36261 steps (196 resets) in 507 ms. (71 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-08b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 45 stabilizing places and 46 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' '!((X(p0)&&(F(p1)||X(G(p2)))))'
Support contains 7 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 1063
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 1063
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 264 place count 292 transition count 807
Applied a total of 264 rules in 21 ms. Remains 292 /296 variables (removed 4) and now considering 807/1067 (removed 260) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:15:15] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 05:15:15] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 05:15:15] [INFO ] Invariant cache hit.
[2024-06-01 05:15:16] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:15:32] [INFO ] Deduced a trap composed of 17 places in 527 ms of which 4 ms to minimize.
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 64 places in 1067 ms of which 3 ms to minimize.
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:15:34] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 3 ms to minimize.
[2024-06-01 05:15:34] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:15:35] [INFO ] Deduced a trap composed of 81 places in 420 ms of which 3 ms to minimize.
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 3 ms to minimize.
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 3 ms to minimize.
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:15:37] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 3 ms to minimize.
[2024-06-01 05:15:37] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 3 ms to minimize.
[2024-06-01 05:15:38] [INFO ] Deduced a trap composed of 43 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:15:38] [INFO ] Deduced a trap composed of 42 places in 405 ms of which 2 ms to minimize.
[2024-06-01 05:15:39] [INFO ] Deduced a trap composed of 44 places in 404 ms of which 3 ms to minimize.
[2024-06-01 05:15:39] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:15:39] [INFO ] Deduced a trap composed of 47 places in 431 ms of which 5 ms to minimize.
[2024-06-01 05:15:40] [INFO ] Deduced a trap composed of 51 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:15:40] [INFO ] Deduced a trap composed of 51 places in 421 ms of which 3 ms to minimize.
[2024-06-01 05:15:40] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-06-01 05:15:41] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:15:42] [INFO ] Deduced a trap composed of 18 places in 428 ms of which 4 ms to minimize.
[2024-06-01 05:15:42] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 3 ms to minimize.
[2024-06-01 05:15:43] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 3 ms to minimize.
[2024-06-01 05:15:43] [INFO ] Deduced a trap composed of 47 places in 402 ms of which 3 ms to minimize.
[2024-06-01 05:15:43] [INFO ] Deduced a trap composed of 43 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:15:44] [INFO ] Deduced a trap composed of 47 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:15:44] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 3 ms to minimize.
[2024-06-01 05:15:45] [INFO ] Deduced a trap composed of 41 places in 368 ms of which 2 ms to minimize.
[2024-06-01 05:15:45] [INFO ] Deduced a trap composed of 40 places in 387 ms of which 3 ms to minimize.
[2024-06-01 05:15:46] [INFO ] Deduced a trap composed of 42 places in 974 ms of which 3 ms to minimize.
[2024-06-01 05:15:47] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:15:47] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 3 ms to minimize.
[2024-06-01 05:15:47] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:15:48] [INFO ] Deduced a trap composed of 48 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:15:48] [INFO ] Deduced a trap composed of 47 places in 385 ms of which 3 ms to minimize.
[2024-06-01 05:15:48] [INFO ] Deduced a trap composed of 47 places in 379 ms of which 3 ms to minimize.
[2024-06-01 05:15:49] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 3 ms to minimize.
[2024-06-01 05:15:49] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 7 ms to minimize.
[2024-06-01 05:15:50] [INFO ] Deduced a trap composed of 32 places in 468 ms of which 4 ms to minimize.
[2024-06-01 05:15:51] [INFO ] Deduced a trap composed of 32 places in 384 ms of which 3 ms to minimize.
SMT process timed out in 35419ms, After SMT, problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 35431ms
Starting structural reductions in LTL mode, iteration 1 : 292/296 places, 807/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36397 ms. Remains : 292/296 places, 807/1067 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-00 finished in 36855 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)&&G(X((G(X(p1)) U p2))))))'
Support contains 12 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 256 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 293 transition count 957
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 152 rules applied. Total rules applied 260 place count 186 transition count 912
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 288 place count 159 transition count 911
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 291 place count 158 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 292 place count 157 transition count 909
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 292 place count 157 transition count 903
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 304 place count 151 transition count 903
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 307 place count 148 transition count 900
Iterating global reduction 5 with 3 rules applied. Total rules applied 310 place count 148 transition count 900
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 566 place count 148 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 566 place count 148 transition count 643
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 568 place count 147 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 569 place count 146 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 570 place count 146 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 572 place count 146 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 573 place count 145 transition count 633
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 8 with 108 rules applied. Total rules applied 681 place count 91 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 682 place count 91 transition count 577
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 691 place count 82 transition count 511
Iterating global reduction 9 with 9 rules applied. Total rules applied 700 place count 82 transition count 511
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 707 place count 82 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 711 place count 80 transition count 502
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 713 place count 78 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 714 place count 77 transition count 500
Applied a total of 714 rules in 301 ms. Remains 77 /296 variables (removed 219) and now considering 500/1067 (removed 567) transitions.
// Phase 1: matrix 500 rows 77 cols
[2024-06-01 05:15:52] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 05:15:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 05:15:52] [INFO ] Invariant cache hit.
[2024-06-01 05:15:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:15:52] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [72, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 433 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/296 places, 500/1067 transitions.
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 2 place count 74 transition count 499
Applied a total of 2 rules in 29 ms. Remains 74 /75 variables (removed 1) and now considering 499/500 (removed 1) transitions.
// Phase 1: matrix 499 rows 74 cols
[2024-06-01 05:15:52] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 05:15:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 05:15:52] [INFO ] Invariant cache hit.
[2024-06-01 05:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:15:53] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/296 places, 499/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1161 ms. Remains : 74/296 places, 499/1067 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-01
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-01 finished in 1612 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(G(p1)))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 1063
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 1063
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 264 place count 292 transition count 807
Applied a total of 264 rules in 31 ms. Remains 292 /296 variables (removed 4) and now considering 807/1067 (removed 260) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:15:53] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 05:15:53] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 05:15:53] [INFO ] Invariant cache hit.
[2024-06-01 05:15:54] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:15:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:16:10] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 3 ms to minimize.
[2024-06-01 05:16:10] [INFO ] Deduced a trap composed of 14 places in 508 ms of which 3 ms to minimize.
[2024-06-01 05:16:11] [INFO ] Deduced a trap composed of 62 places in 457 ms of which 3 ms to minimize.
[2024-06-01 05:16:11] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-06-01 05:16:11] [INFO ] Deduced a trap composed of 64 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:16:12] [INFO ] Deduced a trap composed of 67 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:16:12] [INFO ] Deduced a trap composed of 55 places in 414 ms of which 3 ms to minimize.
[2024-06-01 05:16:13] [INFO ] Deduced a trap composed of 81 places in 424 ms of which 2 ms to minimize.
[2024-06-01 05:16:13] [INFO ] Deduced a trap composed of 26 places in 489 ms of which 3 ms to minimize.
[2024-06-01 05:16:14] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:16:14] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-06-01 05:16:15] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 3 ms to minimize.
[2024-06-01 05:16:15] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:16:16] [INFO ] Deduced a trap composed of 45 places in 446 ms of which 3 ms to minimize.
[2024-06-01 05:16:16] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 3 ms to minimize.
[2024-06-01 05:16:17] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 3 ms to minimize.
[2024-06-01 05:16:17] [INFO ] Deduced a trap composed of 44 places in 462 ms of which 3 ms to minimize.
[2024-06-01 05:16:18] [INFO ] Deduced a trap composed of 54 places in 483 ms of which 3 ms to minimize.
[2024-06-01 05:16:18] [INFO ] Deduced a trap composed of 45 places in 468 ms of which 3 ms to minimize.
[2024-06-01 05:16:19] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:16:19] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2024-06-01 05:16:20] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 3 ms to minimize.
[2024-06-01 05:16:20] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:16:21] [INFO ] Deduced a trap composed of 23 places in 434 ms of which 3 ms to minimize.
[2024-06-01 05:16:21] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 3 ms to minimize.
[2024-06-01 05:16:22] [INFO ] Deduced a trap composed of 28 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:16:22] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 3 ms to minimize.
[2024-06-01 05:16:23] [INFO ] Deduced a trap composed of 39 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:16:23] [INFO ] Deduced a trap composed of 45 places in 443 ms of which 3 ms to minimize.
[2024-06-01 05:16:24] [INFO ] Deduced a trap composed of 51 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:16:24] [INFO ] Deduced a trap composed of 48 places in 450 ms of which 3 ms to minimize.
[2024-06-01 05:16:25] [INFO ] Deduced a trap composed of 47 places in 429 ms of which 2 ms to minimize.
[2024-06-01 05:16:25] [INFO ] Deduced a trap composed of 60 places in 403 ms of which 2 ms to minimize.
[2024-06-01 05:16:26] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:16:26] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 3 ms to minimize.
[2024-06-01 05:16:26] [INFO ] Deduced a trap composed of 32 places in 394 ms of which 2 ms to minimize.
[2024-06-01 05:16:27] [INFO ] Deduced a trap composed of 45 places in 358 ms of which 3 ms to minimize.
[2024-06-01 05:16:27] [INFO ] Deduced a trap composed of 46 places in 341 ms of which 2 ms to minimize.
[2024-06-01 05:16:28] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 2 ms to minimize.
[2024-06-01 05:16:28] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/1099 variables, and 53 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:16:35] [INFO ] Deduced a trap composed of 49 places in 364 ms of which 3 ms to minimize.
[2024-06-01 05:16:36] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 3 ms to minimize.
[2024-06-01 05:16:36] [INFO ] Deduced a trap composed of 48 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:16:37] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:16:38] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 3 ms to minimize.
[2024-06-01 05:16:39] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 3 ms to minimize.
[2024-06-01 05:16:39] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 3 ms to minimize.
[2024-06-01 05:16:40] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 3 ms to minimize.
[2024-06-01 05:16:41] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:16:41] [INFO ] Deduced a trap composed of 47 places in 448 ms of which 3 ms to minimize.
[2024-06-01 05:16:42] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 3 ms to minimize.
[2024-06-01 05:16:42] [INFO ] Deduced a trap composed of 41 places in 461 ms of which 3 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 42 places in 429 ms of which 2 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:16:44] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 3 ms to minimize.
[2024-06-01 05:16:44] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:16:45] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 3 ms to minimize.
[2024-06-01 05:16:45] [INFO ] Deduced a trap composed of 42 places in 405 ms of which 3 ms to minimize.
[2024-06-01 05:16:46] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 3 ms to minimize.
[2024-06-01 05:16:46] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:16:47] [INFO ] Deduced a trap composed of 44 places in 374 ms of which 2 ms to minimize.
[2024-06-01 05:16:48] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 3 ms to minimize.
[2024-06-01 05:16:49] [INFO ] Deduced a trap composed of 47 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:16:49] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 3 ms to minimize.
[2024-06-01 05:16:50] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:16:50] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:16:51] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:16:51] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 2 ms to minimize.
[2024-06-01 05:16:52] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 2 ms to minimize.
[2024-06-01 05:16:53] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 3 ms to minimize.
[2024-06-01 05:16:54] [INFO ] Deduced a trap composed of 32 places in 408 ms of which 2 ms to minimize.
[2024-06-01 05:16:54] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 2 ms to minimize.
[2024-06-01 05:16:54] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 2 ms to minimize.
[2024-06-01 05:16:54] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 2 ms to minimize.
[2024-06-01 05:16:55] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/1099 variables, and 88 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 75/75 constraints]
After SMT, in 65135ms problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 65145ms
Starting structural reductions in LTL mode, iteration 1 : 292/296 places, 807/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66007 ms. Remains : 292/296 places, 807/1067 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 418 steps with 3 reset in 8 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-02 finished in 66169 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(G(p0))))'
Support contains 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 24 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-06-01 05:16:59] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:17:00] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 05:17:00] [INFO ] Invariant cache hit.
[2024-06-01 05:17:00] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:17:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:17:17] [INFO ] Deduced a trap composed of 21 places in 503 ms of which 3 ms to minimize.
[2024-06-01 05:17:17] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 3 ms to minimize.
[2024-06-01 05:17:18] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 3 ms to minimize.
[2024-06-01 05:17:18] [INFO ] Deduced a trap composed of 39 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:17:18] [INFO ] Deduced a trap composed of 35 places in 417 ms of which 3 ms to minimize.
[2024-06-01 05:17:19] [INFO ] Deduced a trap composed of 41 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:17:19] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 3 ms to minimize.
[2024-06-01 05:17:20] [INFO ] Deduced a trap composed of 45 places in 396 ms of which 3 ms to minimize.
[2024-06-01 05:17:20] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 4 ms to minimize.
[2024-06-01 05:17:21] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 3 ms to minimize.
[2024-06-01 05:17:21] [INFO ] Deduced a trap composed of 53 places in 420 ms of which 3 ms to minimize.
[2024-06-01 05:17:21] [INFO ] Deduced a trap composed of 45 places in 393 ms of which 3 ms to minimize.
[2024-06-01 05:17:22] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 2 ms to minimize.
[2024-06-01 05:17:22] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:17:23] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 3 ms to minimize.
[2024-06-01 05:17:23] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 3 ms to minimize.
[2024-06-01 05:17:24] [INFO ] Deduced a trap composed of 43 places in 387 ms of which 3 ms to minimize.
[2024-06-01 05:17:24] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 2 ms to minimize.
[2024-06-01 05:17:24] [INFO ] Deduced a trap composed of 27 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:17:25] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:17:26] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 3 ms to minimize.
[2024-06-01 05:17:26] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 3 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 43 places in 418 ms of which 3 ms to minimize.
[2024-06-01 05:17:28] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 2 ms to minimize.
[2024-06-01 05:17:28] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:17:29] [INFO ] Deduced a trap composed of 24 places in 425 ms of which 2 ms to minimize.
[2024-06-01 05:17:30] [INFO ] Deduced a trap composed of 37 places in 444 ms of which 3 ms to minimize.
[2024-06-01 05:17:30] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-06-01 05:17:30] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 2 ms to minimize.
[2024-06-01 05:17:30] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 2 ms to minimize.
[2024-06-01 05:17:31] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 2 ms to minimize.
[2024-06-01 05:17:31] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 2 ms to minimize.
[2024-06-01 05:17:31] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 1 ms to minimize.
[2024-06-01 05:17:31] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 6 ms to minimize.
[2024-06-01 05:17:32] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 2 ms to minimize.
[2024-06-01 05:17:32] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 7 ms to minimize.
[2024-06-01 05:17:33] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 2 ms to minimize.
[2024-06-01 05:17:33] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:17:42] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 3 ms to minimize.
[2024-06-01 05:17:42] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:17:43] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:17:43] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 2 ms to minimize.
[2024-06-01 05:17:44] [INFO ] Deduced a trap composed of 63 places in 306 ms of which 3 ms to minimize.
[2024-06-01 05:17:44] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 3 ms to minimize.
[2024-06-01 05:17:44] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 3 ms to minimize.
[2024-06-01 05:17:45] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 3 ms to minimize.
[2024-06-01 05:17:45] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:17:46] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-06-01 05:17:46] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:17:46] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:17:47] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:17:47] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:17:47] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 2 ms to minimize.
[2024-06-01 05:17:48] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 3 ms to minimize.
[2024-06-01 05:17:48] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 2 ms to minimize.
[2024-06-01 05:17:48] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 2 ms to minimize.
[2024-06-01 05:17:48] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 2 ms to minimize.
[2024-06-01 05:17:49] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:17:50] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-06-01 05:17:51] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 3 ms to minimize.
[2024-06-01 05:17:51] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 3 ms to minimize.
[2024-06-01 05:17:51] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 3 ms to minimize.
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 2 ms to minimize.
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 2 ms to minimize.
[2024-06-01 05:17:53] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 2 ms to minimize.
[2024-06-01 05:17:53] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-06-01 05:17:54] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 3 ms to minimize.
[2024-06-01 05:17:54] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 3 ms to minimize.
[2024-06-01 05:17:54] [INFO ] Deduced a trap composed of 44 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:17:55] [INFO ] Deduced a trap composed of 47 places in 367 ms of which 3 ms to minimize.
[2024-06-01 05:17:55] [INFO ] Deduced a trap composed of 32 places in 331 ms of which 3 ms to minimize.
[2024-06-01 05:17:56] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 2 ms to minimize.
[2024-06-01 05:17:56] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 3 ms to minimize.
[2024-06-01 05:17:57] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 3 ms to minimize.
[2024-06-01 05:17:57] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 2 ms to minimize.
[2024-06-01 05:17:58] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 3 ms to minimize.
[2024-06-01 05:17:58] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 2 ms to minimize.
[2024-06-01 05:17:58] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:18:00] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 2 ms to minimize.
[2024-06-01 05:18:01] [INFO ] Deduced a trap composed of 48 places in 260 ms of which 2 ms to minimize.
[2024-06-01 05:18:01] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 1 ms to minimize.
[2024-06-01 05:18:01] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
[2024-06-01 05:18:03] [INFO ] Deduced a trap composed of 15 places in 390 ms of which 6 ms to minimize.
[2024-06-01 05:18:03] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65304ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65316ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66397 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-03 finished in 66538 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)&&X(p1)&&F(p2)))'
Support contains 15 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 13 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
[2024-06-01 05:18:06] [INFO ] Invariant cache hit.
[2024-06-01 05:18:06] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 05:18:06] [INFO ] Invariant cache hit.
[2024-06-01 05:18:06] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:18:23] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 3 ms to minimize.
[2024-06-01 05:18:23] [INFO ] Deduced a trap composed of 14 places in 466 ms of which 3 ms to minimize.
[2024-06-01 05:18:24] [INFO ] Deduced a trap composed of 22 places in 397 ms of which 3 ms to minimize.
[2024-06-01 05:18:24] [INFO ] Deduced a trap composed of 39 places in 420 ms of which 3 ms to minimize.
[2024-06-01 05:18:25] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:18:25] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 3 ms to minimize.
[2024-06-01 05:18:25] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 2 ms to minimize.
[2024-06-01 05:18:26] [INFO ] Deduced a trap composed of 45 places in 422 ms of which 3 ms to minimize.
[2024-06-01 05:18:26] [INFO ] Deduced a trap composed of 46 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:18:27] [INFO ] Deduced a trap composed of 43 places in 434 ms of which 3 ms to minimize.
[2024-06-01 05:18:27] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 45 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 2 ms to minimize.
[2024-06-01 05:18:29] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 2 ms to minimize.
[2024-06-01 05:18:29] [INFO ] Deduced a trap composed of 32 places in 409 ms of which 2 ms to minimize.
[2024-06-01 05:18:29] [INFO ] Deduced a trap composed of 40 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:18:30] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 3 ms to minimize.
[2024-06-01 05:18:30] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:18:31] [INFO ] Deduced a trap composed of 27 places in 464 ms of which 3 ms to minimize.
[2024-06-01 05:18:31] [INFO ] Deduced a trap composed of 34 places in 441 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:18:32] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 3 ms to minimize.
[2024-06-01 05:18:32] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-01 05:18:33] [INFO ] Deduced a trap composed of 38 places in 464 ms of which 4 ms to minimize.
[2024-06-01 05:18:33] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 3 ms to minimize.
[2024-06-01 05:18:34] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:18:34] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 3 ms to minimize.
[2024-06-01 05:18:35] [INFO ] Deduced a trap composed of 32 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:18:35] [INFO ] Deduced a trap composed of 24 places in 419 ms of which 5 ms to minimize.
[2024-06-01 05:18:36] [INFO ] Deduced a trap composed of 37 places in 464 ms of which 3 ms to minimize.
[2024-06-01 05:18:36] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 2 ms to minimize.
[2024-06-01 05:18:37] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 2 ms to minimize.
[2024-06-01 05:18:37] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 2 ms to minimize.
[2024-06-01 05:18:37] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 2 ms to minimize.
[2024-06-01 05:18:37] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:18:38] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-06-01 05:18:38] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 2 ms to minimize.
[2024-06-01 05:18:39] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 3 ms to minimize.
[2024-06-01 05:18:39] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 2 ms to minimize.
[2024-06-01 05:18:39] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:18:39] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:18:49] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 4 ms to minimize.
[2024-06-01 05:18:49] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 2 ms to minimize.
[2024-06-01 05:18:50] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 2 ms to minimize.
[2024-06-01 05:18:50] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 3 ms to minimize.
[2024-06-01 05:18:51] [INFO ] Deduced a trap composed of 63 places in 291 ms of which 3 ms to minimize.
[2024-06-01 05:18:51] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 3 ms to minimize.
[2024-06-01 05:18:51] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 2 ms to minimize.
[2024-06-01 05:18:52] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 3 ms to minimize.
[2024-06-01 05:18:52] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 3 ms to minimize.
[2024-06-01 05:18:53] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 2 ms to minimize.
[2024-06-01 05:18:53] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-06-01 05:18:53] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:18:53] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:18:54] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 2 ms to minimize.
[2024-06-01 05:18:54] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:18:54] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 2 ms to minimize.
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 2 ms to minimize.
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 2 ms to minimize.
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:18:56] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:18:57] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 2 ms to minimize.
[2024-06-01 05:18:57] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:18:58] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 2 ms to minimize.
[2024-06-01 05:18:58] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 2 ms to minimize.
[2024-06-01 05:18:59] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 2 ms to minimize.
[2024-06-01 05:18:59] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 2 ms to minimize.
[2024-06-01 05:19:00] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 2 ms to minimize.
[2024-06-01 05:19:00] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-06-01 05:19:00] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 3 ms to minimize.
[2024-06-01 05:19:01] [INFO ] Deduced a trap composed of 59 places in 351 ms of which 3 ms to minimize.
[2024-06-01 05:19:01] [INFO ] Deduced a trap composed of 44 places in 342 ms of which 3 ms to minimize.
[2024-06-01 05:19:02] [INFO ] Deduced a trap composed of 47 places in 361 ms of which 3 ms to minimize.
[2024-06-01 05:19:02] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 2 ms to minimize.
[2024-06-01 05:19:03] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 3 ms to minimize.
[2024-06-01 05:19:03] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 2 ms to minimize.
[2024-06-01 05:19:04] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 3 ms to minimize.
[2024-06-01 05:19:04] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 2 ms to minimize.
[2024-06-01 05:19:04] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 2 ms to minimize.
[2024-06-01 05:19:05] [INFO ] Deduced a trap composed of 48 places in 329 ms of which 2 ms to minimize.
[2024-06-01 05:19:05] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:19:07] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 2 ms to minimize.
[2024-06-01 05:19:07] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 2 ms to minimize.
[2024-06-01 05:19:08] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 2 ms to minimize.
[2024-06-01 05:19:08] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 2 ms to minimize.
[2024-06-01 05:19:09] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 2 ms to minimize.
[2024-06-01 05:19:10] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 3 ms to minimize.
[2024-06-01 05:19:10] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 2 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 Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65326ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65337ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66003 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-04 finished in 66198 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 6 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 278 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 293 transition count 955
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 156 rules applied. Total rules applied 266 place count 184 transition count 908
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 156 transition count 908
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 294 place count 156 transition count 902
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 306 place count 150 transition count 902
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 309 place count 147 transition count 899
Iterating global reduction 3 with 3 rules applied. Total rules applied 312 place count 147 transition count 899
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 568 place count 147 transition count 643
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 696 place count 83 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 697 place count 83 transition count 577
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 712 place count 68 transition count 456
Iterating global reduction 5 with 15 rules applied. Total rules applied 727 place count 68 transition count 456
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 733 place count 68 transition count 450
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 6 with 4 rules applied. Total rules applied 737 place count 66 transition count 448
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 739 place count 66 transition count 448
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 741 place count 64 transition count 446
Applied a total of 741 rules in 155 ms. Remains 64 /296 variables (removed 232) and now considering 446/1067 (removed 621) transitions.
// Phase 1: matrix 446 rows 64 cols
[2024-06-01 05:19:12] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 05:19:12] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 05:19:12] [INFO ] Invariant cache hit.
[2024-06-01 05:19:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:19:13] [INFO ] Implicit Places using invariants and state equation in 332 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 572 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/296 places, 446/1067 transitions.
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 2 place count 61 transition count 445
Applied a total of 2 rules in 28 ms. Remains 61 /62 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 61 cols
[2024-06-01 05:19:13] [INFO ] Computed 10 invariants in 6 ms
[2024-06-01 05:19:13] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 05:19:13] [INFO ] Invariant cache hit.
[2024-06-01 05:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:19:13] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/296 places, 445/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1262 ms. Remains : 61/296 places, 445/1067 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-05
Product exploration explored 100000 steps with 281 reset in 224 ms.
Product exploration explored 100000 steps with 124 reset in 234 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2273 resets) in 1767 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (161 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1275597 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1275597 steps, saw 188226 distinct states, run finished after 3009 ms. (steps per millisecond=423 ) properties seen :0
[2024-06-01 05:19:17] [INFO ] Invariant cache hit.
[2024-06-01 05:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 415/441 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/504 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/505 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/506 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/506 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 415/441 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/504 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/505 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/506 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/506 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 445/445 transitions.
Graph (complete) has 723 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 442
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 60 transition count 432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 50 transition count 432
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 50 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 49 transition count 433
Applied a total of 25 rules in 66 ms. Remains 49 /61 variables (removed 12) and now considering 433/445 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 49/61 places, 433/445 transitions.
RANDOM walk for 34033 steps (600 resets) in 378 ms. (89 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 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 445/445 transitions.
Applied a total of 0 rules in 23 ms. Remains 61 /61 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-06-01 05:19:19] [INFO ] Invariant cache hit.
[2024-06-01 05:19:19] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 05:19:19] [INFO ] Invariant cache hit.
[2024-06-01 05:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:19:19] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-06-01 05:19:19] [INFO ] Redundant transitions in 46 ms returned [296]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 441 sub problems to find dead transitions.
// Phase 1: matrix 444 rows 61 cols
[2024-06-01 05:19:19] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 05:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 443/503 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (OVERLAPS) 1/504 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (OVERLAPS) 1/505 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 10 (OVERLAPS) 0/505 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 441 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 72 constraints, problems are : Problem set: 0 solved, 441 unsolved in 24082 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 443/503 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 441/511 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/505 variables, and 511 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/61 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
After SMT, in 58665ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 58674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 444/445 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 59 transition count 442
Applied a total of 2 rules in 25 ms. Remains 59 /61 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 59 cols
[2024-06-01 05:20:18] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 05:20:18] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 05:20:18] [INFO ] Invariant cache hit.
[2024-06-01 05:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:20:18] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/61 places, 442/445 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59820 ms. Remains : 59/61 places, 442/445 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2343 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1321968 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1321968 steps, saw 199447 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-06-01 05:20:22] [INFO ] Invariant cache hit.
[2024-06-01 05:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 417/443 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/500 variables, 33/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/501 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 417/443 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/500 variables, 33/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/501 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/501 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 442/442 transitions.
Graph (complete) has 716 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 440
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 58 transition count 430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 48 transition count 430
Applied a total of 22 rules in 39 ms. Remains 48 /59 variables (removed 11) and now considering 430/442 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 48/59 places, 430/442 transitions.
RANDOM walk for 40000 steps (690 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3227 steps (4 resets) in 8 ms. (358 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 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 736 reset in 125 ms.
Product exploration explored 100000 steps with 440 reset in 343 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 442/442 transitions.
Applied a total of 0 rules in 20 ms. Remains 59 /59 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-01 05:20:23] [INFO ] Invariant cache hit.
[2024-06-01 05:20:24] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 05:20:24] [INFO ] Invariant cache hit.
[2024-06-01 05:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:20:24] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-06-01 05:20:24] [INFO ] Redundant transitions in 21 ms returned []
Running 440 sub problems to find dead transitions.
[2024-06-01 05:20:24] [INFO ] Invariant cache hit.
[2024-06-01 05:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (OVERLAPS) 441/500 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (OVERLAPS) 1/501 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 440 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 70 constraints, problems are : Problem set: 0 solved, 440 unsolved in 17593 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (OVERLAPS) 441/500 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 440/509 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/501 variables, and 509 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 0/0 constraints]
After SMT, in 51880ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 51887ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52451 ms. Remains : 59/59 places, 442/442 transitions.
Treatment of property AutonomousCar-PT-08b-LTLFireability-05 finished in 124140 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||(G(p1) U p2))))'
Support contains 7 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 14 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-06-01 05:21:16] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:21:16] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-06-01 05:21:16] [INFO ] Invariant cache hit.
[2024-06-01 05:21:17] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:21:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:21:34] [INFO ] Deduced a trap composed of 21 places in 481 ms of which 4 ms to minimize.
[2024-06-01 05:21:34] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 3 ms to minimize.
[2024-06-01 05:21:35] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 3 ms to minimize.
[2024-06-01 05:21:35] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:21:35] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 4 ms to minimize.
[2024-06-01 05:21:36] [INFO ] Deduced a trap composed of 41 places in 438 ms of which 3 ms to minimize.
[2024-06-01 05:21:36] [INFO ] Deduced a trap composed of 36 places in 447 ms of which 3 ms to minimize.
[2024-06-01 05:21:37] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 3 ms to minimize.
[2024-06-01 05:21:37] [INFO ] Deduced a trap composed of 46 places in 403 ms of which 3 ms to minimize.
[2024-06-01 05:21:38] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:21:38] [INFO ] Deduced a trap composed of 53 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:21:39] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 2 ms to minimize.
[2024-06-01 05:21:39] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 3 ms to minimize.
[2024-06-01 05:21:39] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 3 ms to minimize.
[2024-06-01 05:21:40] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 2 ms to minimize.
[2024-06-01 05:21:40] [INFO ] Deduced a trap composed of 40 places in 436 ms of which 3 ms to minimize.
[2024-06-01 05:21:41] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 2 ms to minimize.
[2024-06-01 05:21:41] [INFO ] Deduced a trap composed of 42 places in 408 ms of which 3 ms to minimize.
[2024-06-01 05:21:42] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 3 ms to minimize.
[2024-06-01 05:21:42] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:21:43] [INFO ] Deduced a trap composed of 56 places in 362 ms of which 2 ms to minimize.
[2024-06-01 05:21:43] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2024-06-01 05:21:44] [INFO ] Deduced a trap composed of 38 places in 490 ms of which 3 ms to minimize.
[2024-06-01 05:21:44] [INFO ] Deduced a trap composed of 46 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:21:45] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:21:45] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 3 ms to minimize.
[2024-06-01 05:21:46] [INFO ] Deduced a trap composed of 32 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:21:46] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 2 ms to minimize.
[2024-06-01 05:21:47] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 3 ms to minimize.
[2024-06-01 05:21:47] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 2 ms to minimize.
[2024-06-01 05:21:47] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:21:48] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 2 ms to minimize.
[2024-06-01 05:21:48] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 2 ms to minimize.
[2024-06-01 05:21:48] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 2 ms to minimize.
[2024-06-01 05:21:48] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 2 ms to minimize.
[2024-06-01 05:21:49] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 2 ms to minimize.
[2024-06-01 05:21:49] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 3 ms to minimize.
[2024-06-01 05:21:50] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 3 ms to minimize.
[2024-06-01 05:21:50] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:21:50] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:21:59] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 2 ms to minimize.
[2024-06-01 05:21:59] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 2 ms to minimize.
[2024-06-01 05:22:00] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 3 ms to minimize.
[2024-06-01 05:22:01] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 3 ms to minimize.
[2024-06-01 05:22:01] [INFO ] Deduced a trap composed of 63 places in 291 ms of which 2 ms to minimize.
[2024-06-01 05:22:01] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 3 ms to minimize.
[2024-06-01 05:22:02] [INFO ] Deduced a trap composed of 58 places in 298 ms of which 2 ms to minimize.
[2024-06-01 05:22:02] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 6 ms to minimize.
[2024-06-01 05:22:03] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 3 ms to minimize.
[2024-06-01 05:22:03] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 3 ms to minimize.
[2024-06-01 05:22:03] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:22:04] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:22:04] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 2 ms to minimize.
[2024-06-01 05:22:04] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:22:04] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 2 ms to minimize.
[2024-06-01 05:22:05] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 2 ms to minimize.
[2024-06-01 05:22:05] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:22:05] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 2 ms to minimize.
[2024-06-01 05:22:05] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:22:06] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:22:07] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 3 ms to minimize.
[2024-06-01 05:22:08] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 2 ms to minimize.
[2024-06-01 05:22:08] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 2 ms to minimize.
[2024-06-01 05:22:08] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 3 ms to minimize.
[2024-06-01 05:22:09] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 2 ms to minimize.
[2024-06-01 05:22:09] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 2 ms to minimize.
[2024-06-01 05:22:10] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 2 ms to minimize.
[2024-06-01 05:22:10] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 2 ms to minimize.
[2024-06-01 05:22:11] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:22:11] [INFO ] Deduced a trap composed of 59 places in 350 ms of which 3 ms to minimize.
[2024-06-01 05:22:12] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 2 ms to minimize.
[2024-06-01 05:22:12] [INFO ] Deduced a trap composed of 47 places in 361 ms of which 3 ms to minimize.
[2024-06-01 05:22:12] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 2 ms to minimize.
[2024-06-01 05:22:13] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 3 ms to minimize.
[2024-06-01 05:22:13] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 3 ms to minimize.
[2024-06-01 05:22:14] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 3 ms to minimize.
[2024-06-01 05:22:14] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 3 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 2 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:22:17] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 2 ms to minimize.
[2024-06-01 05:22:17] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 2 ms to minimize.
[2024-06-01 05:22:18] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 2 ms to minimize.
[2024-06-01 05:22:18] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:22:19] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:22:20] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 3 ms to minimize.
[2024-06-01 05:22:20] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65608ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65619ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66592 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-06 finished in 66781 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(p1)&&p0) U (!X(!p2) U !p3))))'
Support contains 16 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 13 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
[2024-06-01 05:22:23] [INFO ] Invariant cache hit.
[2024-06-01 05:22:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 05:22:23] [INFO ] Invariant cache hit.
[2024-06-01 05:22:23] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:22:40] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 3 ms to minimize.
[2024-06-01 05:22:40] [INFO ] Deduced a trap composed of 14 places in 480 ms of which 3 ms to minimize.
[2024-06-01 05:22:41] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 3 ms to minimize.
[2024-06-01 05:22:41] [INFO ] Deduced a trap composed of 39 places in 434 ms of which 3 ms to minimize.
[2024-06-01 05:22:42] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 3 ms to minimize.
[2024-06-01 05:22:42] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 3 ms to minimize.
[2024-06-01 05:22:43] [INFO ] Deduced a trap composed of 36 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:22:43] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:22:43] [INFO ] Deduced a trap composed of 46 places in 405 ms of which 3 ms to minimize.
[2024-06-01 05:22:44] [INFO ] Deduced a trap composed of 43 places in 401 ms of which 3 ms to minimize.
[2024-06-01 05:22:44] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 3 ms to minimize.
[2024-06-01 05:22:45] [INFO ] Deduced a trap composed of 45 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:22:45] [INFO ] Deduced a trap composed of 21 places in 403 ms of which 3 ms to minimize.
[2024-06-01 05:22:46] [INFO ] Deduced a trap composed of 23 places in 432 ms of which 4 ms to minimize.
[2024-06-01 05:22:46] [INFO ] Deduced a trap composed of 32 places in 415 ms of which 4 ms to minimize.
[2024-06-01 05:22:47] [INFO ] Deduced a trap composed of 40 places in 413 ms of which 3 ms to minimize.
[2024-06-01 05:22:47] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 3 ms to minimize.
[2024-06-01 05:22:47] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:22:48] [INFO ] Deduced a trap composed of 27 places in 442 ms of which 2 ms to minimize.
[2024-06-01 05:22:48] [INFO ] Deduced a trap composed of 34 places in 452 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:22:49] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 3 ms to minimize.
[2024-06-01 05:22:49] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2024-06-01 05:22:50] [INFO ] Deduced a trap composed of 38 places in 477 ms of which 3 ms to minimize.
[2024-06-01 05:22:50] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 2 ms to minimize.
[2024-06-01 05:22:51] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 3 ms to minimize.
[2024-06-01 05:22:51] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 2 ms to minimize.
[2024-06-01 05:22:52] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 3 ms to minimize.
[2024-06-01 05:22:52] [INFO ] Deduced a trap composed of 24 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:22:53] [INFO ] Deduced a trap composed of 37 places in 479 ms of which 3 ms to minimize.
[2024-06-01 05:22:53] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-06-01 05:22:54] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:22:54] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:22:54] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 2 ms to minimize.
[2024-06-01 05:22:54] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:22:55] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:22:55] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 42 places in 395 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.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 1.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 1.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 1.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 1.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 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.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 0.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 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.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 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.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 0.0)
(s205 0.0)
(s206 0.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 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.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 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.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 1.0)
(s283 0.0)
(s284 0.0)
(s285 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:23:06] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 4 ms to minimize.
[2024-06-01 05:23:06] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 2 ms to minimize.
[2024-06-01 05:23:07] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 2 ms to minimize.
[2024-06-01 05:23:07] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 3 ms to minimize.
[2024-06-01 05:23:08] [INFO ] Deduced a trap composed of 63 places in 298 ms of which 3 ms to minimize.
[2024-06-01 05:23:08] [INFO ] Deduced a trap composed of 47 places in 317 ms of which 2 ms to minimize.
[2024-06-01 05:23:08] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 3 ms to minimize.
[2024-06-01 05:23:09] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 3 ms to minimize.
[2024-06-01 05:23:09] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 3 ms to minimize.
[2024-06-01 05:23:10] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-01 05:23:10] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 2 ms to minimize.
[2024-06-01 05:23:10] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:23:11] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 1 ms to minimize.
[2024-06-01 05:23:11] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:23:11] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 2 ms to minimize.
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 2 ms to minimize.
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 3 ms to minimize.
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:23:13] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:23:14] [INFO ] Deduced a trap composed of 44 places in 329 ms of which 3 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 2 ms to minimize.
[2024-06-01 05:23:16] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 3 ms to minimize.
[2024-06-01 05:23:16] [INFO ] Deduced a trap composed of 47 places in 326 ms of which 2 ms to minimize.
[2024-06-01 05:23:17] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 2 ms to minimize.
[2024-06-01 05:23:17] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 2 ms to minimize.
[2024-06-01 05:23:17] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 2 ms to minimize.
[2024-06-01 05:23:18] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 3 ms to minimize.
[2024-06-01 05:23:18] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 2 ms to minimize.
[2024-06-01 05:23:19] [INFO ] Deduced a trap composed of 44 places in 329 ms of which 3 ms to minimize.
[2024-06-01 05:23:19] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 2 ms to minimize.
[2024-06-01 05:23:20] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 2 ms to minimize.
[2024-06-01 05:23:20] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 3 ms to minimize.
[2024-06-01 05:23:21] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 3 ms to minimize.
[2024-06-01 05:23:21] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 2 ms to minimize.
[2024-06-01 05:23:21] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 3 ms to minimize.
[2024-06-01 05:23:22] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 3 ms to minimize.
[2024-06-01 05:23:22] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 2 ms to minimize.
[2024-06-01 05:23:22] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:23:25] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 2 ms to minimize.
[2024-06-01 05:23:25] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 2 ms to minimize.
[2024-06-01 05:23:25] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 2 ms to minimize.
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 2 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 3 ms to minimize.
[2024-06-01 05:23:28] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65166ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65175ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65795 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 197 ms :[p3, (OR p3 (AND (NOT p1) (NOT p2))), true, p3, (OR (NOT p2) p3)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p3))), (X (X (NOT (OR (AND p3 (NOT p0) p1) (AND p3 p2 (NOT p1)))))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 16 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLFireability-08 finished in 66541 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(p1)))'
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 262 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 293 transition count 958
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 150 rules applied. Total rules applied 257 place count 187 transition count 914
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 28 rules applied. Total rules applied 285 place count 161 transition count 912
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 289 place count 159 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 158 transition count 910
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 290 place count 158 transition count 905
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 300 place count 153 transition count 905
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 303 place count 150 transition count 902
Iterating global reduction 5 with 3 rules applied. Total rules applied 306 place count 150 transition count 902
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 562 place count 150 transition count 646
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 562 place count 150 transition count 645
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 564 place count 149 transition count 645
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 565 place count 148 transition count 637
Iterating global reduction 6 with 1 rules applied. Total rules applied 566 place count 148 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 568 place count 148 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 569 place count 147 transition count 635
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 8 with 114 rules applied. Total rules applied 683 place count 90 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 684 place count 90 transition count 576
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 696 place count 78 transition count 483
Iterating global reduction 9 with 12 rules applied. Total rules applied 708 place count 78 transition count 483
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 714 place count 78 transition count 477
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 10 with 4 rules applied. Total rules applied 718 place count 76 transition count 475
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 720 place count 74 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 721 place count 73 transition count 473
Applied a total of 721 rules in 115 ms. Remains 73 /296 variables (removed 223) and now considering 473/1067 (removed 594) transitions.
// Phase 1: matrix 473 rows 73 cols
[2024-06-01 05:23:30] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 05:23:30] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 05:23:30] [INFO ] Invariant cache hit.
[2024-06-01 05:23:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:23:30] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 475 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/296 places, 473/1067 transitions.
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 2 place count 70 transition count 472
Applied a total of 2 rules in 23 ms. Remains 70 /71 variables (removed 1) and now considering 472/473 (removed 1) transitions.
// Phase 1: matrix 472 rows 70 cols
[2024-06-01 05:23:30] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:23:30] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 05:23:30] [INFO ] Invariant cache hit.
[2024-06-01 05:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:23:30] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/296 places, 472/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1063 ms. Remains : 70/296 places, 472/1067 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-09
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-09 finished in 1188 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 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 281 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 293 transition count 955
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 156 rules applied. Total rules applied 266 place count 184 transition count 908
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 156 transition count 908
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 294 place count 156 transition count 902
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 306 place count 150 transition count 902
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 308 place count 148 transition count 900
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 148 transition count 900
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 311 place count 147 transition count 884
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 147 transition count 884
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 314 place count 147 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 146 transition count 882
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 447 place count 80 transition count 815
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 448 place count 80 transition count 814
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 464 place count 64 transition count 565
Iterating global reduction 6 with 16 rules applied. Total rules applied 480 place count 64 transition count 565
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 487 place count 64 transition count 558
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 491 place count 62 transition count 556
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 60 transition count 554
Applied a total of 493 rules in 121 ms. Remains 60 /296 variables (removed 236) and now considering 554/1067 (removed 513) transitions.
// Phase 1: matrix 554 rows 60 cols
[2024-06-01 05:23:31] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 05:23:31] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 05:23:31] [INFO ] Invariant cache hit.
[2024-06-01 05:23:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:23:31] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 648 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/296 places, 554/1067 transitions.
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 2 place count 57 transition count 553
Applied a total of 2 rules in 33 ms. Remains 57 /58 variables (removed 1) and now considering 553/554 (removed 1) transitions.
// Phase 1: matrix 553 rows 57 cols
[2024-06-01 05:23:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 05:23:32] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 05:23:32] [INFO ] Invariant cache hit.
[2024-06-01 05:23:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:23:32] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/296 places, 553/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1363 ms. Remains : 57/296 places, 553/1067 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-10
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-10 finished in 1412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 264 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 293 transition count 956
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 155 rules applied. Total rules applied 264 place count 185 transition count 909
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 292 place count 157 transition count 909
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 292 place count 157 transition count 903
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 304 place count 151 transition count 903
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 307 place count 148 transition count 900
Iterating global reduction 3 with 3 rules applied. Total rules applied 310 place count 148 transition count 900
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 566 place count 148 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 566 place count 148 transition count 643
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 568 place count 147 transition count 643
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 569 place count 146 transition count 635
Iterating global reduction 4 with 1 rules applied. Total rules applied 570 place count 146 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 572 place count 146 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 573 place count 145 transition count 633
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 687 place count 88 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 688 place count 88 transition count 574
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 698 place count 78 transition count 499
Iterating global reduction 7 with 10 rules applied. Total rules applied 708 place count 78 transition count 499
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 715 place count 78 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 719 place count 76 transition count 490
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 721 place count 74 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 722 place count 73 transition count 488
Applied a total of 722 rules in 94 ms. Remains 73 /296 variables (removed 223) and now considering 488/1067 (removed 579) transitions.
// Phase 1: matrix 488 rows 73 cols
[2024-06-01 05:23:32] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 05:23:32] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 05:23:32] [INFO ] Invariant cache hit.
[2024-06-01 05:23:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:23:33] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 465 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/296 places, 488/1067 transitions.
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 2 place count 70 transition count 487
Applied a total of 2 rules in 21 ms. Remains 70 /71 variables (removed 1) and now considering 487/488 (removed 1) transitions.
// Phase 1: matrix 487 rows 70 cols
[2024-06-01 05:23:33] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:23:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 05:23:33] [INFO ] Invariant cache hit.
[2024-06-01 05:23:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:23:33] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/296 places, 487/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1004 ms. Remains : 70/296 places, 487/1067 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-11
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-11 finished in 1092 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(X(F(p1)))))'
Support contains 13 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 14 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-06-01 05:23:33] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 05:23:33] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 05:23:33] [INFO ] Invariant cache hit.
[2024-06-01 05:23:34] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:23:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:23:50] [INFO ] Deduced a trap composed of 21 places in 472 ms of which 3 ms to minimize.
[2024-06-01 05:23:51] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 3 ms to minimize.
[2024-06-01 05:23:51] [INFO ] Deduced a trap composed of 22 places in 440 ms of which 3 ms to minimize.
[2024-06-01 05:23:51] [INFO ] Deduced a trap composed of 39 places in 448 ms of which 3 ms to minimize.
[2024-06-01 05:23:52] [INFO ] Deduced a trap composed of 35 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:23:52] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 2 ms to minimize.
[2024-06-01 05:23:53] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:23:53] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:23:54] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:23:54] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 3 ms to minimize.
[2024-06-01 05:23:55] [INFO ] Deduced a trap composed of 53 places in 491 ms of which 3 ms to minimize.
[2024-06-01 05:23:55] [INFO ] Deduced a trap composed of 45 places in 420 ms of which 3 ms to minimize.
[2024-06-01 05:23:55] [INFO ] Deduced a trap composed of 21 places in 377 ms of which 2 ms to minimize.
[2024-06-01 05:23:56] [INFO ] Deduced a trap composed of 23 places in 421 ms of which 3 ms to minimize.
[2024-06-01 05:23:56] [INFO ] Deduced a trap composed of 32 places in 413 ms of which 3 ms to minimize.
[2024-06-01 05:23:57] [INFO ] Deduced a trap composed of 40 places in 416 ms of which 3 ms to minimize.
[2024-06-01 05:23:57] [INFO ] Deduced a trap composed of 43 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:23:58] [INFO ] Deduced a trap composed of 42 places in 397 ms of which 2 ms to minimize.
[2024-06-01 05:23:58] [INFO ] Deduced a trap composed of 27 places in 438 ms of which 3 ms to minimize.
[2024-06-01 05:23:58] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:23:59] [INFO ] Deduced a trap composed of 56 places in 470 ms of which 3 ms to minimize.
[2024-06-01 05:24:00] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2024-06-01 05:24:00] [INFO ] Deduced a trap composed of 38 places in 463 ms of which 3 ms to minimize.
[2024-06-01 05:24:01] [INFO ] Deduced a trap composed of 46 places in 435 ms of which 3 ms to minimize.
[2024-06-01 05:24:01] [INFO ] Deduced a trap composed of 43 places in 408 ms of which 2 ms to minimize.
[2024-06-01 05:24:02] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 3 ms to minimize.
[2024-06-01 05:24:02] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:24:03] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 2 ms to minimize.
[2024-06-01 05:24:03] [INFO ] Deduced a trap composed of 37 places in 461 ms of which 3 ms to minimize.
[2024-06-01 05:24:04] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:24:04] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:24:04] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:24:04] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:24:05] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 2 ms to minimize.
[2024-06-01 05:24:05] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 1 ms to minimize.
[2024-06-01 05:24:05] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:24:06] [INFO ] Deduced a trap composed of 42 places in 390 ms of which 3 ms to minimize.
[2024-06-01 05:24:06] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 2 ms to minimize.
[2024-06-01 05:24:06] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 2 ms to minimize.
[2024-06-01 05:24:07] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:24:16] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 3 ms to minimize.
[2024-06-01 05:24:16] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 3 ms to minimize.
[2024-06-01 05:24:17] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 3 ms to minimize.
[2024-06-01 05:24:18] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 3 ms to minimize.
[2024-06-01 05:24:18] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 3 ms to minimize.
[2024-06-01 05:24:18] [INFO ] Deduced a trap composed of 47 places in 317 ms of which 3 ms to minimize.
[2024-06-01 05:24:18] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 3 ms to minimize.
[2024-06-01 05:24:19] [INFO ] Deduced a trap composed of 43 places in 379 ms of which 3 ms to minimize.
[2024-06-01 05:24:19] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 2 ms to minimize.
[2024-06-01 05:24:20] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-06-01 05:24:20] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 2 ms to minimize.
[2024-06-01 05:24:20] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:24:21] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:24:21] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 2 ms to minimize.
[2024-06-01 05:24:21] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 2 ms to minimize.
[2024-06-01 05:24:22] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:24:22] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 2 ms to minimize.
[2024-06-01 05:24:22] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:24:22] [INFO ] Deduced a trap composed of 48 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:24:23] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:24:24] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:24:25] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 2 ms to minimize.
[2024-06-01 05:24:25] [INFO ] Deduced a trap composed of 43 places in 312 ms of which 2 ms to minimize.
[2024-06-01 05:24:25] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 3 ms to minimize.
[2024-06-01 05:24:26] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 2 ms to minimize.
[2024-06-01 05:24:26] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 2 ms to minimize.
[2024-06-01 05:24:27] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 2 ms to minimize.
[2024-06-01 05:24:27] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 2 ms to minimize.
[2024-06-01 05:24:28] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:24:28] [INFO ] Deduced a trap composed of 59 places in 364 ms of which 3 ms to minimize.
[2024-06-01 05:24:29] [INFO ] Deduced a trap composed of 44 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:24:29] [INFO ] Deduced a trap composed of 47 places in 369 ms of which 3 ms to minimize.
[2024-06-01 05:24:29] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 3 ms to minimize.
[2024-06-01 05:24:30] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-06-01 05:24:30] [INFO ] Deduced a trap composed of 32 places in 340 ms of which 3 ms to minimize.
[2024-06-01 05:24:31] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 3 ms to minimize.
[2024-06-01 05:24:31] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 2 ms to minimize.
[2024-06-01 05:24:32] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 3 ms to minimize.
[2024-06-01 05:24:32] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 2 ms to minimize.
[2024-06-01 05:24:32] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:24:34] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 2 ms to minimize.
[2024-06-01 05:24:35] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:24:35] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 2 ms to minimize.
[2024-06-01 05:24:35] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 2 ms to minimize.
[2024-06-01 05:24:36] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:24:37] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 3 ms to minimize.
[2024-06-01 05:24:37] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65351ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65360ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66077 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLFireability-12 finished in 66564 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)&&F((p1&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Graph (trivial) has 276 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 293 transition count 957
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 152 rules applied. Total rules applied 260 place count 186 transition count 912
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 287 place count 159 transition count 912
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 287 place count 159 transition count 905
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 301 place count 152 transition count 905
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 303 place count 150 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 150 transition count 903
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 561 place count 150 transition count 647
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 693 place count 84 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 694 place count 84 transition count 579
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 709 place count 69 transition count 459
Iterating global reduction 5 with 15 rules applied. Total rules applied 724 place count 69 transition count 459
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 731 place count 69 transition count 452
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 6 with 4 rules applied. Total rules applied 735 place count 67 transition count 450
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 737 place count 65 transition count 448
Applied a total of 737 rules in 89 ms. Remains 65 /296 variables (removed 231) and now considering 448/1067 (removed 619) transitions.
// Phase 1: matrix 448 rows 65 cols
[2024-06-01 05:24:40] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 05:24:40] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:24:40] [INFO ] Invariant cache hit.
[2024-06-01 05:24:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:24:40] [INFO ] Implicit Places using invariants and state equation in 323 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 529 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/296 places, 448/1067 transitions.
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 2 place count 62 transition count 447
Applied a total of 2 rules in 25 ms. Remains 62 /63 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 62 cols
[2024-06-01 05:24:40] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 05:24:40] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 05:24:40] [INFO ] Invariant cache hit.
[2024-06-01 05:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:24:41] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/296 places, 447/1067 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1190 ms. Remains : 62/296 places, 447/1067 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-13
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-13 finished in 1387 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((G(F(p0))||(p1&&F(p2))))))'
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 1063
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 1063
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 264 place count 292 transition count 807
Applied a total of 264 rules in 11 ms. Remains 292 /296 variables (removed 4) and now considering 807/1067 (removed 260) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:24:41] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:24:41] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 05:24:41] [INFO ] Invariant cache hit.
[2024-06-01 05:24:42] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:24:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:24:58] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 3 ms to minimize.
[2024-06-01 05:24:59] [INFO ] Deduced a trap composed of 64 places in 455 ms of which 3 ms to minimize.
[2024-06-01 05:24:59] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 2 ms to minimize.
[2024-06-01 05:24:59] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:25:00] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:25:00] [INFO ] Deduced a trap composed of 81 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:25:01] [INFO ] Deduced a trap composed of 26 places in 472 ms of which 3 ms to minimize.
[2024-06-01 05:25:02] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 3 ms to minimize.
[2024-06-01 05:25:02] [INFO ] Deduced a trap composed of 49 places in 441 ms of which 2 ms to minimize.
[2024-06-01 05:25:03] [INFO ] Deduced a trap composed of 34 places in 427 ms of which 2 ms to minimize.
[2024-06-01 05:25:03] [INFO ] Deduced a trap composed of 39 places in 414 ms of which 2 ms to minimize.
[2024-06-01 05:25:03] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 2 ms to minimize.
[2024-06-01 05:25:04] [INFO ] Deduced a trap composed of 42 places in 406 ms of which 3 ms to minimize.
[2024-06-01 05:25:04] [INFO ] Deduced a trap composed of 44 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:25:05] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 3 ms to minimize.
[2024-06-01 05:25:05] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 51 places in 441 ms of which 3 ms to minimize.
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 51 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2024-06-01 05:25:07] [INFO ] Deduced a trap composed of 32 places in 440 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:25:08] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 3 ms to minimize.
[2024-06-01 05:25:08] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 3 ms to minimize.
[2024-06-01 05:25:08] [INFO ] Deduced a trap composed of 37 places in 415 ms of which 3 ms to minimize.
[2024-06-01 05:25:09] [INFO ] Deduced a trap composed of 47 places in 411 ms of which 3 ms to minimize.
[2024-06-01 05:25:09] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 4 ms to minimize.
[2024-06-01 05:25:10] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 3 ms to minimize.
[2024-06-01 05:25:10] [INFO ] Deduced a trap composed of 28 places in 455 ms of which 3 ms to minimize.
[2024-06-01 05:25:11] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 2 ms to minimize.
[2024-06-01 05:25:11] [INFO ] Deduced a trap composed of 40 places in 504 ms of which 4 ms to minimize.
[2024-06-01 05:25:12] [INFO ] Deduced a trap composed of 42 places in 618 ms of which 4 ms to minimize.
[2024-06-01 05:25:12] [INFO ] Deduced a trap composed of 42 places in 611 ms of which 4 ms to minimize.
[2024-06-01 05:25:13] [INFO ] Deduced a trap composed of 49 places in 600 ms of which 4 ms to minimize.
[2024-06-01 05:25:14] [INFO ] Deduced a trap composed of 39 places in 603 ms of which 5 ms to minimize.
[2024-06-01 05:25:14] [INFO ] Deduced a trap composed of 48 places in 600 ms of which 5 ms to minimize.
[2024-06-01 05:25:15] [INFO ] Deduced a trap composed of 47 places in 545 ms of which 4 ms to minimize.
[2024-06-01 05:25:15] [INFO ] Deduced a trap composed of 47 places in 563 ms of which 4 ms to minimize.
[2024-06-01 05:25:16] [INFO ] Deduced a trap composed of 45 places in 563 ms of which 4 ms to minimize.
[2024-06-01 05:25:17] [INFO ] Deduced a trap composed of 32 places in 615 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/1099 variables, and 51 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:25:27] [INFO ] Deduced a trap composed of 55 places in 517 ms of which 4 ms to minimize.
[2024-06-01 05:25:28] [INFO ] Deduced a trap composed of 49 places in 640 ms of which 4 ms to minimize.
[2024-06-01 05:25:28] [INFO ] Deduced a trap composed of 29 places in 628 ms of which 4 ms to minimize.
[2024-06-01 05:25:29] [INFO ] Deduced a trap composed of 62 places in 615 ms of which 4 ms to minimize.
[2024-06-01 05:25:30] [INFO ] Deduced a trap composed of 46 places in 573 ms of which 4 ms to minimize.
[2024-06-01 05:25:30] [INFO ] Deduced a trap composed of 45 places in 611 ms of which 5 ms to minimize.
[2024-06-01 05:25:31] [INFO ] Deduced a trap composed of 52 places in 620 ms of which 4 ms to minimize.
[2024-06-01 05:25:31] [INFO ] Deduced a trap composed of 37 places in 582 ms of which 5 ms to minimize.
[2024-06-01 05:25:32] [INFO ] Deduced a trap composed of 48 places in 605 ms of which 4 ms to minimize.
[2024-06-01 05:25:33] [INFO ] Deduced a trap composed of 68 places in 447 ms of which 3 ms to minimize.
[2024-06-01 05:25:33] [INFO ] Deduced a trap composed of 48 places in 506 ms of which 4 ms to minimize.
[2024-06-01 05:25:34] [INFO ] Deduced a trap composed of 49 places in 628 ms of which 4 ms to minimize.
[2024-06-01 05:25:35] [INFO ] Deduced a trap composed of 42 places in 551 ms of which 5 ms to minimize.
[2024-06-01 05:25:36] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 3 ms to minimize.
[2024-06-01 05:25:36] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 3 ms to minimize.
[2024-06-01 05:25:37] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 2 ms to minimize.
[2024-06-01 05:25:37] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 2 ms to minimize.
[2024-06-01 05:25:37] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 2 ms to minimize.
[2024-06-01 05:25:38] [INFO ] Deduced a trap composed of 50 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:25:38] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:25:41] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 4 ms to minimize.
[2024-06-01 05:25:41] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 3 ms to minimize.
[2024-06-01 05:25:42] [INFO ] Deduced a trap composed of 32 places in 570 ms of which 4 ms to minimize.
[2024-06-01 05:25:43] [INFO ] Deduced a trap composed of 32 places in 565 ms of which 4 ms to minimize.
[2024-06-01 05:25:44] [INFO ] Deduced a trap composed of 44 places in 375 ms of which 3 ms to minimize.
[2024-06-01 05:25:44] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 2 ms to minimize.
[2024-06-01 05:25:44] [INFO ] Deduced a trap composed of 45 places in 353 ms of which 2 ms to minimize.
[2024-06-01 05:25:45] [INFO ] Deduced a trap composed of 43 places in 335 ms of which 5 ms to minimize.
[2024-06-01 05:25:45] [INFO ] Deduced a trap composed of 40 places in 557 ms of which 4 ms to minimize.
[2024-06-01 05:25:46] [INFO ] Deduced a trap composed of 31 places in 461 ms of which 4 ms to minimize.
[2024-06-01 05:25:47] [INFO ] Deduced a trap composed of 42 places in 393 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/1099 variables, and 82 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 69/69 constraints]
After SMT, in 65459ms problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 65469ms
Starting structural reductions in LTL mode, iteration 1 : 292/296 places, 807/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66193 ms. Remains : 292/296 places, 807/1067 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-14
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-14 finished in 66614 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)||X(p1))))'
Support contains 6 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1067/1067 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 291 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 291 transition count 1062
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 266 place count 291 transition count 806
Applied a total of 266 rules in 20 ms. Remains 291 /296 variables (removed 5) and now considering 806/1067 (removed 261) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-06-01 05:25:48] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:25:48] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 05:25:48] [INFO ] Invariant cache hit.
[2024-06-01 05:25:49] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:26:11] [INFO ] Deduced a trap composed of 21 places in 528 ms of which 4 ms to minimize.
[2024-06-01 05:26:12] [INFO ] Deduced a trap composed of 14 places in 660 ms of which 4 ms to minimize.
[2024-06-01 05:26:12] [INFO ] Deduced a trap composed of 22 places in 549 ms of which 2 ms to minimize.
[2024-06-01 05:26:13] [INFO ] Deduced a trap composed of 39 places in 427 ms of which 2 ms to minimize.
[2024-06-01 05:26:13] [INFO ] Deduced a trap composed of 35 places in 409 ms of which 3 ms to minimize.
[2024-06-01 05:26:14] [INFO ] Deduced a trap composed of 41 places in 543 ms of which 5 ms to minimize.
[2024-06-01 05:26:14] [INFO ] Deduced a trap composed of 36 places in 685 ms of which 5 ms to minimize.
[2024-06-01 05:26:15] [INFO ] Deduced a trap composed of 45 places in 606 ms of which 4 ms to minimize.
[2024-06-01 05:26:16] [INFO ] Deduced a trap composed of 46 places in 659 ms of which 5 ms to minimize.
[2024-06-01 05:26:16] [INFO ] Deduced a trap composed of 43 places in 647 ms of which 5 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 53 places in 641 ms of which 5 ms to minimize.
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 45 places in 669 ms of which 4 ms to minimize.
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 21 places in 641 ms of which 4 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 4 ms to minimize.
[2024-06-01 05:26:20] [INFO ] Deduced a trap composed of 32 places in 672 ms of which 4 ms to minimize.
[2024-06-01 05:26:20] [INFO ] Deduced a trap composed of 40 places in 632 ms of which 4 ms to minimize.
[2024-06-01 05:26:21] [INFO ] Deduced a trap composed of 43 places in 553 ms of which 4 ms to minimize.
[2024-06-01 05:26:22] [INFO ] Deduced a trap composed of 42 places in 626 ms of which 4 ms to minimize.
[2024-06-01 05:26:22] [INFO ] Deduced a trap composed of 27 places in 667 ms of which 5 ms to minimize.
[2024-06-01 05:26:23] [INFO ] Deduced a trap composed of 34 places in 620 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:26:24] [INFO ] Deduced a trap composed of 56 places in 628 ms of which 4 ms to minimize.
[2024-06-01 05:26:24] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 35 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:26:33] [INFO ] Deduced a trap composed of 39 places in 560 ms of which 4 ms to minimize.
[2024-06-01 05:26:34] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:26:34] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 3 ms to minimize.
[2024-06-01 05:26:35] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 3 ms to minimize.
[2024-06-01 05:26:36] [INFO ] Deduced a trap composed of 40 places in 588 ms of which 4 ms to minimize.
[2024-06-01 05:26:36] [INFO ] Deduced a trap composed of 23 places in 562 ms of which 4 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 47 places in 459 ms of which 4 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 3 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 2 ms to minimize.
[2024-06-01 05:26:38] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 2 ms to minimize.
[2024-06-01 05:26:38] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 2 ms to minimize.
[2024-06-01 05:26:38] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 3 ms to minimize.
[2024-06-01 05:26:39] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 2 ms to minimize.
[2024-06-01 05:26:40] [INFO ] Deduced a trap composed of 42 places in 452 ms of which 3 ms to minimize.
[2024-06-01 05:26:40] [INFO ] Deduced a trap composed of 42 places in 464 ms of which 4 ms to minimize.
[2024-06-01 05:26:41] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:26:41] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 3 ms to minimize.
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 3 ms to minimize.
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 2 ms to minimize.
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 3 ms to minimize.
[2024-06-01 05:26:45] [INFO ] Deduced a trap composed of 46 places in 419 ms of which 3 ms to minimize.
[2024-06-01 05:26:46] [INFO ] Deduced a trap composed of 45 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:26:46] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:26:46] [INFO ] Deduced a trap composed of 44 places in 356 ms of which 3 ms to minimize.
[2024-06-01 05:26:47] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 2 ms to minimize.
[2024-06-01 05:26:48] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:26:48] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 2 ms to minimize.
[2024-06-01 05:26:48] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 3 ms to minimize.
[2024-06-01 05:26:49] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 2 ms to minimize.
[2024-06-01 05:26:49] [INFO ] Deduced a trap composed of 45 places in 342 ms of which 3 ms to minimize.
[2024-06-01 05:26:50] [INFO ] Deduced a trap composed of 44 places in 349 ms of which 3 ms to minimize.
[2024-06-01 05:26:51] [INFO ] Deduced a trap composed of 45 places in 340 ms of which 3 ms to minimize.
[2024-06-01 05:26:51] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 3 ms to minimize.
[2024-06-01 05:26:51] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 3 ms to minimize.
[2024-06-01 05:26:51] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 1 ms to minimize.
[2024-06-01 05:26:52] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 2 ms to minimize.
[2024-06-01 05:26:53] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 3 ms to minimize.
[2024-06-01 05:26:53] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 3 ms to minimize.
[2024-06-01 05:26:54] [INFO ] Deduced a trap composed of 48 places in 338 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 75 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 62/62 constraints]
After SMT, in 65611ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65626ms
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/1067 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66884 ms. Remains : 291/296 places, 806/1067 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLFireability-15 finished in 67487 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)))'
[2024-06-01 05:26:56] [INFO ] Flatten gal took : 108 ms
[2024-06-01 05:26:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 05:26:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 296 places, 1067 transitions and 9332 arcs took 20 ms.
Total runtime 761848 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-08b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717220520523
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-08b-LTLFireability-05
ltl formula formula --ltl=/tmp/3298/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 296 places, 1067 transitions and 9332 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.060 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3298/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3298/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3298/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3298/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 297 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 297, there are 1333 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~107 levels ~10000 states ~108200 transitions
pnml2lts-mc( 3/ 4): ~107 levels ~20000 states ~232076 transitions
pnml2lts-mc( 3/ 4): ~107 levels ~40000 states ~512544 transitions
pnml2lts-mc( 1/ 4): ~104 levels ~80000 states ~1605140 transitions
pnml2lts-mc( 1/ 4): ~104 levels ~160000 states ~3342516 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~320000 states ~6672528 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~640000 states ~13840028 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~1280000 states ~27932144 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~2560000 states ~56955384 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~5120000 states ~112399324 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~10240000 states ~236409912 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~20480000 states ~488544552 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27123511
pnml2lts-mc( 0/ 4): unique states count: 33519643
pnml2lts-mc( 0/ 4): unique transitions count: 848756457
pnml2lts-mc( 0/ 4): - self-loop count: 447
pnml2lts-mc( 0/ 4): - claim dead count: 658423671
pnml2lts-mc( 0/ 4): - claim found count: 156536983
pnml2lts-mc( 0/ 4): - claim success count: 33519660
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18803
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33519660 states 848756604 transitions, fanout: 25.321
pnml2lts-mc( 0/ 4): Total exploration time 903.260 sec (903.090 sec minimum, 903.133 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37110, Transitions per second: 939659
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.2MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 1097 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.2MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-08b"
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 AutonomousCar-PT-08b, 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-171620167500340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b 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 ;