About the Execution of GreatSPN+red for AutonomousCar-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.487 | 3600000.00 | 7427077.00 | 7971.10 | FFFFFF???F?FF?F? | 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.r025-smll-171620166400356.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 greatspnxred
Input is AutonomousCar-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 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 865K 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-09b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716358945186
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:22:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 06:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:22:27] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2024-05-22 06:22:27] [INFO ] Transformed 391 places.
[2024-05-22 06:22:27] [INFO ] Transformed 1554 transitions.
[2024-05-22 06:22:27] [INFO ] Found NUPN structural information;
[2024-05-22 06:22:27] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 115 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-09b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 334 transition count 1497
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 334 transition count 1497
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 438 place count 334 transition count 1173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 450 place count 322 transition count 1161
Iterating global reduction 1 with 12 rules applied. Total rules applied 462 place count 322 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 463 place count 321 transition count 1160
Iterating global reduction 1 with 1 rules applied. Total rules applied 464 place count 321 transition count 1160
Applied a total of 464 rules in 167 ms. Remains 321 /391 variables (removed 70) and now considering 1160/1554 (removed 394) transitions.
// Phase 1: matrix 1160 rows 321 cols
[2024-05-22 06:22:28] [INFO ] Computed 14 invariants in 51 ms
[2024-05-22 06:22:29] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-22 06:22:29] [INFO ] Invariant cache hit.
[2024-05-22 06:22:29] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 1159 sub problems to find dead transitions.
[2024-05-22 06:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1159 unsolved
At refinement iteration 1 (OVERLAPS) 1/321 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1159 unsolved
[2024-05-22 06:23:05] [INFO ] Deduced a trap composed of 31 places in 1001 ms of which 44 ms to minimize.
[2024-05-22 06:23:06] [INFO ] Deduced a trap composed of 23 places in 1054 ms of which 4 ms to minimize.
[2024-05-22 06:23:06] [INFO ] Deduced a trap composed of 22 places in 472 ms of which 3 ms to minimize.
[2024-05-22 06:23:07] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2024-05-22 06:23:07] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 4 ms to minimize.
[2024-05-22 06:23:08] [INFO ] Deduced a trap composed of 17 places in 731 ms of which 8 ms to minimize.
[2024-05-22 06:23:09] [INFO ] Deduced a trap composed of 27 places in 732 ms of which 4 ms to minimize.
[2024-05-22 06:23:10] [INFO ] Deduced a trap composed of 45 places in 656 ms of which 3 ms to minimize.
[2024-05-22 06:23:10] [INFO ] Deduced a trap composed of 46 places in 653 ms of which 5 ms to minimize.
[2024-05-22 06:23:11] [INFO ] Deduced a trap composed of 44 places in 681 ms of which 3 ms to minimize.
[2024-05-22 06:23:12] [INFO ] Deduced a trap composed of 45 places in 684 ms of which 3 ms to minimize.
[2024-05-22 06:23:12] [INFO ] Deduced a trap composed of 44 places in 666 ms of which 3 ms to minimize.
[2024-05-22 06:23:13] [INFO ] Deduced a trap composed of 44 places in 663 ms of which 4 ms to minimize.
[2024-05-22 06:23:14] [INFO ] Deduced a trap composed of 70 places in 678 ms of which 3 ms to minimize.
[2024-05-22 06:23:14] [INFO ] Deduced a trap composed of 54 places in 665 ms of which 3 ms to minimize.
[2024-05-22 06:23:15] [INFO ] Deduced a trap composed of 53 places in 670 ms of which 3 ms to minimize.
[2024-05-22 06:23:16] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 3 ms to minimize.
[2024-05-22 06:23:16] [INFO ] Deduced a trap composed of 29 places in 674 ms of which 3 ms to minimize.
[2024-05-22 06:23:17] [INFO ] Deduced a trap composed of 63 places in 699 ms of which 3 ms to minimize.
SMT process timed out in 47922ms, After SMT, problems are : Problem set: 0 solved, 1159 unsolved
Search for dead transitions found 0 dead transitions in 47985ms
Starting structural reductions in LTL mode, iteration 1 : 321/391 places, 1160/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49592 ms. Remains : 321/391 places, 1160/1554 transitions.
Support contains 43 out of 321 places after structural reductions.
[2024-05-22 06:23:18] [INFO ] Flatten gal took : 326 ms
[2024-05-22 06:23:18] [INFO ] Flatten gal took : 175 ms
[2024-05-22 06:23:18] [INFO ] Input system was already deterministic with 1160 transitions.
RANDOM walk for 40000 steps (330 resets) in 3016 ms. (13 steps per ms) remains 18/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
[2024-05-22 06:23:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 252/289 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 32/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 06:23:21] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1160/1481 variables, 321/336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1481 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1481 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1481/1481 variables, and 336 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 252/289 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 06:23:23] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 3 ms to minimize.
[2024-05-22 06:23:24] [INFO ] Deduced a trap composed of 31 places in 663 ms of which 3 ms to minimize.
[2024-05-22 06:23:24] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 32/321 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1160/1481 variables, 321/339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1481 variables, 18/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1481/1481 variables, and 357 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints]
After SMT, in 7460ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 257 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 8 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 1580 edges and 319 vertex of which 317 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 317 transition count 1041
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 167 rules applied. Total rules applied 284 place count 204 transition count 987
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 316 place count 172 transition count 987
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 981
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 329 place count 165 transition count 980
Iterating global reduction 3 with 1 rules applied. Total rules applied 330 place count 165 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 164 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 164 transition count 971
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 334 place count 164 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 163 transition count 969
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 437 place count 112 transition count 918
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 438 place count 112 transition count 917
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 443 place count 107 transition count 880
Iterating global reduction 6 with 5 rules applied. Total rules applied 448 place count 107 transition count 880
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 452 place count 107 transition count 876
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 7 with 2 rules applied. Total rules applied 454 place count 106 transition count 875
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 476 place count 106 transition count 853
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 498 place count 84 transition count 853
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 506 place count 84 transition count 853
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 507 place count 83 transition count 852
Applied a total of 507 rules in 576 ms. Remains 83 /321 variables (removed 238) and now considering 852/1160 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 83/321 places, 852/1160 transitions.
RANDOM walk for 40000 steps (831 resets) in 1236 ms. (32 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40003 steps (85 resets) in 147 ms. (270 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (100 resets) in 141 ms. (281 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (74 resets) in 136 ms. (291 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (87 resets) in 127 ms. (312 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 111 ms. (357 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 90 ms. (439 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
// Phase 1: matrix 852 rows 83 cols
[2024-05-22 06:23:29] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 06:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 848/914 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/935 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/935 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 848/914 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/935 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1365ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5735 steps, including 399 resets, run visited all 1 properties in 81 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 89 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 49 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(G(p0))&&F(p1)))'
Support contains 20 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 20 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:23:31] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 06:23:31] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 06:23:31] [INFO ] Invariant cache hit.
[2024-05-22 06:23:31] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:23:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:24:07] [INFO ] Deduced a trap composed of 21 places in 808 ms of which 4 ms to minimize.
[2024-05-22 06:24:08] [INFO ] Deduced a trap composed of 61 places in 813 ms of which 4 ms to minimize.
[2024-05-22 06:24:08] [INFO ] Deduced a trap composed of 31 places in 656 ms of which 3 ms to minimize.
[2024-05-22 06:24:09] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 3 ms to minimize.
[2024-05-22 06:24:09] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 3 ms to minimize.
[2024-05-22 06:24:10] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 3 ms to minimize.
[2024-05-22 06:24:10] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 5 ms to minimize.
[2024-05-22 06:24:11] [INFO ] Deduced a trap composed of 31 places in 460 ms of which 3 ms to minimize.
[2024-05-22 06:24:11] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2024-05-22 06:24:12] [INFO ] Deduced a trap composed of 27 places in 797 ms of which 3 ms to minimize.
[2024-05-22 06:24:13] [INFO ] Deduced a trap composed of 38 places in 781 ms of which 4 ms to minimize.
[2024-05-22 06:24:14] [INFO ] Deduced a trap composed of 75 places in 792 ms of which 5 ms to minimize.
[2024-05-22 06:24:15] [INFO ] Deduced a trap composed of 23 places in 774 ms of which 3 ms to minimize.
[2024-05-22 06:24:16] [INFO ] Deduced a trap composed of 31 places in 784 ms of which 4 ms to minimize.
[2024-05-22 06:24:16] [INFO ] Deduced a trap composed of 43 places in 633 ms of which 4 ms to minimize.
[2024-05-22 06:24:17] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 3 ms to minimize.
[2024-05-22 06:24:18] [INFO ] Deduced a trap composed of 31 places in 603 ms of which 5 ms to minimize.
[2024-05-22 06:24:18] [INFO ] Deduced a trap composed of 31 places in 547 ms of which 3 ms to minimize.
[2024-05-22 06:24:19] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 3 ms to minimize.
[2024-05-22 06:24:19] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 3 ms to minimize.
SMT process timed out in 48055ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 48073ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48949 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-01
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 8 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-01 finished in 49381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 18 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
[2024-05-22 06:24:20] [INFO ] Invariant cache hit.
[2024-05-22 06:24:20] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 06:24:20] [INFO ] Invariant cache hit.
[2024-05-22 06:24:21] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:24:56] [INFO ] Deduced a trap composed of 21 places in 823 ms of which 4 ms to minimize.
[2024-05-22 06:24:57] [INFO ] Deduced a trap composed of 61 places in 792 ms of which 3 ms to minimize.
[2024-05-22 06:24:58] [INFO ] Deduced a trap composed of 31 places in 659 ms of which 3 ms to minimize.
[2024-05-22 06:24:58] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 3 ms to minimize.
[2024-05-22 06:24:59] [INFO ] Deduced a trap composed of 31 places in 577 ms of which 3 ms to minimize.
[2024-05-22 06:24:59] [INFO ] Deduced a trap composed of 31 places in 541 ms of which 4 ms to minimize.
[2024-05-22 06:25:00] [INFO ] Deduced a trap composed of 31 places in 519 ms of which 3 ms to minimize.
[2024-05-22 06:25:00] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 4 ms to minimize.
[2024-05-22 06:25:01] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2024-05-22 06:25:02] [INFO ] Deduced a trap composed of 27 places in 817 ms of which 3 ms to minimize.
[2024-05-22 06:25:03] [INFO ] Deduced a trap composed of 38 places in 800 ms of which 4 ms to minimize.
[2024-05-22 06:25:04] [INFO ] Deduced a trap composed of 75 places in 788 ms of which 3 ms to minimize.
[2024-05-22 06:25:04] [INFO ] Deduced a trap composed of 23 places in 801 ms of which 3 ms to minimize.
[2024-05-22 06:25:05] [INFO ] Deduced a trap composed of 31 places in 790 ms of which 4 ms to minimize.
[2024-05-22 06:25:06] [INFO ] Deduced a trap composed of 43 places in 645 ms of which 4 ms to minimize.
[2024-05-22 06:25:07] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 3 ms to minimize.
[2024-05-22 06:25:07] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 3 ms to minimize.
[2024-05-22 06:25:08] [INFO ] Deduced a trap composed of 31 places in 558 ms of which 2 ms to minimize.
[2024-05-22 06:25:09] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 3 ms to minimize.
SMT process timed out in 47303ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 47318ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48685 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-02
Product exploration explored 100000 steps with 285 reset in 377 ms.
Product exploration explored 100000 steps with 0 reset in 252 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 22351 steps (182 resets) in 143 ms. (155 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 14 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2024-05-22 06:25:10] [INFO ] Invariant cache hit.
[2024-05-22 06:25:11] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-22 06:25:11] [INFO ] Invariant cache hit.
[2024-05-22 06:25:12] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:25:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:25:44] [INFO ] Deduced a trap composed of 21 places in 801 ms of which 4 ms to minimize.
[2024-05-22 06:25:45] [INFO ] Deduced a trap composed of 61 places in 777 ms of which 4 ms to minimize.
[2024-05-22 06:25:45] [INFO ] Deduced a trap composed of 31 places in 622 ms of which 4 ms to minimize.
[2024-05-22 06:25:46] [INFO ] Deduced a trap composed of 31 places in 599 ms of which 3 ms to minimize.
[2024-05-22 06:25:46] [INFO ] Deduced a trap composed of 31 places in 566 ms of which 3 ms to minimize.
[2024-05-22 06:25:47] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 3 ms to minimize.
[2024-05-22 06:25:47] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 3 ms to minimize.
[2024-05-22 06:25:48] [INFO ] Deduced a trap composed of 31 places in 475 ms of which 4 ms to minimize.
[2024-05-22 06:25:48] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 2 ms to minimize.
[2024-05-22 06:25:50] [INFO ] Deduced a trap composed of 27 places in 808 ms of which 3 ms to minimize.
[2024-05-22 06:25:50] [INFO ] Deduced a trap composed of 38 places in 817 ms of which 4 ms to minimize.
[2024-05-22 06:25:51] [INFO ] Deduced a trap composed of 75 places in 814 ms of which 3 ms to minimize.
[2024-05-22 06:25:52] [INFO ] Deduced a trap composed of 23 places in 828 ms of which 3 ms to minimize.
[2024-05-22 06:25:53] [INFO ] Deduced a trap composed of 31 places in 842 ms of which 4 ms to minimize.
[2024-05-22 06:25:54] [INFO ] Deduced a trap composed of 43 places in 655 ms of which 3 ms to minimize.
[2024-05-22 06:25:54] [INFO ] Deduced a trap composed of 31 places in 658 ms of which 3 ms to minimize.
[2024-05-22 06:25:55] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 2 ms to minimize.
[2024-05-22 06:25:55] [INFO ] Deduced a trap composed of 31 places in 563 ms of which 3 ms to minimize.
[2024-05-22 06:25:56] [INFO ] Deduced a trap composed of 31 places in 694 ms of which 4 ms to minimize.
[2024-05-22 06:25:57] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/1477 variables, and 34 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 1157/1157 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:26:07] [INFO ] Deduced a trap composed of 31 places in 549 ms of which 3 ms to minimize.
[2024-05-22 06:26:08] [INFO ] Deduced a trap composed of 14 places in 573 ms of which 3 ms to minimize.
[2024-05-22 06:26:08] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 2 ms to minimize.
[2024-05-22 06:26:09] [INFO ] Deduced a trap composed of 28 places in 591 ms of which 3 ms to minimize.
[2024-05-22 06:26:10] [INFO ] Deduced a trap composed of 33 places in 549 ms of which 3 ms to minimize.
[2024-05-22 06:26:10] [INFO ] Deduced a trap composed of 48 places in 538 ms of which 4 ms to minimize.
[2024-05-22 06:26:11] [INFO ] Deduced a trap composed of 34 places in 534 ms of which 3 ms to minimize.
[2024-05-22 06:26:11] [INFO ] Deduced a trap composed of 33 places in 511 ms of which 3 ms to minimize.
[2024-05-22 06:26:12] [INFO ] Deduced a trap composed of 36 places in 550 ms of which 4 ms to minimize.
[2024-05-22 06:26:12] [INFO ] Deduced a trap composed of 46 places in 599 ms of which 3 ms to minimize.
[2024-05-22 06:26:13] [INFO ] Deduced a trap composed of 38 places in 551 ms of which 3 ms to minimize.
[2024-05-22 06:26:14] [INFO ] Deduced a trap composed of 40 places in 502 ms of which 3 ms to minimize.
[2024-05-22 06:26:14] [INFO ] Deduced a trap composed of 32 places in 504 ms of which 3 ms to minimize.
[2024-05-22 06:26:15] [INFO ] Deduced a trap composed of 40 places in 545 ms of which 3 ms to minimize.
[2024-05-22 06:26:16] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 3 ms to minimize.
[2024-05-22 06:26:16] [INFO ] Deduced a trap composed of 43 places in 526 ms of which 3 ms to minimize.
[2024-05-22 06:26:17] [INFO ] Deduced a trap composed of 52 places in 712 ms of which 3 ms to minimize.
[2024-05-22 06:26:18] [INFO ] Deduced a trap composed of 43 places in 465 ms of which 3 ms to minimize.
[2024-05-22 06:26:18] [INFO ] Deduced a trap composed of 53 places in 482 ms of which 2 ms to minimize.
[2024-05-22 06:26:19] [INFO ] Deduced a trap composed of 48 places in 476 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:26:20] [INFO ] Deduced a trap composed of 42 places in 544 ms of which 3 ms to minimize.
[2024-05-22 06:26:20] [INFO ] Deduced a trap composed of 44 places in 500 ms of which 3 ms to minimize.
[2024-05-22 06:26:21] [INFO ] Deduced a trap composed of 29 places in 610 ms of which 3 ms to minimize.
[2024-05-22 06:26:22] [INFO ] Deduced a trap composed of 43 places in 539 ms of which 3 ms to minimize.
[2024-05-22 06:26:22] [INFO ] Deduced a trap composed of 45 places in 494 ms of which 3 ms to minimize.
[2024-05-22 06:26:23] [INFO ] Deduced a trap composed of 32 places in 529 ms of which 2 ms to minimize.
[2024-05-22 06:26:24] [INFO ] Deduced a trap composed of 45 places in 575 ms of which 6 ms to minimize.
[2024-05-22 06:26:24] [INFO ] Deduced a trap composed of 44 places in 541 ms of which 2 ms to minimize.
[2024-05-22 06:26:25] [INFO ] Deduced a trap composed of 46 places in 513 ms of which 3 ms to minimize.
[2024-05-22 06:26:25] [INFO ] Deduced a trap composed of 43 places in 507 ms of which 3 ms to minimize.
[2024-05-22 06:26:26] [INFO ] Deduced a trap composed of 30 places in 571 ms of which 3 ms to minimize.
[2024-05-22 06:26:27] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/1477 variables, and 66 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 0/1157 constraints, Known Traps: 52/52 constraints]
After SMT, in 75967ms problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 75985ms
Finished structural reductions in LTL mode , in 1 iterations and 77355 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (246 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31774 steps (38 resets) in 100 ms. (314 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 154 ms.
Entered a terminal (fully accepting) state of product in 53149 steps with 435 reset in 344 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-02 finished in 129152 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(G(p1)))))'
Support contains 15 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 282 edges and 321 vertex of which 4 / 321 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 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 166 rules applied. Total rules applied 281 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 313 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 314 place count 172 transition count 984
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 329 place count 163 transition count 981
Iterating global reduction 4 with 3 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
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 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 463 place count 98 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 464 place count 98 transition count 905
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 479 place count 83 transition count 772
Iterating global reduction 7 with 15 rules applied. Total rules applied 494 place count 83 transition count 772
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 502 place count 83 transition count 764
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 506 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 508 place count 79 transition count 760
Applied a total of 508 rules in 387 ms. Remains 79 /321 variables (removed 242) and now considering 760/1160 (removed 400) transitions.
// Phase 1: matrix 760 rows 79 cols
[2024-05-22 06:26:29] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 06:26:30] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 06:26:30] [INFO ] Invariant cache hit.
[2024-05-22 06:26:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:26:30] [INFO ] Implicit Places using invariants and state equation in 484 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 691 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/321 places, 760/1160 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 76 transition count 759
Applied a total of 2 rules in 53 ms. Remains 76 /77 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 76 cols
[2024-05-22 06:26:30] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 06:26:30] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 06:26:30] [INFO ] Invariant cache hit.
[2024-05-22 06:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:26:31] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/321 places, 759/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1801 ms. Remains : 76/321 places, 759/1160 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-04
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-04 finished in 1935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 15 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 19 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:26:31] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 06:26:31] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-22 06:26:31] [INFO ] Invariant cache hit.
[2024-05-22 06:26:32] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:27:06] [INFO ] Deduced a trap composed of 21 places in 709 ms of which 3 ms to minimize.
[2024-05-22 06:27:07] [INFO ] Deduced a trap composed of 61 places in 755 ms of which 3 ms to minimize.
[2024-05-22 06:27:08] [INFO ] Deduced a trap composed of 31 places in 632 ms of which 3 ms to minimize.
[2024-05-22 06:27:08] [INFO ] Deduced a trap composed of 31 places in 643 ms of which 3 ms to minimize.
[2024-05-22 06:27:09] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 3 ms to minimize.
[2024-05-22 06:27:09] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 3 ms to minimize.
[2024-05-22 06:27:10] [INFO ] Deduced a trap composed of 31 places in 455 ms of which 3 ms to minimize.
[2024-05-22 06:27:10] [INFO ] Deduced a trap composed of 31 places in 457 ms of which 3 ms to minimize.
[2024-05-22 06:27:11] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2024-05-22 06:27:12] [INFO ] Deduced a trap composed of 27 places in 817 ms of which 4 ms to minimize.
[2024-05-22 06:27:13] [INFO ] Deduced a trap composed of 38 places in 827 ms of which 3 ms to minimize.
[2024-05-22 06:27:14] [INFO ] Deduced a trap composed of 75 places in 817 ms of which 4 ms to minimize.
[2024-05-22 06:27:14] [INFO ] Deduced a trap composed of 23 places in 787 ms of which 3 ms to minimize.
[2024-05-22 06:27:15] [INFO ] Deduced a trap composed of 31 places in 746 ms of which 3 ms to minimize.
[2024-05-22 06:27:16] [INFO ] Deduced a trap composed of 43 places in 609 ms of which 3 ms to minimize.
[2024-05-22 06:27:16] [INFO ] Deduced a trap composed of 31 places in 626 ms of which 3 ms to minimize.
[2024-05-22 06:27:17] [INFO ] Deduced a trap composed of 31 places in 566 ms of which 4 ms to minimize.
[2024-05-22 06:27:18] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 3 ms to minimize.
[2024-05-22 06:27:18] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 3 ms to minimize.
[2024-05-22 06:27:19] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:27:20] [INFO ] Deduced a trap composed of 31 places in 583 ms of which 3 ms to minimize.
SMT process timed out in 48066ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 48082ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49149 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-05 finished in 49290 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(((G(p1) U X(p2))||p0))))'
Support contains 14 out of 321 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 272 edges and 321 vertex of which 4 / 321 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 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 166 rules applied. Total rules applied 281 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 312 place count 173 transition count 991
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 312 place count 173 transition count 985
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 324 place count 167 transition count 985
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 327 place count 164 transition count 982
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 164 transition count 982
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 163 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 163 transition count 973
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 334 place count 163 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 162 transition count 971
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 451 place count 104 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 104 transition count 911
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 462 place count 94 transition count 828
Iterating global reduction 6 with 10 rules applied. Total rules applied 472 place count 94 transition count 828
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 480 place count 94 transition count 820
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 7 with 4 rules applied. Total rules applied 484 place count 92 transition count 818
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 486 place count 90 transition count 816
Applied a total of 486 rules in 177 ms. Remains 90 /321 variables (removed 231) and now considering 816/1160 (removed 344) transitions.
// Phase 1: matrix 816 rows 90 cols
[2024-05-22 06:27:20] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 06:27:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 06:27:21] [INFO ] Invariant cache hit.
[2024-05-22 06:27:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:27:21] [INFO ] Implicit Places using invariants and state equation in 418 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 555 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/321 places, 816/1160 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 87 transition count 815
Applied a total of 2 rules in 47 ms. Remains 87 /88 variables (removed 1) and now considering 815/816 (removed 1) transitions.
// Phase 1: matrix 815 rows 87 cols
[2024-05-22 06:27:21] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:27:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 06:27:21] [INFO ] Invariant cache hit.
[2024-05-22 06:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:27:21] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/321 places, 815/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1288 ms. Remains : 87/321 places, 815/1160 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-06
Product exploration explored 100000 steps with 1008 reset in 338 ms.
Product exploration explored 100000 steps with 179 reset in 188 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 : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1294 resets) in 508 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 78 ms. (506 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (120 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
[2024-05-22 06:27:23] [INFO ] Invariant cache hit.
[2024-05-22 06:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 809/891 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/900 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/901 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/901 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/902 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/902 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 809/891 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/900 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/901 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/901 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/902 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/902 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/902 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/902 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3218 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3689ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 282 ms.
Support contains 14 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 815/815 transitions.
Graph (complete) has 973 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 86 transition count 812
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 83 transition count 809
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 81 transition count 789
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 81 transition count 789
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 1 with 4 rules applied. Total rules applied 17 place count 79 transition count 787
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 79 transition count 772
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 47 place count 64 transition count 772
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 773
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 63 transition count 773
Applied a total of 54 rules in 182 ms. Remains 63 /87 variables (removed 24) and now considering 773/815 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 63/87 places, 773/815 transitions.
RANDOM walk for 40000 steps (180 resets) in 650 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (163 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 550877 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 2
Probabilistic random walk after 550877 steps, saw 83892 distinct states, run finished after 3010 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 773 rows 63 cols
[2024-05-22 06:27:30] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:27:30] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 773/833 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/836 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/836 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 773/833 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/836 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:27:32] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 2 ms to minimize.
[2024-05-22 06:27:32] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2024-05-22 06:27:32] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:27:33] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 6 places in 396 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/836 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/836 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4430 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 4838ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1206 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 33 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 63/63 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 34 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2024-05-22 06:27:36] [INFO ] Invariant cache hit.
[2024-05-22 06:27:36] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 06:27:36] [INFO ] Invariant cache hit.
[2024-05-22 06:27:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:27:37] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-22 06:27:37] [INFO ] Redundant transitions in 71 ms returned []
Running 767 sub problems to find dead transitions.
[2024-05-22 06:27:37] [INFO ] Invariant cache hit.
[2024-05-22 06:27:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (OVERLAPS) 5/62 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
At refinement iteration 4 (OVERLAPS) 773/835 variables, 62/73 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 2/75 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 7 (OVERLAPS) 1/836 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 765 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 76 constraints, problems are : Problem set: 2 solved, 765 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 765 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 2 (OVERLAPS) 5/62 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 4 (OVERLAPS) 773/835 variables, 62/73 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 2/75 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 765 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 765 unsolved
SMT process timed out in 72768ms, After SMT, problems are : Problem set: 2 solved, 765 unsolved
Search for dead transitions found 2 dead transitions in 72778ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/63 places, 771/773 transitions.
Applied a total of 0 rules in 57 ms. Remains 63 /63 variables (removed 0) and now considering 771/771 (removed 0) transitions.
[2024-05-22 06:28:50] [INFO ] Redundant transitions in 228 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 73748 ms. Remains : 63/63 places, 771/773 transitions.
RANDOM walk for 38000 steps (178 resets) in 805 ms. (47 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 14 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 815/815 transitions.
Applied a total of 0 rules in 58 ms. Remains 87 /87 variables (removed 0) and now considering 815/815 (removed 0) transitions.
// Phase 1: matrix 815 rows 87 cols
[2024-05-22 06:28:51] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 06:28:51] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 06:28:51] [INFO ] Invariant cache hit.
[2024-05-22 06:28:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:28:52] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-05-22 06:28:52] [INFO ] Redundant transitions in 75 ms returned [578]
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 805 sub problems to find dead transitions.
// Phase 1: matrix 814 rows 87 cols
[2024-05-22 06:28:52] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (OVERLAPS) 7/85 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 4 (OVERLAPS) 813/898 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 2/900 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 98 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (OVERLAPS) 7/85 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 4 (OVERLAPS) 813/898 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/901 variables, and 157 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/87 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 61/805 constraints, Known Traps: 0/0 constraints]
After SMT, in 73921ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 73940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 814/815 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 85 transition count 812
Applied a total of 2 rules in 69 ms. Remains 85 /87 variables (removed 2) and now considering 812/814 (removed 2) transitions.
// Phase 1: matrix 812 rows 85 cols
[2024-05-22 06:30:06] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:30:06] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 06:30:06] [INFO ] Invariant cache hit.
[2024-05-22 06:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:30:07] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/87 places, 812/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75702 ms. Remains : 85/87 places, 812/815 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 : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1342 resets) in 1777 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (128 resets) in 92 ms. (430 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (120 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-22 06:30:07] [INFO ] Invariant cache hit.
[2024-05-22 06:30:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 811/893 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/896 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/897 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/897 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 97 constraints, problems are : Problem set: 0 solved, 2 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 811/893 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/896 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:30:09] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/896 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/896 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/897 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/897 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/897 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 897/897 variables, and 100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2274 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2702ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 544 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 812/812 transitions.
Graph (complete) has 966 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 84 transition count 810
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 81 transition count 807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 79 transition count 787
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 79 transition count 787
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 1 with 4 rules applied. Total rules applied 16 place count 77 transition count 785
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 77 transition count 770
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 62 transition count 770
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 62 transition count 770
Applied a total of 51 rules in 134 ms. Remains 62 /85 variables (removed 23) and now considering 770/812 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 62/85 places, 770/812 transitions.
RANDOM walk for 40000 steps (173 resets) in 1102 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (166 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (164 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 480355 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 480355 steps, saw 70771 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 770 rows 62 cols
[2024-05-22 06:30:14] [INFO ] Computed 11 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 770/830 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/832 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/832 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 770/830 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/832 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:30:16] [INFO ] Deduced a trap composed of 6 places in 681 ms of which 1 ms to minimize.
[2024-05-22 06:30:17] [INFO ] Deduced a trap composed of 6 places in 530 ms of which 2 ms to minimize.
[2024-05-22 06:30:17] [INFO ] Deduced a trap composed of 6 places in 503 ms of which 2 ms to minimize.
[2024-05-22 06:30:18] [INFO ] Deduced a trap composed of 7 places in 486 ms of which 1 ms to minimize.
[2024-05-22 06:30:19] [INFO ] Deduced a trap composed of 6 places in 519 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/832 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/832 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 5335ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 724 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 770/770 transitions.
Applied a total of 0 rules in 36 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 62/62 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 770/770 transitions.
Applied a total of 0 rules in 36 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-22 06:30:21] [INFO ] Invariant cache hit.
[2024-05-22 06:30:21] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 06:30:21] [INFO ] Invariant cache hit.
[2024-05-22 06:30:21] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-22 06:30:21] [INFO ] Redundant transitions in 63 ms returned []
Running 764 sub problems to find dead transitions.
[2024-05-22 06:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (OVERLAPS) 5/61 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 4 (OVERLAPS) 770/831 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 6 (OVERLAPS) 1/832 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/832 variables, and 73 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (OVERLAPS) 5/61 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 4 (OVERLAPS) 770/831 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 7 (OVERLAPS) 1/832 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 837 constraints, problems are : Problem set: 0 solved, 764 unsolved in 35057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints]
After SMT, in 79911ms problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 79927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80792 ms. Remains : 62/62 places, 770/770 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 31 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 06:31:41] [INFO ] Invariant cache hit.
[2024-05-22 06:31:41] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:31:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-22 06:31:42] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:31:43] [INFO ] Deduced a trap composed of 6 places in 519 ms of which 1 ms to minimize.
[2024-05-22 06:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
TRAPS : Iteration 1
[2024-05-22 06:31:44] [INFO ] Deduced a trap composed of 7 places in 562 ms of which 1 ms to minimize.
[2024-05-22 06:31:45] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 2 ms to minimize.
[2024-05-22 06:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1287 ms
TRAPS : Iteration 2
[2024-05-22 06:31:46] [INFO ] Deduced a trap composed of 6 places in 540 ms of which 1 ms to minimize.
[2024-05-22 06:31:46] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 1 ms to minimize.
[2024-05-22 06:31:47] [INFO ] Deduced a trap composed of 6 places in 577 ms of which 1 ms to minimize.
[2024-05-22 06:31:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2013 ms
TRAPS : Iteration 3
[2024-05-22 06:31:48] [INFO ] Deduced a trap composed of 6 places in 566 ms of which 2 ms to minimize.
[2024-05-22 06:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
TRAPS : Iteration 4
[2024-05-22 06:31:49] [INFO ] After 7302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:31:49] [INFO ] After 7724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 7856 ms.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 195 reset in 243 ms.
Product exploration explored 100000 steps with 303 reset in 315 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 812/812 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 789
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 78 transition count 787
Applied a total of 14 rules in 109 ms. Remains 78 /85 variables (removed 7) and now considering 787/812 (removed 25) transitions.
// Phase 1: matrix 787 rows 78 cols
[2024-05-22 06:31:50] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 06:31:51] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 06:31:51] [INFO ] Invariant cache hit.
[2024-05-22 06:31:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:31:51] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2024-05-22 06:31:51] [INFO ] Redundant transitions in 41 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-22 06:31:51] [INFO ] Invariant cache hit.
[2024-05-22 06:31:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (OVERLAPS) 786/863 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/863 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (OVERLAPS) 1/864 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/865 variables, and 89 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (OVERLAPS) 786/863 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/863 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 781 unsolved
SMT process timed out in 75121ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 75140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/85 places, 787/812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76120 ms. Remains : 78/85 places, 787/812 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-06 finished in 346603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
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 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
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 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 481 place count 89 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 896
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 499 place count 72 transition count 742
Iterating global reduction 6 with 17 rules applied. Total rules applied 516 place count 72 transition count 742
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 523 place count 72 transition count 735
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 527 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 528 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 68 transition count 731
Applied a total of 530 rules in 285 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-05-22 06:33:07] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 06:33:07] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-22 06:33:07] [INFO ] Invariant cache hit.
[2024-05-22 06:33:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:33:08] [INFO ] Implicit Places using invariants and state equation in 832 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1141 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 731/1160 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 65 transition count 730
Applied a total of 2 rules in 87 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-05-22 06:33:08] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 06:33:09] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-22 06:33:09] [INFO ] Invariant cache hit.
[2024-05-22 06:33:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:33:10] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/321 places, 730/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2866 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-07
Product exploration explored 100000 steps with 655 reset in 192 ms.
Product exploration explored 100000 steps with 189 reset in 112 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 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 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2098 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (130 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 810955 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 1
Probabilistic random walk after 810955 steps, saw 126854 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
[2024-05-22 06:33:13] [INFO ] Invariant cache hit.
[2024-05-22 06:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 692/712 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/793 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/794 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/795 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/795 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/795 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 692/712 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/793 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/794 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/794 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/795 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/795 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 207 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 53/65 places, 718/730 transitions.
RANDOM walk for 40000 steps (304 resets) in 749 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2749 steps (0 resets) in 12 ms. (211 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 144 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 75 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-05-22 06:33:16] [INFO ] Invariant cache hit.
[2024-05-22 06:33:16] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-22 06:33:16] [INFO ] Invariant cache hit.
[2024-05-22 06:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:33:17] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-05-22 06:33:17] [INFO ] Redundant transitions in 39 ms returned [555]
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 726 sub problems to find dead transitions.
// Phase 1: matrix 729 rows 65 cols
[2024-05-22 06:33:17] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 728/792 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (OVERLAPS) 1/793 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/794 variables, and 76 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 728/792 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/794 variables, and 801 constraints, problems are : Problem set: 0 solved, 726 unsolved in 31204 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/65 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
After SMT, in 76530ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 76544ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 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 63 transition count 727
Applied a total of 2 rules in 50 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-05-22 06:34:34] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:34:34] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-22 06:34:34] [INFO ] Invariant cache hit.
[2024-05-22 06:34:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:34:35] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79306 ms. Remains : 63/65 places, 727/730 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 107 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 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2202 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (150 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 830300 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 830300 steps, saw 130635 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-05-22 06:34:38] [INFO ] Invariant cache hit.
[2024-05-22 06:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/714 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/789 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/789 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/790 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/790 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/714 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/789 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/789 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/790 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/790 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 790/790 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1049ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 77 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 52/63 places, 715/727 transitions.
RANDOM walk for 31497 steps (288 resets) in 476 ms. (66 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 95 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1303 reset in 227 ms.
Product exploration explored 100000 steps with 805 reset in 185 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 45 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-05-22 06:34:40] [INFO ] Invariant cache hit.
[2024-05-22 06:34:41] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 06:34:41] [INFO ] Invariant cache hit.
[2024-05-22 06:34:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:34:41] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-22 06:34:41] [INFO ] Redundant transitions in 30 ms returned []
Running 725 sub problems to find dead transitions.
[2024-05-22 06:34:41] [INFO ] Invariant cache hit.
[2024-05-22 06:34:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/789 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/789 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (OVERLAPS) 1/790 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/790 variables, and 75 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/789 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/790 variables, and 799 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30694 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
After SMT, in 75022ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 75033ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76125 ms. Remains : 63/63 places, 727/727 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-07 finished in 169613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 14 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:35:56] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 06:35:57] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-22 06:35:57] [INFO ] Invariant cache hit.
[2024-05-22 06:35:58] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:36:32] [INFO ] Deduced a trap composed of 21 places in 835 ms of which 3 ms to minimize.
[2024-05-22 06:36:33] [INFO ] Deduced a trap composed of 61 places in 787 ms of which 3 ms to minimize.
[2024-05-22 06:36:33] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 3 ms to minimize.
[2024-05-22 06:36:34] [INFO ] Deduced a trap composed of 31 places in 630 ms of which 3 ms to minimize.
[2024-05-22 06:36:34] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 3 ms to minimize.
[2024-05-22 06:36:35] [INFO ] Deduced a trap composed of 31 places in 548 ms of which 3 ms to minimize.
[2024-05-22 06:36:36] [INFO ] Deduced a trap composed of 31 places in 499 ms of which 3 ms to minimize.
[2024-05-22 06:36:36] [INFO ] Deduced a trap composed of 31 places in 461 ms of which 3 ms to minimize.
[2024-05-22 06:36:36] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2024-05-22 06:36:38] [INFO ] Deduced a trap composed of 27 places in 793 ms of which 4 ms to minimize.
[2024-05-22 06:36:38] [INFO ] Deduced a trap composed of 38 places in 808 ms of which 3 ms to minimize.
[2024-05-22 06:36:39] [INFO ] Deduced a trap composed of 75 places in 771 ms of which 3 ms to minimize.
[2024-05-22 06:36:40] [INFO ] Deduced a trap composed of 23 places in 804 ms of which 3 ms to minimize.
[2024-05-22 06:36:41] [INFO ] Deduced a trap composed of 31 places in 810 ms of which 3 ms to minimize.
[2024-05-22 06:36:41] [INFO ] Deduced a trap composed of 43 places in 633 ms of which 4 ms to minimize.
[2024-05-22 06:36:42] [INFO ] Deduced a trap composed of 31 places in 671 ms of which 3 ms to minimize.
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 31 places in 600 ms of which 3 ms to minimize.
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 31 places in 543 ms of which 2 ms to minimize.
[2024-05-22 06:36:44] [INFO ] Deduced a trap composed of 31 places in 682 ms of which 3 ms to minimize.
SMT process timed out in 46174ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 46188ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47581 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08
Product exploration explored 100000 steps with 79 reset in 175 ms.
Product exploration explored 100000 steps with 169 reset in 194 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (206 resets) in 159 ms. (250 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2024-05-22 06:36:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 76/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 239/319 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1158/1477 variables, 319/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 239/319 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:36:46] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 3 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 31 places in 629 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1158/1477 variables, 319/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:36:48] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2940 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 302 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 1 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 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 738
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 738
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 69 transition count 730
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 5 with 2 rules applied. Total rules applied 529 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 539 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 549 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 57 transition count 718
Applied a total of 551 rules in 218 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 57/319 places, 718/1158 transitions.
RANDOM walk for 34781 steps (252 resets) in 632 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2024-05-22 06:36:49] [INFO ] Invariant cache hit.
[2024-05-22 06:36:50] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-22 06:36:50] [INFO ] Invariant cache hit.
[2024-05-22 06:36:51] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:36:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:37:27] [INFO ] Deduced a trap composed of 21 places in 749 ms of which 4 ms to minimize.
[2024-05-22 06:37:28] [INFO ] Deduced a trap composed of 61 places in 796 ms of which 3 ms to minimize.
[2024-05-22 06:37:28] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 3 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 31 places in 623 ms of which 3 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 31 places in 577 ms of which 4 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 31 places in 552 ms of which 3 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 31 places in 495 ms of which 3 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 31 places in 484 ms of which 3 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 27 places in 810 ms of which 4 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 38 places in 804 ms of which 3 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 75 places in 806 ms of which 4 ms to minimize.
[2024-05-22 06:37:35] [INFO ] Deduced a trap composed of 23 places in 816 ms of which 4 ms to minimize.
[2024-05-22 06:37:36] [INFO ] Deduced a trap composed of 31 places in 814 ms of which 3 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 43 places in 654 ms of which 3 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 3 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 3 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 31 places in 580 ms of which 3 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 3 ms to minimize.
SMT process timed out in 48645ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 48659ms
Finished structural reductions in LTL mode , in 1 iterations and 50052 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (295 resets) in 266 ms. (149 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-22 06:37:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 76/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 239/319 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1158/1477 variables, 319/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 239/319 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 3 ms to minimize.
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 31 places in 700 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1158/1477 variables, 319/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:37:43] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 302 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 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 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
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 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 738
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 738
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 69 transition count 730
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 5 with 2 rules applied. Total rules applied 529 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 539 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 549 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 57 transition count 718
Applied a total of 551 rules in 203 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 57/319 places, 718/1158 transitions.
RANDOM walk for 40000 steps (295 resets) in 488 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2796 steps (0 resets) in 8 ms. (310 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 762 reset in 487 ms.
Product exploration explored 100000 steps with 829 reset in 505 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 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.
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 317 transition count 1156
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 135 place count 317 transition count 1135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 135 place count 317 transition count 1135
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 317 transition count 1135
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 254 place count 221 transition count 1039
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 350 place count 221 transition count 1039
Performed 89 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 439 place count 221 transition count 1051
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 441 place count 221 transition count 1049
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 515 place count 147 transition count 830
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 3 with 74 rules applied. Total rules applied 589 place count 147 transition count 830
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 605 place count 147 transition count 814
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 614 place count 138 transition count 805
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 623 place count 138 transition count 805
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 138 transition count 805
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 626 place count 136 transition count 803
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 628 place count 136 transition count 803
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 629 place count 136 transition count 805
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 629 rules in 272 ms. Remains 136 /319 variables (removed 183) and now considering 805/1158 (removed 353) transitions.
[2024-05-22 06:37:46] [INFO ] Redundant transitions in 26 ms returned []
Running 804 sub problems to find dead transitions.
// Phase 1: matrix 805 rows 136 cols
[2024-05-22 06:37:46] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 06:37:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-22 06:38:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:38:09] [INFO ] Deduced a trap composed of 21 places in 662 ms of which 2 ms to minimize.
[2024-05-22 06:38:10] [INFO ] Deduced a trap composed of 5 places in 680 ms of which 3 ms to minimize.
[2024-05-22 06:38:10] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 3 ms to minimize.
[2024-05-22 06:38:11] [INFO ] Deduced a trap composed of 5 places in 680 ms of which 2 ms to minimize.
[2024-05-22 06:38:12] [INFO ] Deduced a trap composed of 15 places in 632 ms of which 2 ms to minimize.
[2024-05-22 06:38:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 06:38:12] [INFO ] Deduced a trap composed of 10 places in 586 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-22 06:38:13] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-22 06:38:13] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 2 ms to minimize.
[2024-05-22 06:38:15] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 2 ms to minimize.
[2024-05-22 06:38:15] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 2 ms to minimize.
[2024-05-22 06:38:16] [INFO ] Deduced a trap composed of 15 places in 466 ms of which 2 ms to minimize.
[2024-05-22 06:38:16] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 2 ms to minimize.
[2024-05-22 06:38:17] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 2 ms to minimize.
[2024-05-22 06:38:17] [INFO ] Deduced a trap composed of 15 places in 373 ms of which 2 ms to minimize.
[2024-05-22 06:38:20] [INFO ] Deduced a trap composed of 15 places in 475 ms of which 2 ms to minimize.
Problem TDEAD544 is UNSAT
[2024-05-22 06:38:21] [INFO ] Deduced a trap composed of 6 places in 368 ms of which 1 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-05-22 06:38:21] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
Problem TDEAD546 is UNSAT
[2024-05-22 06:38:22] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 20/33 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-22 06:38:22] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 2 ms to minimize.
[2024-05-22 06:38:27] [INFO ] Deduced a trap composed of 6 places in 398 ms of which 2 ms to minimize.
Problem TDEAD548 is UNSAT
[2024-05-22 06:38:28] [INFO ] Deduced a trap composed of 6 places in 422 ms of which 1 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-05-22 06:38:28] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 2 ms to minimize.
Problem TDEAD550 is UNSAT
[2024-05-22 06:38:29] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 2 ms to minimize.
Problem TDEAD551 is UNSAT
[2024-05-22 06:38:29] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 2 ms to minimize.
Problem TDEAD552 is UNSAT
[2024-05-22 06:38:29] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 2 ms to minimize.
Problem TDEAD554 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 7/40 constraints. Problems are: Problem set: 58 solved, 746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/941 variables, and 40 constraints, problems are : Problem set: 58 solved, 746 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/136 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 58 solved, 746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 58 solved, 746 unsolved
At refinement iteration 1 (OVERLAPS) 57/136 variables, 13/13 constraints. Problems are: Problem set: 58 solved, 746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 27/40 constraints. Problems are: Problem set: 58 solved, 746 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 58 solved, 746 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD629 is UNSAT
At refinement iteration 4 (OVERLAPS) 804/940 variables, 136/176 constraints. Problems are: Problem set: 72 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/940 variables, 1/177 constraints. Problems are: Problem set: 72 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/941 variables, and 909 constraints, problems are : Problem set: 72 solved, 732 unsolved in 31720 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 136/136 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 732/804 constraints, Known Traps: 27/27 constraints]
After SMT, in 77521ms problems are : Problem set: 72 solved, 732 unsolved
Search for dead transitions found 72 dead transitions in 77539ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 136/319 places, 733/1158 transitions.
Graph (complete) has 896 edges and 136 vertex of which 71 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.3 ms
Discarding 65 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 733
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 59 ms. Remains 71 /136 variables (removed 65) and now considering 733/733 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/319 places, 733/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77907 ms. Remains : 71/319 places, 733/1158 transitions.
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:39:03] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 06:39:04] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-22 06:39:04] [INFO ] Invariant cache hit.
[2024-05-22 06:39:05] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:39:39] [INFO ] Deduced a trap composed of 21 places in 813 ms of which 4 ms to minimize.
[2024-05-22 06:39:40] [INFO ] Deduced a trap composed of 61 places in 865 ms of which 4 ms to minimize.
[2024-05-22 06:39:40] [INFO ] Deduced a trap composed of 31 places in 659 ms of which 3 ms to minimize.
[2024-05-22 06:39:41] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 4 ms to minimize.
[2024-05-22 06:39:42] [INFO ] Deduced a trap composed of 31 places in 577 ms of which 4 ms to minimize.
[2024-05-22 06:39:42] [INFO ] Deduced a trap composed of 31 places in 546 ms of which 3 ms to minimize.
[2024-05-22 06:39:43] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 3 ms to minimize.
[2024-05-22 06:39:43] [INFO ] Deduced a trap composed of 31 places in 488 ms of which 3 ms to minimize.
[2024-05-22 06:39:44] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 2 ms to minimize.
[2024-05-22 06:39:45] [INFO ] Deduced a trap composed of 27 places in 796 ms of which 3 ms to minimize.
[2024-05-22 06:39:45] [INFO ] Deduced a trap composed of 38 places in 796 ms of which 4 ms to minimize.
[2024-05-22 06:39:46] [INFO ] Deduced a trap composed of 75 places in 805 ms of which 4 ms to minimize.
[2024-05-22 06:39:47] [INFO ] Deduced a trap composed of 23 places in 800 ms of which 4 ms to minimize.
[2024-05-22 06:39:48] [INFO ] Deduced a trap composed of 31 places in 816 ms of which 4 ms to minimize.
[2024-05-22 06:39:49] [INFO ] Deduced a trap composed of 43 places in 642 ms of which 4 ms to minimize.
[2024-05-22 06:39:49] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 3 ms to minimize.
[2024-05-22 06:39:50] [INFO ] Deduced a trap composed of 31 places in 606 ms of which 3 ms to minimize.
[2024-05-22 06:39:50] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 3 ms to minimize.
[2024-05-22 06:39:51] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 3 ms to minimize.
SMT process timed out in 46339ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 46353ms
Finished structural reductions in LTL mode , in 1 iterations and 47891 ms. Remains : 319/319 places, 1158/1158 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 234874 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(G(p1)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 303 edges and 321 vertex of which 4 / 321 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
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 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
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 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 479 place count 90 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 480 place count 90 transition count 897
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 496 place count 74 transition count 752
Iterating global reduction 6 with 16 rules applied. Total rules applied 512 place count 74 transition count 752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 518 place count 74 transition count 746
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 7 with 4 rules applied. Total rules applied 522 place count 72 transition count 744
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 524 place count 72 transition count 744
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 70 transition count 742
Applied a total of 526 rules in 293 ms. Remains 70 /321 variables (removed 251) and now considering 742/1160 (removed 418) transitions.
// Phase 1: matrix 742 rows 70 cols
[2024-05-22 06:39:52] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 06:39:52] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-22 06:39:52] [INFO ] Invariant cache hit.
[2024-05-22 06:39:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:39:53] [INFO ] Implicit Places using invariants and state equation in 643 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1009 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/321 places, 742/1160 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 67 transition count 741
Applied a total of 2 rules in 65 ms. Remains 67 /68 variables (removed 1) and now considering 741/742 (removed 1) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-22 06:39:53] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:39:53] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-22 06:39:53] [INFO ] Invariant cache hit.
[2024-05-22 06:39:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:39:54] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/321 places, 741/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2332 ms. Remains : 67/321 places, 741/1160 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-09
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-09 finished in 2463 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 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
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 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
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 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 481 place count 89 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 896
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 499 place count 72 transition count 742
Iterating global reduction 6 with 17 rules applied. Total rules applied 516 place count 72 transition count 742
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 523 place count 72 transition count 735
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 7 with 4 rules applied. Total rules applied 527 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 528 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 68 transition count 731
Applied a total of 530 rules in 241 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-05-22 06:39:54] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 06:39:54] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-22 06:39:54] [INFO ] Invariant cache hit.
[2024-05-22 06:39:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:39:55] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 928 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 731/1160 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 65 transition count 730
Applied a total of 2 rules in 55 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-05-22 06:39:55] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:39:55] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-22 06:39:55] [INFO ] Invariant cache hit.
[2024-05-22 06:39:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:39:56] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/321 places, 730/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2159 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-10
Product exploration explored 100000 steps with 14 reset in 72 ms.
Product exploration explored 100000 steps with 406 reset in 137 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 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2101 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 861184 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 1
Probabilistic random walk after 861184 steps, saw 133816 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
[2024-05-22 06:39:59] [INFO ] Invariant cache hit.
[2024-05-22 06:39:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 692/712 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/793 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/794 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/795 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/795 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/795 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 692/712 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/793 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/794 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/794 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/795 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/795 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1130ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 119 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 53/65 places, 718/730 transitions.
RANDOM walk for 35025 steps (299 resets) in 415 ms. (84 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 46 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-05-22 06:40:01] [INFO ] Invariant cache hit.
[2024-05-22 06:40:01] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-22 06:40:01] [INFO ] Invariant cache hit.
[2024-05-22 06:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:40:02] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2024-05-22 06:40:02] [INFO ] Redundant transitions in 26 ms returned [555]
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 726 sub problems to find dead transitions.
// Phase 1: matrix 729 rows 65 cols
[2024-05-22 06:40:02] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 728/792 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (OVERLAPS) 1/793 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/794 variables, and 76 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 728/792 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/794 variables, and 801 constraints, problems are : Problem set: 0 solved, 726 unsolved in 31199 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/65 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
After SMT, in 76025ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 76034ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 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 63 transition count 727
Applied a total of 2 rules in 55 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-05-22 06:41:18] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 06:41:19] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-22 06:41:19] [INFO ] Invariant cache hit.
[2024-05-22 06:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:41:19] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77990 ms. Remains : 63/65 places, 727/730 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 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2200 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (156 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 867473 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 1
Probabilistic random walk after 867473 steps, saw 135868 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
[2024-05-22 06:41:22] [INFO ] Invariant cache hit.
[2024-05-22 06:41:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/714 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/789 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/789 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/790 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/790 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/714 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/789 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/789 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/790 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/790 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 790/790 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 80 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 52/63 places, 715/727 transitions.
RANDOM walk for 31040 steps (250 resets) in 487 ms. (63 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 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 498 reset in 132 ms.
Product exploration explored 100000 steps with 950 reset in 203 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 46 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-05-22 06:41:24] [INFO ] Invariant cache hit.
[2024-05-22 06:41:25] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-22 06:41:25] [INFO ] Invariant cache hit.
[2024-05-22 06:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:41:25] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
[2024-05-22 06:41:25] [INFO ] Redundant transitions in 26 ms returned []
Running 725 sub problems to find dead transitions.
[2024-05-22 06:41:25] [INFO ] Invariant cache hit.
[2024-05-22 06:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/789 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/789 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (OVERLAPS) 1/790 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/790 variables, and 75 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/789 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/790 variables, and 799 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30690 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
After SMT, in 74845ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 74856ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75852 ms. Remains : 63/63 places, 727/727 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-10 finished in 166550 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 10 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 287 edges and 321 vertex of which 4 / 321 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
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 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
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 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 465 place count 97 transition count 905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 466 place count 97 transition count 904
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 479 place count 84 transition count 791
Iterating global reduction 6 with 13 rules applied. Total rules applied 492 place count 84 transition count 791
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 500 place count 84 transition count 783
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 7 with 4 rules applied. Total rules applied 504 place count 82 transition count 781
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 506 place count 80 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 507 place count 79 transition count 779
Applied a total of 507 rules in 213 ms. Remains 79 /321 variables (removed 242) and now considering 779/1160 (removed 381) transitions.
// Phase 1: matrix 779 rows 79 cols
[2024-05-22 06:42:41] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 06:42:41] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 06:42:41] [INFO ] Invariant cache hit.
[2024-05-22 06:42:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:42:41] [INFO ] Implicit Places using invariants and state equation in 504 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 751 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/321 places, 779/1160 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 76 transition count 778
Applied a total of 2 rules in 50 ms. Remains 76 /77 variables (removed 1) and now considering 778/779 (removed 1) transitions.
// Phase 1: matrix 778 rows 76 cols
[2024-05-22 06:42:41] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 06:42:42] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 06:42:42] [INFO ] Invariant cache hit.
[2024-05-22 06:42:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:42:42] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/321 places, 778/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1682 ms. Remains : 76/321 places, 778/1160 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-11
Product exploration explored 100000 steps with 603 reset in 189 ms.
Product exploration explored 100000 steps with 289 reset in 373 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 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1590 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23703 steps (87 resets) in 57 ms. (408 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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 778/778 transitions.
Applied a total of 0 rules in 38 ms. Remains 76 /76 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-05-22 06:42:43] [INFO ] Invariant cache hit.
[2024-05-22 06:42:43] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 06:42:43] [INFO ] Invariant cache hit.
[2024-05-22 06:42:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:42:44] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-22 06:42:44] [INFO ] Redundant transitions in 28 ms returned [568]
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 771 sub problems to find dead transitions.
// Phase 1: matrix 777 rows 76 cols
[2024-05-22 06:42:44] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 06:42:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (OVERLAPS) 4/74 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (OVERLAPS) 776/850 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 2/852 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 86 constraints, problems are : Problem set: 0 solved, 771 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 76/76 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 771 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (OVERLAPS) 4/74 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (OVERLAPS) 776/850 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/850 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 7 (OVERLAPS) 2/852 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 857 constraints, problems are : Problem set: 0 solved, 771 unsolved in 34240 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 76/76 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 0/0 constraints]
After SMT, in 78056ms problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 78065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 777/778 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 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 775
Applied a total of 2 rules in 44 ms. Remains 74 /76 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 74 cols
[2024-05-22 06:44:02] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 06:44:02] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 06:44:02] [INFO ] Invariant cache hit.
[2024-05-22 06:44:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:44:03] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/76 places, 775/778 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79544 ms. Remains : 74/76 places, 775/778 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 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1622 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 18255 steps (61 resets) in 34 ms. (521 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 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 121 reset in 96 ms.
Product exploration explored 100000 steps with 654 reset in 202 ms.
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 775/775 transitions.
Applied a total of 0 rules in 38 ms. Remains 74 /74 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2024-05-22 06:44:04] [INFO ] Invariant cache hit.
[2024-05-22 06:44:04] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 06:44:04] [INFO ] Invariant cache hit.
[2024-05-22 06:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:44:05] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-22 06:44:05] [INFO ] Redundant transitions in 27 ms returned []
Running 770 sub problems to find dead transitions.
[2024-05-22 06:44:05] [INFO ] Invariant cache hit.
[2024-05-22 06:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 4 (OVERLAPS) 774/847 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 6 (OVERLAPS) 1/848 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/849 variables, and 84 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 4 (OVERLAPS) 774/847 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 7 (OVERLAPS) 1/848 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/849 variables, and 854 constraints, problems are : Problem set: 0 solved, 770 unsolved in 33052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 0/0 constraints]
After SMT, in 77355ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 77365ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78158 ms. Remains : 74/74 places, 775/775 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-11 finished in 161761 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))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 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 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 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 163 rules applied. Total rules applied 278 place count 204 transition count 994
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 307 place count 175 transition count 994
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 307 place count 175 transition count 986
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 323 place count 167 transition count 986
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 326 place count 164 transition count 983
Iterating global reduction 3 with 3 rules applied. Total rules applied 329 place count 164 transition count 983
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 163 transition count 974
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 163 transition count 974
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 333 place count 163 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 480 place count 89 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 481 place count 89 transition count 897
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 499 place count 71 transition count 734
Iterating global reduction 6 with 18 rules applied. Total rules applied 517 place count 71 transition count 734
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 525 place count 71 transition count 726
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 529 place count 69 transition count 724
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 531 place count 67 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 532 place count 66 transition count 722
Applied a total of 532 rules in 169 ms. Remains 66 /321 variables (removed 255) and now considering 722/1160 (removed 438) transitions.
// Phase 1: matrix 722 rows 66 cols
[2024-05-22 06:45:22] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 06:45:23] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 06:45:23] [INFO ] Invariant cache hit.
[2024-05-22 06:45:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:45:23] [INFO ] Implicit Places using invariants and state equation in 588 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 955 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/321 places, 722/1160 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 63 transition count 721
Applied a total of 2 rules in 42 ms. Remains 63 /64 variables (removed 1) and now considering 721/722 (removed 1) transitions.
// Phase 1: matrix 721 rows 63 cols
[2024-05-22 06:45:23] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 06:45:24] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-22 06:45:24] [INFO ] Invariant cache hit.
[2024-05-22 06:45:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:45:24] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/321 places, 721/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2088 ms. Remains : 63/321 places, 721/1160 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-12
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-12 finished in 2144 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((p0&&G(F(p1))))))))'
Support contains 11 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 320 transition count 1159
Applied a total of 2 rules in 13 ms. Remains 320 /321 variables (removed 1) and now considering 1159/1160 (removed 1) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-05-22 06:45:24] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 06:45:25] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 06:45:25] [INFO ] Invariant cache hit.
[2024-05-22 06:45:25] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-05-22 06:45:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-22 06:46:00] [INFO ] Deduced a trap composed of 31 places in 812 ms of which 4 ms to minimize.
[2024-05-22 06:46:01] [INFO ] Deduced a trap composed of 71 places in 749 ms of which 4 ms to minimize.
[2024-05-22 06:46:02] [INFO ] Deduced a trap composed of 22 places in 679 ms of which 5 ms to minimize.
[2024-05-22 06:46:03] [INFO ] Deduced a trap composed of 24 places in 686 ms of which 4 ms to minimize.
[2024-05-22 06:46:03] [INFO ] Deduced a trap composed of 74 places in 747 ms of which 3 ms to minimize.
[2024-05-22 06:46:05] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 3 ms to minimize.
[2024-05-22 06:46:05] [INFO ] Deduced a trap composed of 31 places in 733 ms of which 3 ms to minimize.
[2024-05-22 06:46:06] [INFO ] Deduced a trap composed of 23 places in 714 ms of which 3 ms to minimize.
[2024-05-22 06:46:07] [INFO ] Deduced a trap composed of 24 places in 750 ms of which 3 ms to minimize.
[2024-05-22 06:46:07] [INFO ] Deduced a trap composed of 42 places in 678 ms of which 3 ms to minimize.
[2024-05-22 06:46:08] [INFO ] Deduced a trap composed of 44 places in 743 ms of which 3 ms to minimize.
[2024-05-22 06:46:09] [INFO ] Deduced a trap composed of 47 places in 748 ms of which 3 ms to minimize.
[2024-05-22 06:46:10] [INFO ] Deduced a trap composed of 49 places in 778 ms of which 3 ms to minimize.
[2024-05-22 06:46:11] [INFO ] Deduced a trap composed of 45 places in 773 ms of which 3 ms to minimize.
[2024-05-22 06:46:11] [INFO ] Deduced a trap composed of 49 places in 803 ms of which 4 ms to minimize.
[2024-05-22 06:46:12] [INFO ] Deduced a trap composed of 43 places in 688 ms of which 3 ms to minimize.
[2024-05-22 06:46:13] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 3 ms to minimize.
SMT process timed out in 47446ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 47460ms
Starting structural reductions in LTL mode, iteration 1 : 320/321 places, 1159/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48527 ms. Remains : 320/321 places, 1159/1160 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13
Product exploration explored 100000 steps with 660 reset in 300 ms.
Product exploration explored 100000 steps with 826 reset in 449 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (267 resets) in 424 ms. (94 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (60 resets) in 155 ms. (256 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (61 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-22 06:46:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 259/270 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/320 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1159/1479 variables, 320/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1479 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1479/1479 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 320/320 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 270/1479 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2024-05-22 06:46:15] [INFO ] Invariant cache hit.
[2024-05-22 06:46:16] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-22 06:46:16] [INFO ] Invariant cache hit.
[2024-05-22 06:46:16] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-05-22 06:46:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-22 06:46:50] [INFO ] Deduced a trap composed of 31 places in 830 ms of which 3 ms to minimize.
[2024-05-22 06:46:51] [INFO ] Deduced a trap composed of 71 places in 734 ms of which 3 ms to minimize.
[2024-05-22 06:46:51] [INFO ] Deduced a trap composed of 22 places in 656 ms of which 3 ms to minimize.
[2024-05-22 06:46:52] [INFO ] Deduced a trap composed of 24 places in 684 ms of which 3 ms to minimize.
[2024-05-22 06:46:53] [INFO ] Deduced a trap composed of 74 places in 774 ms of which 4 ms to minimize.
[2024-05-22 06:46:54] [INFO ] Deduced a trap composed of 27 places in 771 ms of which 3 ms to minimize.
[2024-05-22 06:46:55] [INFO ] Deduced a trap composed of 31 places in 730 ms of which 3 ms to minimize.
[2024-05-22 06:46:56] [INFO ] Deduced a trap composed of 23 places in 729 ms of which 3 ms to minimize.
[2024-05-22 06:46:56] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 3 ms to minimize.
[2024-05-22 06:46:57] [INFO ] Deduced a trap composed of 42 places in 724 ms of which 3 ms to minimize.
[2024-05-22 06:46:58] [INFO ] Deduced a trap composed of 44 places in 730 ms of which 3 ms to minimize.
[2024-05-22 06:46:59] [INFO ] Deduced a trap composed of 47 places in 773 ms of which 3 ms to minimize.
[2024-05-22 06:46:59] [INFO ] Deduced a trap composed of 49 places in 783 ms of which 3 ms to minimize.
[2024-05-22 06:47:00] [INFO ] Deduced a trap composed of 45 places in 783 ms of which 3 ms to minimize.
[2024-05-22 06:47:01] [INFO ] Deduced a trap composed of 49 places in 798 ms of which 4 ms to minimize.
[2024-05-22 06:47:02] [INFO ] Deduced a trap composed of 43 places in 659 ms of which 3 ms to minimize.
[2024-05-22 06:47:02] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 2 ms to minimize.
[2024-05-22 06:47:03] [INFO ] Deduced a trap composed of 31 places in 677 ms of which 3 ms to minimize.
SMT process timed out in 46743ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 46757ms
Finished structural reductions in LTL mode , in 1 iterations and 47811 ms. Remains : 320/320 places, 1159/1159 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18225 steps (146 resets) in 79 ms. (227 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 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 446 reset in 317 ms.
Product exploration explored 100000 steps with 25 reset in 218 ms.
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2024-05-22 06:47:04] [INFO ] Invariant cache hit.
[2024-05-22 06:47:05] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-22 06:47:05] [INFO ] Invariant cache hit.
[2024-05-22 06:47:06] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-05-22 06:47:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-22 06:47:39] [INFO ] Deduced a trap composed of 31 places in 801 ms of which 4 ms to minimize.
[2024-05-22 06:47:39] [INFO ] Deduced a trap composed of 71 places in 750 ms of which 3 ms to minimize.
[2024-05-22 06:47:40] [INFO ] Deduced a trap composed of 22 places in 686 ms of which 4 ms to minimize.
[2024-05-22 06:47:41] [INFO ] Deduced a trap composed of 24 places in 700 ms of which 3 ms to minimize.
[2024-05-22 06:47:42] [INFO ] Deduced a trap composed of 74 places in 746 ms of which 3 ms to minimize.
[2024-05-22 06:47:43] [INFO ] Deduced a trap composed of 27 places in 787 ms of which 4 ms to minimize.
[2024-05-22 06:47:44] [INFO ] Deduced a trap composed of 31 places in 708 ms of which 3 ms to minimize.
[2024-05-22 06:47:44] [INFO ] Deduced a trap composed of 23 places in 740 ms of which 3 ms to minimize.
[2024-05-22 06:47:45] [INFO ] Deduced a trap composed of 24 places in 716 ms of which 3 ms to minimize.
[2024-05-22 06:47:46] [INFO ] Deduced a trap composed of 42 places in 742 ms of which 3 ms to minimize.
[2024-05-22 06:47:47] [INFO ] Deduced a trap composed of 44 places in 728 ms of which 3 ms to minimize.
[2024-05-22 06:47:47] [INFO ] Deduced a trap composed of 47 places in 758 ms of which 3 ms to minimize.
[2024-05-22 06:47:48] [INFO ] Deduced a trap composed of 49 places in 738 ms of which 3 ms to minimize.
[2024-05-22 06:47:49] [INFO ] Deduced a trap composed of 45 places in 774 ms of which 3 ms to minimize.
[2024-05-22 06:47:50] [INFO ] Deduced a trap composed of 49 places in 782 ms of which 4 ms to minimize.
[2024-05-22 06:47:50] [INFO ] Deduced a trap composed of 43 places in 666 ms of which 3 ms to minimize.
[2024-05-22 06:47:51] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 3 ms to minimize.
[2024-05-22 06:47:52] [INFO ] Deduced a trap composed of 31 places in 675 ms of which 2 ms to minimize.
SMT process timed out in 46074ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 46088ms
Finished structural reductions in LTL mode , in 1 iterations and 47465 ms. Remains : 320/320 places, 1159/1159 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 147727 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) U G((!p1||X(G(!p1))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 15 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:47:52] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 06:47:52] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-22 06:47:52] [INFO ] Invariant cache hit.
[2024-05-22 06:47:53] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 21 places in 860 ms of which 8 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 61 places in 826 ms of which 4 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 31 places in 681 ms of which 3 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 3 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 31 places in 584 ms of which 3 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 31 places in 571 ms of which 3 ms to minimize.
[2024-05-22 06:48:32] [INFO ] Deduced a trap composed of 31 places in 533 ms of which 3 ms to minimize.
[2024-05-22 06:48:32] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 3 ms to minimize.
[2024-05-22 06:48:33] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 1 ms to minimize.
[2024-05-22 06:48:34] [INFO ] Deduced a trap composed of 27 places in 818 ms of which 4 ms to minimize.
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 38 places in 857 ms of which 3 ms to minimize.
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 75 places in 810 ms of which 4 ms to minimize.
[2024-05-22 06:48:36] [INFO ] Deduced a trap composed of 23 places in 794 ms of which 3 ms to minimize.
[2024-05-22 06:48:37] [INFO ] Deduced a trap composed of 31 places in 804 ms of which 4 ms to minimize.
[2024-05-22 06:48:38] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 3 ms to minimize.
[2024-05-22 06:48:38] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 3 ms to minimize.
[2024-05-22 06:48:39] [INFO ] Deduced a trap composed of 31 places in 596 ms of which 3 ms to minimize.
[2024-05-22 06:48:39] [INFO ] Deduced a trap composed of 31 places in 550 ms of which 2 ms to minimize.
[2024-05-22 06:48:40] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 3 ms to minimize.
[2024-05-22 06:48:41] [INFO ] Deduced a trap composed of 31 places in 662 ms of which 3 ms to minimize.
SMT process timed out in 47518ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 47533ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48912 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 261 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15
Product exploration explored 100000 steps with 25035 reset in 250 ms.
Product exploration explored 100000 steps with 25039 reset in 294 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 138 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
RANDOM walk for 40000 steps (328 resets) in 3966 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (51 resets) in 701 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 641 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 570 ms. (70 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
[2024-05-22 06:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1158/1477 variables, 319/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1477 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 333 constraints, problems are : Problem set: 1 solved, 2 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 31 places in 693 ms of which 3 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 31 places in 687 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1158/1477 variables, 319/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 2/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1477 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 338 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 3767ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 359 ms.
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 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 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
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 332 place count 162 transition count 977
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 480 place count 88 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 88 transition count 902
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 498 place count 71 transition count 749
Iterating global reduction 4 with 17 rules applied. Total rules applied 515 place count 71 transition count 749
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 523 place count 71 transition count 741
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 5 with 2 rules applied. Total rules applied 525 place count 70 transition count 740
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 536 place count 70 transition count 729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 547 place count 59 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 548 place count 59 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 58 transition count 728
Applied a total of 549 rules in 216 ms. Remains 58 /319 variables (removed 261) and now considering 728/1158 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 58/319 places, 728/1158 transitions.
RANDOM walk for 40000 steps (270 resets) in 1615 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 518297 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 518297 steps, saw 78993 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
// Phase 1: matrix 728 rows 58 cols
[2024-05-22 06:48:52] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 06:48:52] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 704/729 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/786 variables, 33/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/786 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 704/729 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/786 variables, 33/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/786 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1374ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 728/728 transitions.
Applied a total of 0 rules in 37 ms. Remains 58 /58 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 58/58 places, 728/728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 728/728 transitions.
Applied a total of 0 rules in 38 ms. Remains 58 /58 variables (removed 0) and now considering 728/728 (removed 0) transitions.
[2024-05-22 06:48:53] [INFO ] Invariant cache hit.
[2024-05-22 06:48:54] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 06:48:54] [INFO ] Invariant cache hit.
[2024-05-22 06:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:48:54] [INFO ] Implicit Places using invariants and state equation in 600 ms returned [53, 57]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/58 places, 727/728 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 55 transition count 726
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 55 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 54 transition count 725
Applied a total of 4 rules in 84 ms. Remains 54 /56 variables (removed 2) and now considering 725/727 (removed 2) transitions.
// Phase 1: matrix 725 rows 54 cols
[2024-05-22 06:48:54] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 06:48:55] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 06:48:55] [INFO ] Invariant cache hit.
[2024-05-22 06:48:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:48:55] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 54/58 places, 725/728 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1909 ms. Remains : 54/58 places, 725/728 transitions.
RANDOM walk for 40000 steps (97 resets) in 1666 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (127 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (115 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 525882 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 525882 steps, saw 79303 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-22 06:48:59] [INFO ] Invariant cache hit.
[2024-05-22 06:48:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 704/728 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/728 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/779 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/779 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/779 variables, and 68 constraints, problems are : Problem set: 0 solved, 2 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 704/728 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/728 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/779 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/779 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/779 variables, and 70 constraints, problems are : Problem set: 0 solved, 2 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1186ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 235 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 725/725 transitions.
Applied a total of 0 rules in 37 ms. Remains 54 /54 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 54/54 places, 725/725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 725/725 transitions.
Applied a total of 0 rules in 37 ms. Remains 54 /54 variables (removed 0) and now considering 725/725 (removed 0) transitions.
[2024-05-22 06:49:00] [INFO ] Invariant cache hit.
[2024-05-22 06:49:01] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-22 06:49:01] [INFO ] Invariant cache hit.
[2024-05-22 06:49:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:49:01] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-22 06:49:01] [INFO ] Redundant transitions in 27 ms returned []
Running 723 sub problems to find dead transitions.
[2024-05-22 06:49:01] [INFO ] Invariant cache hit.
[2024-05-22 06:49:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Problem TDEAD724 is UNSAT
At refinement iteration 4 (OVERLAPS) 725/779 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/779 variables, and 68 constraints, problems are : Problem set: 1 solved, 722 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 4 (OVERLAPS) 725/779 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/779 variables, and 790 constraints, problems are : Problem set: 1 solved, 722 unsolved in 31001 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 722/723 constraints, Known Traps: 0/0 constraints]
After SMT, in 75212ms problems are : Problem set: 1 solved, 722 unsolved
Search for dead transitions found 1 dead transitions in 75221ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 54/54 places, 724/725 transitions.
Applied a total of 0 rules in 37 ms. Remains 54 /54 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2024-05-22 06:50:16] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76208 ms. Remains : 54/54 places, 724/725 transitions.
RANDOM walk for 40000 steps (106 resets) in 1607 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (115 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 525058 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 2
Probabilistic random walk after 525058 steps, saw 79174 distinct states, run finished after 3005 ms. (steps per millisecond=174 ) properties seen :0
// Phase 1: matrix 724 rows 54 cols
[2024-05-22 06:50:20] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 06:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 703/727 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/727 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 51/778 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/778 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/778 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 68 constraints, problems are : Problem set: 0 solved, 2 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 703/727 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/727 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/778 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/778 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/778 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 778/778 variables, and 70 constraints, problems are : Problem set: 0 solved, 2 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 724/724 transitions.
Applied a total of 0 rules in 53 ms. Remains 54 /54 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 54/54 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 724/724 transitions.
Applied a total of 0 rules in 38 ms. Remains 54 /54 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2024-05-22 06:50:22] [INFO ] Invariant cache hit.
[2024-05-22 06:50:22] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-22 06:50:22] [INFO ] Invariant cache hit.
[2024-05-22 06:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:50:22] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2024-05-22 06:50:22] [INFO ] Redundant transitions in 12 ms returned []
Running 722 sub problems to find dead transitions.
[2024-05-22 06:50:22] [INFO ] Invariant cache hit.
[2024-05-22 06:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (OVERLAPS) 724/778 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/778 variables, and 68 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (OVERLAPS) 724/778 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/778 variables, and 790 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30860 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 0/0 constraints]
After SMT, in 75868ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 75877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76810 ms. Remains : 54/54 places, 724/724 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 258 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:51:39] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 06:51:39] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-22 06:51:39] [INFO ] Invariant cache hit.
[2024-05-22 06:51:40] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:51:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:52:14] [INFO ] Deduced a trap composed of 21 places in 828 ms of which 4 ms to minimize.
[2024-05-22 06:52:15] [INFO ] Deduced a trap composed of 61 places in 806 ms of which 3 ms to minimize.
[2024-05-22 06:52:16] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 3 ms to minimize.
[2024-05-22 06:52:16] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 3 ms to minimize.
[2024-05-22 06:52:17] [INFO ] Deduced a trap composed of 31 places in 571 ms of which 3 ms to minimize.
[2024-05-22 06:52:17] [INFO ] Deduced a trap composed of 31 places in 543 ms of which 3 ms to minimize.
[2024-05-22 06:52:18] [INFO ] Deduced a trap composed of 31 places in 516 ms of which 3 ms to minimize.
[2024-05-22 06:52:18] [INFO ] Deduced a trap composed of 31 places in 488 ms of which 3 ms to minimize.
[2024-05-22 06:52:19] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2024-05-22 06:52:20] [INFO ] Deduced a trap composed of 27 places in 811 ms of which 3 ms to minimize.
[2024-05-22 06:52:21] [INFO ] Deduced a trap composed of 38 places in 788 ms of which 3 ms to minimize.
[2024-05-22 06:52:22] [INFO ] Deduced a trap composed of 75 places in 790 ms of which 3 ms to minimize.
[2024-05-22 06:52:22] [INFO ] Deduced a trap composed of 23 places in 794 ms of which 4 ms to minimize.
[2024-05-22 06:52:23] [INFO ] Deduced a trap composed of 31 places in 798 ms of which 3 ms to minimize.
[2024-05-22 06:52:24] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 3 ms to minimize.
[2024-05-22 06:52:24] [INFO ] Deduced a trap composed of 31 places in 654 ms of which 3 ms to minimize.
[2024-05-22 06:52:25] [INFO ] Deduced a trap composed of 31 places in 581 ms of which 3 ms to minimize.
[2024-05-22 06:52:26] [INFO ] Deduced a trap composed of 31 places in 551 ms of which 3 ms to minimize.
[2024-05-22 06:52:26] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 3 ms to minimize.
[2024-05-22 06:52:27] [INFO ] Deduced a trap composed of 31 places in 640 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/1477 variables, and 34 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 1157/1157 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:52:37] [INFO ] Deduced a trap composed of 31 places in 599 ms of which 3 ms to minimize.
[2024-05-22 06:52:38] [INFO ] Deduced a trap composed of 14 places in 546 ms of which 3 ms to minimize.
[2024-05-22 06:52:38] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2024-05-22 06:52:39] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 3 ms to minimize.
[2024-05-22 06:52:40] [INFO ] Deduced a trap composed of 33 places in 539 ms of which 3 ms to minimize.
[2024-05-22 06:52:40] [INFO ] Deduced a trap composed of 48 places in 527 ms of which 3 ms to minimize.
[2024-05-22 06:52:41] [INFO ] Deduced a trap composed of 34 places in 527 ms of which 3 ms to minimize.
[2024-05-22 06:52:41] [INFO ] Deduced a trap composed of 33 places in 505 ms of which 3 ms to minimize.
[2024-05-22 06:52:42] [INFO ] Deduced a trap composed of 36 places in 536 ms of which 3 ms to minimize.
[2024-05-22 06:52:42] [INFO ] Deduced a trap composed of 46 places in 601 ms of which 4 ms to minimize.
[2024-05-22 06:52:43] [INFO ] Deduced a trap composed of 38 places in 557 ms of which 4 ms to minimize.
[2024-05-22 06:52:44] [INFO ] Deduced a trap composed of 40 places in 493 ms of which 3 ms to minimize.
[2024-05-22 06:52:44] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 2 ms to minimize.
[2024-05-22 06:52:45] [INFO ] Deduced a trap composed of 40 places in 528 ms of which 3 ms to minimize.
[2024-05-22 06:52:45] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 3 ms to minimize.
[2024-05-22 06:52:46] [INFO ] Deduced a trap composed of 43 places in 495 ms of which 2 ms to minimize.
[2024-05-22 06:52:47] [INFO ] Deduced a trap composed of 52 places in 780 ms of which 3 ms to minimize.
[2024-05-22 06:52:48] [INFO ] Deduced a trap composed of 43 places in 613 ms of which 2 ms to minimize.
[2024-05-22 06:52:48] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 3 ms to minimize.
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 42 places in 535 ms of which 3 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 44 places in 505 ms of which 2 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 29 places in 604 ms of which 3 ms to minimize.
[2024-05-22 06:52:52] [INFO ] Deduced a trap composed of 43 places in 521 ms of which 3 ms to minimize.
[2024-05-22 06:52:52] [INFO ] Deduced a trap composed of 45 places in 492 ms of which 3 ms to minimize.
[2024-05-22 06:52:53] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 2 ms to minimize.
[2024-05-22 06:52:54] [INFO ] Deduced a trap composed of 45 places in 563 ms of which 3 ms to minimize.
[2024-05-22 06:52:54] [INFO ] Deduced a trap composed of 44 places in 533 ms of which 3 ms to minimize.
[2024-05-22 06:52:55] [INFO ] Deduced a trap composed of 46 places in 524 ms of which 3 ms to minimize.
[2024-05-22 06:52:55] [INFO ] Deduced a trap composed of 43 places in 505 ms of which 3 ms to minimize.
[2024-05-22 06:52:56] [INFO ] Deduced a trap composed of 30 places in 613 ms of which 2 ms to minimize.
[2024-05-22 06:52:57] [INFO ] Deduced a trap composed of 32 places in 555 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/1477 variables, and 66 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 0/1157 constraints, Known Traps: 52/52 constraints]
After SMT, in 77248ms problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 77262ms
Finished structural reductions in LTL mode , in 1 iterations and 78580 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (195 resets) in 1691 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 332 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 570 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (45 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 278177 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 3
Probabilistic random walk after 278177 steps, saw 50643 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-22 06:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:53:02] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 3 ms to minimize.
[2024-05-22 06:53:03] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 3 ms to minimize.
[2024-05-22 06:53:04] [INFO ] Deduced a trap composed of 31 places in 611 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1158/1477 variables, 319/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:53:05] [INFO ] Deduced a trap composed of 31 places in 589 ms of which 3 ms to minimize.
[2024-05-22 06:53:05] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 4 ms to minimize.
[2024-05-22 06:53:06] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1477 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 339 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4702 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1158/1477 variables, 319/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:53:08] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1477 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 343 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 7315ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2239 ms.
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 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 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
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 332 place count 162 transition count 977
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 480 place count 88 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 88 transition count 902
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 498 place count 71 transition count 749
Iterating global reduction 4 with 17 rules applied. Total rules applied 515 place count 71 transition count 749
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 523 place count 71 transition count 741
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 5 with 2 rules applied. Total rules applied 525 place count 70 transition count 740
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 536 place count 70 transition count 729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 547 place count 59 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 548 place count 59 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 58 transition count 728
Applied a total of 549 rules in 207 ms. Remains 58 /319 variables (removed 261) and now considering 728/1158 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 58/319 places, 728/1158 transitions.
RANDOM walk for 40000 steps (265 resets) in 1945 ms. (20 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
// Phase 1: matrix 728 rows 58 cols
[2024-05-22 06:53:12] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 06:53: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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 700/720 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/786 variables, 38/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/786 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 700/720 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/786 variables, 38/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/786 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 728/728 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 727
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 57 transition count 718
Applied a total of 11 rules in 75 ms. Remains 57 /58 variables (removed 1) and now considering 718/728 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 57/58 places, 718/728 transitions.
RANDOM walk for 34569 steps (140 resets) in 409 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 33388 reset in 179 ms.
Product exploration explored 100000 steps with 33389 reset in 201 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 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.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 317 transition count 1156
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 136 place count 317 transition count 1135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 136 place count 317 transition count 1135
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 159 place count 317 transition count 1135
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 257 place count 219 transition count 1037
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 355 place count 219 transition count 1037
Performed 89 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 444 place count 219 transition count 1048
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 446 place count 219 transition count 1046
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 521 place count 144 transition count 835
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 75 rules applied. Total rules applied 596 place count 144 transition count 835
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 612 place count 144 transition count 819
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 621 place count 135 transition count 810
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 630 place count 135 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 631 place count 135 transition count 810
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 633 place count 133 transition count 808
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 635 place count 133 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 636 place count 133 transition count 810
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 636 rules in 154 ms. Remains 133 /319 variables (removed 186) and now considering 810/1158 (removed 348) transitions.
[2024-05-22 06:53:15] [INFO ] Redundant transitions in 16 ms returned []
Running 809 sub problems to find dead transitions.
// Phase 1: matrix 810 rows 133 cols
[2024-05-22 06:53:15] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 06:53:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-22 06:53:38] [INFO ] Deduced a trap composed of 21 places in 480 ms of which 1 ms to minimize.
[2024-05-22 06:53:39] [INFO ] Deduced a trap composed of 5 places in 552 ms of which 2 ms to minimize.
[2024-05-22 06:53:39] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:53:39] [INFO ] Deduced a trap composed of 4 places in 469 ms of which 2 ms to minimize.
[2024-05-22 06:53:40] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 1 ms to minimize.
[2024-05-22 06:53:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 06:53:40] [INFO ] Deduced a trap composed of 8 places in 465 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 06:53:40] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 06:53:43] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
Problem TDEAD543 is UNSAT
[2024-05-22 06:53:44] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 2 ms to minimize.
Problem TDEAD544 is UNSAT
[2024-05-22 06:53:44] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-05-22 06:53:44] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
Problem TDEAD546 is UNSAT
[2024-05-22 06:53:44] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
Problem TDEAD547 is UNSAT
[2024-05-22 06:53:45] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 2 ms to minimize.
Problem TDEAD548 is UNSAT
[2024-05-22 06:53:45] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-05-22 06:53:45] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
[2024-05-22 06:53:45] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 1 ms to minimize.
Problem TDEAD553 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 17/30 constraints. Problems are: Problem set: 54 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/30 constraints. Problems are: Problem set: 54 solved, 755 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 4 (OVERLAPS) 809/942 variables, 133/163 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/942 variables, 1/164 constraints. Problems are: Problem set: 68 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 942/943 variables, and 164 constraints, problems are : Problem set: 68 solved, 741 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 133/133 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 809/809 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 68 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 63/133 variables, 13/13 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 17/30 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/30 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 4 (OVERLAPS) 809/942 variables, 133/163 constraints. Problems are: Problem set: 68 solved, 741 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/942 variables, 1/164 constraints. Problems are: Problem set: 68 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 942/943 variables, and 905 constraints, problems are : Problem set: 68 solved, 741 unsolved in 30779 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 133/133 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 741/809 constraints, Known Traps: 17/17 constraints]
After SMT, in 77189ms problems are : Problem set: 68 solved, 741 unsolved
Search for dead transitions found 68 dead transitions in 77198ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/319 places, 742/1158 transitions.
Graph (complete) has 907 edges and 133 vertex of which 71 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.3 ms
Discarding 62 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 742
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 62 ms. Remains 71 /133 variables (removed 62) and now considering 742/742 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/319 places, 742/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77440 ms. Remains : 71/319 places, 742/1158 transitions.
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-22 06:54:32] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 06:54:32] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-22 06:54:32] [INFO ] Invariant cache hit.
[2024-05-22 06:54:33] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-05-22 06:54:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:55:07] [INFO ] Deduced a trap composed of 21 places in 799 ms of which 3 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 61 places in 773 ms of which 3 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 3 ms to minimize.
[2024-05-22 06:55:09] [INFO ] Deduced a trap composed of 31 places in 621 ms of which 3 ms to minimize.
[2024-05-22 06:55:10] [INFO ] Deduced a trap composed of 31 places in 571 ms of which 3 ms to minimize.
[2024-05-22 06:55:10] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 3 ms to minimize.
[2024-05-22 06:55:11] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 3 ms to minimize.
[2024-05-22 06:55:11] [INFO ] Deduced a trap composed of 31 places in 475 ms of which 3 ms to minimize.
[2024-05-22 06:55:12] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 2 ms to minimize.
[2024-05-22 06:55:13] [INFO ] Deduced a trap composed of 27 places in 799 ms of which 3 ms to minimize.
[2024-05-22 06:55:14] [INFO ] Deduced a trap composed of 38 places in 797 ms of which 3 ms to minimize.
[2024-05-22 06:55:14] [INFO ] Deduced a trap composed of 75 places in 802 ms of which 4 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 23 places in 785 ms of which 3 ms to minimize.
[2024-05-22 06:55:16] [INFO ] Deduced a trap composed of 31 places in 817 ms of which 4 ms to minimize.
[2024-05-22 06:55:17] [INFO ] Deduced a trap composed of 43 places in 662 ms of which 3 ms to minimize.
[2024-05-22 06:55:17] [INFO ] Deduced a trap composed of 31 places in 674 ms of which 3 ms to minimize.
[2024-05-22 06:55:18] [INFO ] Deduced a trap composed of 31 places in 621 ms of which 3 ms to minimize.
[2024-05-22 06:55:19] [INFO ] Deduced a trap composed of 31 places in 577 ms of which 2 ms to minimize.
[2024-05-22 06:55:19] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 3 ms to minimize.
[2024-05-22 06:55:20] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/1477 variables, and 34 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 1157/1157 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:55:30] [INFO ] Deduced a trap composed of 31 places in 575 ms of which 3 ms to minimize.
[2024-05-22 06:55:30] [INFO ] Deduced a trap composed of 14 places in 544 ms of which 3 ms to minimize.
[2024-05-22 06:55:31] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 1 ms to minimize.
[2024-05-22 06:55:31] [INFO ] Deduced a trap composed of 28 places in 562 ms of which 3 ms to minimize.
[2024-05-22 06:55:32] [INFO ] Deduced a trap composed of 33 places in 547 ms of which 3 ms to minimize.
[2024-05-22 06:55:33] [INFO ] Deduced a trap composed of 48 places in 512 ms of which 3 ms to minimize.
[2024-05-22 06:55:33] [INFO ] Deduced a trap composed of 34 places in 522 ms of which 3 ms to minimize.
[2024-05-22 06:55:34] [INFO ] Deduced a trap composed of 33 places in 507 ms of which 2 ms to minimize.
[2024-05-22 06:55:34] [INFO ] Deduced a trap composed of 36 places in 521 ms of which 3 ms to minimize.
[2024-05-22 06:55:35] [INFO ] Deduced a trap composed of 46 places in 572 ms of which 2 ms to minimize.
[2024-05-22 06:55:35] [INFO ] Deduced a trap composed of 38 places in 549 ms of which 3 ms to minimize.
[2024-05-22 06:55:36] [INFO ] Deduced a trap composed of 40 places in 483 ms of which 3 ms to minimize.
[2024-05-22 06:55:37] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 2 ms to minimize.
[2024-05-22 06:55:37] [INFO ] Deduced a trap composed of 40 places in 532 ms of which 2 ms to minimize.
[2024-05-22 06:55:38] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 3 ms to minimize.
[2024-05-22 06:55:38] [INFO ] Deduced a trap composed of 43 places in 509 ms of which 2 ms to minimize.
[2024-05-22 06:55:39] [INFO ] Deduced a trap composed of 52 places in 726 ms of which 3 ms to minimize.
[2024-05-22 06:55:40] [INFO ] Deduced a trap composed of 43 places in 466 ms of which 2 ms to minimize.
[2024-05-22 06:55:40] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 2 ms to minimize.
[2024-05-22 06:55:41] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-05-22 06:55:42] [INFO ] Deduced a trap composed of 42 places in 515 ms of which 3 ms to minimize.
[2024-05-22 06:55:43] [INFO ] Deduced a trap composed of 44 places in 501 ms of which 4 ms to minimize.
[2024-05-22 06:55:43] [INFO ] Deduced a trap composed of 29 places in 614 ms of which 2 ms to minimize.
[2024-05-22 06:55:44] [INFO ] Deduced a trap composed of 43 places in 528 ms of which 3 ms to minimize.
[2024-05-22 06:55:44] [INFO ] Deduced a trap composed of 45 places in 486 ms of which 3 ms to minimize.
[2024-05-22 06:55:45] [INFO ] Deduced a trap composed of 32 places in 528 ms of which 2 ms to minimize.
[2024-05-22 06:55:46] [INFO ] Deduced a trap composed of 45 places in 553 ms of which 2 ms to minimize.
[2024-05-22 06:55:46] [INFO ] Deduced a trap composed of 44 places in 537 ms of which 2 ms to minimize.
[2024-05-22 06:55:47] [INFO ] Deduced a trap composed of 46 places in 507 ms of which 2 ms to minimize.
[2024-05-22 06:55:47] [INFO ] Deduced a trap composed of 43 places in 467 ms of which 2 ms to minimize.
[2024-05-22 06:55:48] [INFO ] Deduced a trap composed of 30 places in 560 ms of which 3 ms to minimize.
[2024-05-22 06:55:49] [INFO ] Deduced a trap composed of 32 places in 520 ms of which 2 ms to minimize.
[2024-05-22 06:55:50] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/1477 variables, and 67 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 0/1157 constraints, Known Traps: 53/53 constraints]
After SMT, in 76767ms problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 76783ms
Finished structural reductions in LTL mode , in 1 iterations and 78123 ms. Remains : 319/319 places, 1158/1158 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-15 finished in 478192 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(((G(p1) U X(p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-08
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 302 edges and 321 vertex of which 4 / 321 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 318 transition count 1044
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 164 rules applied. Total rules applied 278 place count 205 transition count 993
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 309 place count 175 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 174 transition count 992
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 310 place count 174 transition count 986
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 322 place count 168 transition count 986
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 325 place count 165 transition count 983
Iterating global reduction 4 with 3 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 329 place count 164 transition count 974
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 164 transition count 974
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 332 place count 164 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 333 place count 163 transition count 972
Performed 72 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 477 place count 91 transition count 899
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 478 place count 91 transition count 898
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 495 place count 74 transition count 744
Iterating global reduction 7 with 17 rules applied. Total rules applied 512 place count 74 transition count 744
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 519 place count 74 transition count 737
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 523 place count 72 transition count 735
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 525 place count 70 transition count 733
Applied a total of 525 rules in 225 ms. Remains 70 /321 variables (removed 251) and now considering 733/1160 (removed 427) transitions.
// Phase 1: matrix 733 rows 70 cols
[2024-05-22 06:55:51] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 06:55:51] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 06:55:51] [INFO ] Invariant cache hit.
[2024-05-22 06:55:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:55:52] [INFO ] Implicit Places using invariants and state equation in 603 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 942 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/321 places, 733/1160 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 67 transition count 732
Applied a total of 2 rules in 22 ms. Remains 67 /68 variables (removed 1) and now considering 732/733 (removed 1) transitions.
// Phase 1: matrix 732 rows 67 cols
[2024-05-22 06:55:52] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:55:52] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-22 06:55:52] [INFO ] Invariant cache hit.
[2024-05-22 06:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:55:53] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 67/321 places, 732/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2035 ms. Remains : 67/321 places, 732/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08
Product exploration explored 100000 steps with 183 reset in 96 ms.
Product exploration explored 100000 steps with 579 reset in 155 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 : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2048 resets) in 302 ms. (132 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-22 06:55:53] [INFO ] Invariant cache hit.
[2024-05-22 06:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/716 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/797 variables, 44/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/798 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/799 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/799 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/799 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/716 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/797 variables, 44/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/797 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/798 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/799 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/799 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/799 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 732/732 transitions.
Graph (complete) has 869 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 727
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 27 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 53 transition count 718
Applied a total of 29 rules in 119 ms. Remains 53 /67 variables (removed 14) and now considering 718/732 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 53/67 places, 718/732 transitions.
RANDOM walk for 31167 steps (310 resets) in 396 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 732/732 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-22 06:55:55] [INFO ] Invariant cache hit.
[2024-05-22 06:55:55] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-22 06:55:55] [INFO ] Invariant cache hit.
[2024-05-22 06:55:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:55:56] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2024-05-22 06:55:56] [INFO ] Invariant cache hit.
[2024-05-22 06:55:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Problem TDEAD558 is UNSAT
At refinement iteration 4 (OVERLAPS) 731/798 variables, 67/78 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 6 (OVERLAPS) 1/799 variables, 1/79 constraints. Problems are: Problem set: 1 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/799 variables, and 79 constraints, problems are : Problem set: 1 solved, 728 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 728 unsolved
At refinement iteration 4 (OVERLAPS) 731/797 variables, 66/77 constraints. Problems are: Problem set: 1 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/799 variables, and 805 constraints, problems are : Problem set: 1 solved, 728 unsolved in 30635 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 66/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 728/729 constraints, Known Traps: 0/0 constraints]
After SMT, in 76087ms problems are : Problem set: 1 solved, 728 unsolved
Search for dead transitions found 1 dead transitions in 76096ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/67 places, 731/732 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76960 ms. Remains : 67/67 places, 731/732 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2071 resets) in 381 ms. (104 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
// Phase 1: matrix 731 rows 67 cols
[2024-05-22 06:57:12] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/716 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/796 variables, 44/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/797 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/798 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/798 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 694/716 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/796 variables, 44/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/797 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/797 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/798 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/798 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 798/798 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 731/731 transitions.
Graph (complete) has 869 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 726
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 64 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 63 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 63 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 63 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 62 transition count 724
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 62 transition count 714
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 52 transition count 714
Applied a total of 31 rules in 107 ms. Remains 52 /67 variables (removed 15) and now considering 714/731 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 52/67 places, 714/731 transitions.
RANDOM walk for 31352 steps (251 resets) in 447 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1334 reset in 249 ms.
Product exploration explored 100000 steps with 960 reset in 210 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 731/731 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 733
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 59 ms. Remains 67 /67 variables (removed 0) and now considering 733/731 (removed -2) transitions.
[2024-05-22 06:57:15] [INFO ] Redundant transitions in 25 ms returned []
Running 730 sub problems to find dead transitions.
// Phase 1: matrix 733 rows 67 cols
[2024-05-22 06:57:15] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:57:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
At refinement iteration 4 (OVERLAPS) 732/798 variables, 66/77 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 1/78 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 7 (OVERLAPS) 1/799 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/800 variables, and 79 constraints, problems are : Problem set: 3 solved, 727 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 727 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 4 (OVERLAPS) 731/796 variables, 65/76 constraints. Problems are: Problem set: 3 solved, 727 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 1/77 constraints. Problems are: Problem set: 3 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/800 variables, and 804 constraints, problems are : Problem set: 3 solved, 727 unsolved in 30613 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/67 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 727/730 constraints, Known Traps: 0/0 constraints]
After SMT, in 76187ms problems are : Problem set: 3 solved, 727 unsolved
Search for dead transitions found 3 dead transitions in 76207ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/67 places, 730/731 transitions.
Graph (complete) has 868 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 66 /67 variables (removed 1) and now considering 730/730 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/67 places, 730/731 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76344 ms. Remains : 66/67 places, 730/731 transitions.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 731/731 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 731/731 (removed 0) transitions.
// Phase 1: matrix 731 rows 67 cols
[2024-05-22 06:58:31] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:58:32] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-22 06:58:32] [INFO ] Invariant cache hit.
[2024-05-22 06:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:58:32] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2024-05-22 06:58:32] [INFO ] Invariant cache hit.
[2024-05-22 06:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (OVERLAPS) 730/796 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 6 (OVERLAPS) 1/797 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/798 variables, and 78 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (OVERLAPS) 730/796 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/798 variables, and 805 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30997 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 66/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 0/0 constraints]
After SMT, in 75659ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 75667ms
Finished structural reductions in LTL mode , in 1 iterations and 76528 ms. Remains : 67/67 places, 731/731 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 237591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-13
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 286 edges and 321 vertex of which 4 / 321 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 163 transition count 981
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
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 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 463 place count 98 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 464 place count 98 transition count 905
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 479 place count 83 transition count 772
Iterating global reduction 6 with 15 rules applied. Total rules applied 494 place count 83 transition count 772
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 502 place count 83 transition count 764
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 7 with 4 rules applied. Total rules applied 506 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 79 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 509 place count 78 transition count 760
Applied a total of 509 rules in 127 ms. Remains 78 /321 variables (removed 243) and now considering 760/1160 (removed 400) transitions.
// Phase 1: matrix 760 rows 78 cols
[2024-05-22 06:59:49] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 06:59:49] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 06:59:49] [INFO ] Invariant cache hit.
[2024-05-22 06:59:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:59:49] [INFO ] Implicit Places using invariants and state equation in 418 ms returned [73, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 696 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 76/321 places, 760/1160 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 75 transition count 759
Applied a total of 2 rules in 33 ms. Remains 75 /76 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 75 cols
[2024-05-22 06:59:49] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 06:59:50] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 06:59:50] [INFO ] Invariant cache hit.
[2024-05-22 06:59:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:59:50] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/321 places, 759/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1587 ms. Remains : 75/321 places, 759/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13
Product exploration explored 100000 steps with 15 reset in 72 ms.
Product exploration explored 100000 steps with 191 reset in 116 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 : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1479 resets) in 3011 ms. (13 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2024-05-22 06:59:52] [INFO ] Invariant cache hit.
[2024-05-22 06:59:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 751/810 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/824 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/832 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/833 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/833 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/834 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/834 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/834 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 59/834 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/75 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 759/759 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-22 06:59:52] [INFO ] Invariant cache hit.
[2024-05-22 06:59:53] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-22 06:59:53] [INFO ] Invariant cache hit.
[2024-05-22 06:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:59:53] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 751 sub problems to find dead transitions.
[2024-05-22 06:59:53] [INFO ] Invariant cache hit.
[2024-05-22 06:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Problem TDEAD567 is UNSAT
At refinement iteration 4 (OVERLAPS) 758/832 variables, 74/84 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 750 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/833 variables, 1/85 constraints. Problems are: Problem set: 1 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/834 variables, and 85 constraints, problems are : Problem set: 1 solved, 750 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 2 (OVERLAPS) 6/73 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 4 (OVERLAPS) 758/831 variables, 73/83 constraints. Problems are: Problem set: 1 solved, 750 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 29/112 constraints. Problems are: Problem set: 1 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/834 variables, and 112 constraints, problems are : Problem set: 1 solved, 750 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/75 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 29/751 constraints, Known Traps: 0/0 constraints]
After SMT, in 73660ms problems are : Problem set: 1 solved, 750 unsolved
Search for dead transitions found 1 dead transitions in 73674ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 75/75 places, 758/759 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74627 ms. Remains : 75/75 places, 758/759 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12229 steps (467 resets) in 141 ms. (86 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 98 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 285 reset in 190 ms.
Product exploration explored 100000 steps with 284 reset in 138 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 758/758 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 75 cols
[2024-05-22 07:01:08] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 07:01:08] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 07:01:08] [INFO ] Invariant cache hit.
[2024-05-22 07:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:01:09] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 750 sub problems to find dead transitions.
[2024-05-22 07:01:09] [INFO ] Invariant cache hit.
[2024-05-22 07:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (OVERLAPS) 6/73 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 4 (OVERLAPS) 757/830 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 750 unsolved
SMT process timed out in 43856ms, After SMT, problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 43866ms
Finished structural reductions in LTL mode , in 1 iterations and 44784 ms. Remains : 75/75 places, 758/758 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 124804 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) U G((!p1||X(G(!p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-15
Stuttering acceptance computed with spot in 265 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 302 edges and 321 vertex of which 4 / 321 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 318 transition count 1042
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 314 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 314 place count 172 transition count 984
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 329 place count 163 transition count 981
Iterating global reduction 3 with 3 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
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 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 479 place count 90 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 480 place count 90 transition count 897
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 496 place count 74 transition count 753
Iterating global reduction 6 with 16 rules applied. Total rules applied 512 place count 74 transition count 753
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 519 place count 74 transition count 746
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 7 with 4 rules applied. Total rules applied 523 place count 72 transition count 744
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 524 place count 72 transition count 744
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 70 transition count 742
Applied a total of 526 rules in 211 ms. Remains 70 /321 variables (removed 251) and now considering 742/1160 (removed 418) transitions.
// Phase 1: matrix 742 rows 70 cols
[2024-05-22 07:01:54] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 07:01:54] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-22 07:01:54] [INFO ] Invariant cache hit.
[2024-05-22 07:01:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:01:55] [INFO ] Implicit Places using invariants and state equation in 928 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1437 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/321 places, 742/1160 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 67 transition count 741
Applied a total of 2 rules in 35 ms. Remains 67 /68 variables (removed 1) and now considering 741/742 (removed 1) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-22 07:01:55] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 07:01:56] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-22 07:01:56] [INFO ] Invariant cache hit.
[2024-05-22 07:01:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:01:57] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 67/321 places, 741/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3047 ms. Remains : 67/321 places, 741/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15
Product exploration explored 100000 steps with 24971 reset in 826 ms.
Product exploration explored 100000 steps with 24949 reset in 615 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 : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
RANDOM walk for 40000 steps (2099 resets) in 4941 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 295 ms. (135 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (138 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (135 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
[2024-05-22 07:02:00] [INFO ] Invariant cache hit.
[2024-05-22 07:02:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 707/734 variables, 27/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/806 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 7/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/807 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/808 variables, 1/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/808 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 79 constraints, problems are : Problem set: 1 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 707/734 variables, 27/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/806 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 7/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/807 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/807 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/808 variables, 1/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/808 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 81 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1891ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 741/741 transitions.
Graph (complete) has 880 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 66 transition count 738
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 14 place count 66 transition count 727
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 55 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 55 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 54 transition count 728
Applied a total of 27 rules in 116 ms. Remains 54 /67 variables (removed 13) and now considering 728/741 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 54/67 places, 728/741 transitions.
RANDOM walk for 40000 steps (371 resets) in 2107 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (125 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 403136 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 403136 steps, saw 63448 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 728 rows 54 cols
[2024-05-22 07:02:06] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 07:02:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 707/730 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 52/782 variables, 31/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/782 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 707/730 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 52/782 variables, 31/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/782 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 782/782 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 203 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 59 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 54/54 places, 728/728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 59 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
[2024-05-22 07:02:08] [INFO ] Invariant cache hit.
[2024-05-22 07:02:09] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-22 07:02:09] [INFO ] Invariant cache hit.
[2024-05-22 07:02:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:02:09] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2024-05-22 07:02:09] [INFO ] Redundant transitions in 45 ms returned []
Running 726 sub problems to find dead transitions.
[2024-05-22 07:02:09] [INFO ] Invariant cache hit.
[2024-05-22 07:02:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
At refinement iteration 4 (OVERLAPS) 728/782 variables, 54/65 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/782 variables, and 67 constraints, problems are : Problem set: 2 solved, 724 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 728/782 variables, 54/65 constraints. Problems are: Problem set: 2 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/782 variables, and 791 constraints, problems are : Problem set: 2 solved, 724 unsolved in 32521 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 724/726 constraints, Known Traps: 0/0 constraints]
After SMT, in 77194ms problems are : Problem set: 2 solved, 724 unsolved
Search for dead transitions found 2 dead transitions in 77210ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 54/54 places, 726/728 transitions.
Applied a total of 0 rules in 35 ms. Remains 54 /54 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2024-05-22 07:03:27] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78700 ms. Remains : 54/54 places, 726/728 transitions.
RANDOM walk for 40000 steps (351 resets) in 1942 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 534566 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 2
Probabilistic random walk after 534566 steps, saw 82578 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
// Phase 1: matrix 726 rows 54 cols
[2024-05-22 07:03:31] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 07:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/731 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/780 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/780 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/731 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/780 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/780 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1569ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 726/726 transitions.
Applied a total of 0 rules in 55 ms. Remains 54 /54 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 54/54 places, 726/726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 726/726 transitions.
Applied a total of 0 rules in 54 ms. Remains 54 /54 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2024-05-22 07:03:32] [INFO ] Invariant cache hit.
[2024-05-22 07:03:33] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-22 07:03:33] [INFO ] Invariant cache hit.
[2024-05-22 07:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:03:34] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-22 07:03:34] [INFO ] Redundant transitions in 21 ms returned []
Running 724 sub problems to find dead transitions.
[2024-05-22 07:03:34] [INFO ] Invariant cache hit.
[2024-05-22 07:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 726/780 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/780 variables, and 67 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 726/780 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/780 variables, and 791 constraints, problems are : Problem set: 0 solved, 724 unsolved in 33072 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 0/0 constraints]
After SMT, in 78046ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 78060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79476 ms. Remains : 54/54 places, 726/726 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 264 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 741/741 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 741/741 (removed 0) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-22 07:04:52] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 07:04:53] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-22 07:04:53] [INFO ] Invariant cache hit.
[2024-05-22 07:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:04:54] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2024-05-22 07:04:54] [INFO ] Invariant cache hit.
[2024-05-22 07:04:54] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-09b
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 391
TRANSITIONS: 1554
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 16243
NUPN UNITS: 27
LOADING TIME: 1.645
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.116
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.438
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4456
MODEL NAME: /home/mcc/execution/model
391 places, 1554 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-09b, 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 r025-smll-171620166400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b 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 ;