About the Execution of LTSMin+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 |
| 16188.979 | 3521128.00 | 9594692.00 | 4923.70 | FF?FFF???F??FFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500356
=====================================================================
--------------------
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 1717221897136
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:05:00] [INFO ] Load time of PNML (sax parser for PT used): 515 ms
[2024-06-01 06:05:00] [INFO ] Transformed 391 places.
[2024-06-01 06:05:00] [INFO ] Transformed 1554 transitions.
[2024-06-01 06:05:00] [INFO ] Found NUPN structural information;
[2024-06-01 06:05:00] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 845 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 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 195 ms. Remains 321 /391 variables (removed 70) and now considering 1160/1554 (removed 394) transitions.
// Phase 1: matrix 1160 rows 321 cols
[2024-06-01 06:05:01] [INFO ] Computed 14 invariants in 52 ms
[2024-06-01 06:05:01] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-06-01 06:05:01] [INFO ] Invariant cache hit.
[2024-06-01 06:05:02] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
Running 1159 sub problems to find dead transitions.
[2024-06-01 06:05:02] [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-06-01 06:05:43] [INFO ] Deduced a trap composed of 31 places in 918 ms of which 41 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 23 places in 711 ms of which 4 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 22 places in 438 ms of which 5 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 3 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 24 places in 513 ms of which 3 ms to minimize.
[2024-06-01 06:05:46] [INFO ] Deduced a trap composed of 17 places in 962 ms of which 5 ms to minimize.
[2024-06-01 06:05:48] [INFO ] Deduced a trap composed of 27 places in 1202 ms of which 5 ms to minimize.
[2024-06-01 06:05:49] [INFO ] Deduced a trap composed of 45 places in 1163 ms of which 5 ms to minimize.
SMT process timed out in 46913ms, After SMT, problems are : Problem set: 0 solved, 1159 unsolved
Search for dead transitions found 0 dead transitions in 46977ms
Starting structural reductions in LTL mode, iteration 1 : 321/391 places, 1160/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48585 ms. Remains : 321/391 places, 1160/1554 transitions.
Support contains 43 out of 321 places after structural reductions.
[2024-06-01 06:05:50] [INFO ] Flatten gal took : 366 ms
[2024-06-01 06:05:50] [INFO ] Flatten gal took : 186 ms
[2024-06-01 06:05:51] [INFO ] Input system was already deterministic with 1160 transitions.
RANDOM walk for 40000 steps (324 resets) in 2475 ms. (16 steps per ms) remains 17/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
[2024-06-01 06:05:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 255/289 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 32/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1160/1481 variables, 321/335 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/1481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1481/1481 variables, and 335 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 255/289 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 32/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1160/1481 variables, 321/335 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 17/352 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1481/1481 variables, and 352 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 7572ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 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 11 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.44 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 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 164 transition count 979
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 164 transition count 979
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 163 transition count 970
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 163 transition count 970
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 163 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 162 transition count 968
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 439 place count 111 transition count 917
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 111 transition count 916
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 445 place count 106 transition count 879
Iterating global reduction 6 with 5 rules applied. Total rules applied 450 place count 106 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 454 place count 106 transition count 875
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 456 place count 105 transition count 874
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 478 place count 105 transition count 852
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 500 place count 83 transition count 852
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 508 place count 83 transition count 852
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 509 place count 82 transition count 851
Applied a total of 509 rules in 893 ms. Remains 82 /321 variables (removed 239) and now considering 851/1160 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 894 ms. Remains : 82/321 places, 851/1160 transitions.
RANDOM walk for 40000 steps (847 resets) in 1195 ms. (33 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40004 steps (82 resets) in 158 ms. (251 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (78 resets) in 231 ms. (172 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (85 resets) in 214 ms. (186 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 184 ms. (216 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (96 resets) in 116 ms. (341 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 90 ms. (439 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (142 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 77 ms. (512 steps per ms) remains 1/2 properties
// Phase 1: matrix 851 rows 82 cols
[2024-06-01 06:06:01] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 06:06:01] [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) 55/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 847/912 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/933 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/933 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 82/82 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) 55/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 847/912 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/933 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/933 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1291 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1904ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 851/851 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 82 transition count 850
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 80 transition count 850
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 79 transition count 841
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 79 transition count 841
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 79 transition count 840
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 73 transition count 834
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 71 transition count 814
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 71 transition count 814
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 28 place count 68 transition count 811
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 68 transition count 807
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 64 transition count 780
Applied a total of 63 rules in 210 ms. Remains 64 /82 variables (removed 18) and now considering 780/851 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 64/82 places, 780/851 transitions.
RANDOM walk for 40000 steps (112 resets) in 1227 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 952859 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 952859 steps, saw 131411 distinct states, run finished after 3006 ms. (steps per millisecond=316 ) properties seen :0
// Phase 1: matrix 780 rows 64 cols
[2024-06-01 06:06:07] [INFO ] Computed 13 invariants in 11 ms
[2024-06-01 06:06:07] [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) 39/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 777/826 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/844 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/844 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/844 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 844/844 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 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) 39/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 777/826 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/844 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/844 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 844/844 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2517 steps, including 267 resets, run visited all 1 properties in 54 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 68 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 30 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-06-01 06:06:09] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 06:06:09] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 06:06:09] [INFO ] Invariant cache hit.
[2024-06-01 06:06:10] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:06:10] [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-06-01 06:06:50] [INFO ] Deduced a trap composed of 21 places in 950 ms of which 6 ms to minimize.
[2024-06-01 06:06:51] [INFO ] Deduced a trap composed of 61 places in 1220 ms of which 5 ms to minimize.
[2024-06-01 06:06:52] [INFO ] Deduced a trap composed of 31 places in 813 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 31 places in 597 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 31 places in 659 ms of which 5 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 5 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 31 places in 685 ms of which 5 ms to minimize.
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 31 places in 626 ms of which 3 ms to minimize.
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 2 ms to minimize.
[2024-06-01 06:06:57] [INFO ] Deduced a trap composed of 27 places in 1088 ms of which 5 ms to minimize.
[2024-06-01 06:06:58] [INFO ] Deduced a trap composed of 38 places in 976 ms of which 4 ms to minimize.
SMT process timed out in 48165ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 48196ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49411 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 352 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 123 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 49892 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 23 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
[2024-06-01 06:06:59] [INFO ] Invariant cache hit.
[2024-06-01 06:06:59] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-06-01 06:06:59] [INFO ] Invariant cache hit.
[2024-06-01 06:07:01] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:07:01] [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-06-01 06:07:40] [INFO ] Deduced a trap composed of 21 places in 1237 ms of which 37 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 61 places in 1267 ms of which 5 ms to minimize.
[2024-06-01 06:07:42] [INFO ] Deduced a trap composed of 31 places in 992 ms of which 5 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 31 places in 1004 ms of which 5 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 31 places in 879 ms of which 5 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 31 places in 867 ms of which 5 ms to minimize.
[2024-06-01 06:07:46] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 5 ms to minimize.
SMT process timed out in 44958ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 44972ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46701 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 319 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 82 reset in 446 ms.
Product exploration explored 100000 steps with 51 reset in 361 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 112 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 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35397 steps (245 resets) in 215 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 150 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 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 218 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 13 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2024-06-01 06:07:48] [INFO ] Invariant cache hit.
[2024-06-01 06:07:48] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 06:07:48] [INFO ] Invariant cache hit.
[2024-06-01 06:07:50] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:07:50] [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-06-01 06:08:29] [INFO ] Deduced a trap composed of 21 places in 1058 ms of which 4 ms to minimize.
[2024-06-01 06:08:30] [INFO ] Deduced a trap composed of 61 places in 1048 ms of which 5 ms to minimize.
[2024-06-01 06:08:31] [INFO ] Deduced a trap composed of 31 places in 785 ms of which 4 ms to minimize.
[2024-06-01 06:08:31] [INFO ] Deduced a trap composed of 31 places in 810 ms of which 3 ms to minimize.
[2024-06-01 06:08:32] [INFO ] Deduced a trap composed of 31 places in 617 ms of which 4 ms to minimize.
[2024-06-01 06:08:33] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 3 ms to minimize.
[2024-06-01 06:08:33] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 5 ms to minimize.
[2024-06-01 06:08:34] [INFO ] Deduced a trap composed of 31 places in 639 ms of which 5 ms to minimize.
[2024-06-01 06:08:35] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/1477 variables, and 23 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 1157/1157 constraints, Known Traps: 9/9 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, 9/23 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 17 places in 658 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 2 ms to minimize.
[2024-06-01 06:08:49] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 2 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 24 places in 493 ms of which 4 ms to minimize.
[2024-06-01 06:08:51] [INFO ] Deduced a trap composed of 27 places in 1013 ms of which 4 ms to minimize.
[2024-06-01 06:08:52] [INFO ] Deduced a trap composed of 42 places in 927 ms of which 3 ms to minimize.
[2024-06-01 06:08:53] [INFO ] Deduced a trap composed of 31 places in 902 ms of which 3 ms to minimize.
[2024-06-01 06:08:54] [INFO ] Deduced a trap composed of 23 places in 821 ms of which 3 ms to minimize.
[2024-06-01 06:08:55] [INFO ] Deduced a trap composed of 24 places in 1070 ms of which 5 ms to minimize.
[2024-06-01 06:08:56] [INFO ] Deduced a trap composed of 44 places in 1193 ms of which 5 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 41 places in 1178 ms of which 5 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 42 places in 1135 ms of which 5 ms to minimize.
[2024-06-01 06:08:59] [INFO ] Deduced a trap composed of 46 places in 1047 ms of which 4 ms to minimize.
[2024-06-01 06:09:01] [INFO ] Deduced a trap composed of 50 places in 1116 ms of which 5 ms to minimize.
[2024-06-01 06:09:02] [INFO ] Deduced a trap composed of 43 places in 999 ms of which 4 ms to minimize.
[2024-06-01 06:09:03] [INFO ] Deduced a trap composed of 47 places in 1035 ms of which 5 ms to minimize.
[2024-06-01 06:09:04] [INFO ] Deduced a trap composed of 49 places in 1076 ms of which 5 ms to minimize.
[2024-06-01 06:09:05] [INFO ] Deduced a trap composed of 51 places in 1132 ms of which 5 ms to minimize.
[2024-06-01 06:09:06] [INFO ] Deduced a trap composed of 51 places in 1091 ms of which 5 ms to minimize.
SMT process timed out in 76144ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 76166ms
Finished structural reductions in LTL mode , in 1 iterations and 78212 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 108 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 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (329 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523364 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523364 steps, saw 93599 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-06-01 06:09:10] [INFO ] Invariant cache hit.
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-06-01 06:09:11] [INFO ] Deduced a trap composed of 31 places in 991 ms of which 5 ms to minimize.
[2024-06-01 06:09:11] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 4 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
[2024-06-01 06:09:12] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 3 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1477 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3703 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 31 places in 971 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1158/1477 variables, 319/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 31 places in 766 ms of which 4 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 47 places in 641 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1477 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1477 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 7852ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 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 301 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 2 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.5 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 1 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 739
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 739
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 530 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 540 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 550 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 551 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 552 place count 57 transition count 718
Applied a total of 552 rules in 412 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 412 ms. Remains : 57/319 places, 718/1158 transitions.
RANDOM walk for 16530 steps (67 resets) in 420 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 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 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 80 reset in 257 ms.
Product exploration explored 100000 steps with 172 reset in 500 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 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 301 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 355 place count 219 transition count 1037
Performed 90 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 445 place count 219 transition count 1049
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 447 place count 219 transition count 1047
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 523 place count 143 transition count 827
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 76 rules applied. Total rules applied 599 place count 143 transition count 827
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 617 place count 143 transition count 809
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 627 place count 133 transition count 799
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 637 place count 133 transition count 799
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 638 place count 133 transition count 799
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 640 place count 131 transition count 797
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 642 place count 131 transition count 797
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 643 place count 131 transition count 799
Deduced a syphon composed of 62 places in 1 ms
Applied a total of 643 rules in 563 ms. Remains 131 /319 variables (removed 188) and now considering 799/1158 (removed 359) transitions.
[2024-06-01 06:09:21] [INFO ] Redundant transitions in 82 ms returned []
Running 798 sub problems to find dead transitions.
// Phase 1: matrix 799 rows 131 cols
[2024-06-01 06:09:21] [INFO ] Computed 13 invariants in 18 ms
[2024-06-01 06:09:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 06:09:43] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:09:44] [INFO ] Deduced a trap composed of 21 places in 770 ms of which 2 ms to minimize.
[2024-06-01 06:09:44] [INFO ] Deduced a trap composed of 15 places in 697 ms of which 4 ms to minimize.
[2024-06-01 06:09:45] [INFO ] Deduced a trap composed of 5 places in 706 ms of which 3 ms to minimize.
[2024-06-01 06:09:45] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:09:46] [INFO ] Deduced a trap composed of 8 places in 642 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 06:09:47] [INFO ] Deduced a trap composed of 11 places in 562 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:09:51] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 2 ms to minimize.
Problem TDEAD542 is UNSAT
[2024-06-01 06:09:52] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
Problem TDEAD543 is UNSAT
[2024-06-01 06:09:52] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
Problem TDEAD544 is UNSAT
[2024-06-01 06:09:52] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-06-01 06:09:52] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
Problem TDEAD546 is UNSAT
[2024-06-01 06:09:53] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
[2024-06-01 06:09:53] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
Problem TDEAD548 is UNSAT
[2024-06-01 06:09:53] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 2 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-06-01 06:09:54] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 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 TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
[2024-06-01 06:09:55] [INFO ] Deduced a trap composed of 5 places in 623 ms of which 2 ms to minimize.
[2024-06-01 06:09:55] [INFO ] Deduced a trap composed of 15 places in 529 ms of which 1 ms to minimize.
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 18/31 constraints. Problems are: Problem set: 54 solved, 744 unsolved
[2024-06-01 06:09:58] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/32 constraints. Problems are: Problem set: 54 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 131/930 variables, and 32 constraints, problems are : Problem set: 54 solved, 744 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/131 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 54 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 54 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 54/131 variables, 13/13 constraints. Problems are: Problem set: 54 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 19/32 constraints. Problems are: Problem set: 54 solved, 744 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/32 constraints. Problems are: Problem set: 54 solved, 744 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 TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD623 is UNSAT
At refinement iteration 4 (OVERLAPS) 798/929 variables, 131/163 constraints. Problems are: Problem set: 68 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 1/164 constraints. Problems are: Problem set: 68 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 929/930 variables, and 894 constraints, problems are : Problem set: 68 solved, 730 unsolved in 32969 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 131/131 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 730/798 constraints, Known Traps: 19/19 constraints]
After SMT, in 77229ms problems are : Problem set: 68 solved, 730 unsolved
Search for dead transitions found 68 dead transitions in 77244ms
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 : 131/319 places, 731/1158 transitions.
Graph (complete) has 893 edges and 131 vertex of which 69 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 69 transition count 731
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 67 ms. Remains 69 /131 variables (removed 62) and now considering 731/731 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/319 places, 731/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77976 ms. Remains : 69/319 places, 731/1158 transitions.
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 11 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-06-01 06:10:38] [INFO ] Computed 14 invariants in 12 ms
[2024-06-01 06:10:39] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-06-01 06:10:39] [INFO ] Invariant cache hit.
[2024-06-01 06:10:40] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:10: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-06-01 06:11:20] [INFO ] Deduced a trap composed of 21 places in 954 ms of which 4 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 61 places in 1035 ms of which 4 ms to minimize.
[2024-06-01 06:11:22] [INFO ] Deduced a trap composed of 31 places in 1058 ms of which 5 ms to minimize.
[2024-06-01 06:11:23] [INFO ] Deduced a trap composed of 31 places in 803 ms of which 3 ms to minimize.
[2024-06-01 06:11:24] [INFO ] Deduced a trap composed of 31 places in 908 ms of which 5 ms to minimize.
[2024-06-01 06:11:24] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 3 ms to minimize.
[2024-06-01 06:11:25] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 5 ms to minimize.
SMT process timed out in 45300ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 45323ms
Finished structural reductions in LTL mode , in 1 iterations and 47089 ms. Remains : 319/319 places, 1158/1158 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-02 finished in 266799 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 1 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 1 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 0 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 196 ms. Remains 79 /321 variables (removed 242) and now considering 760/1160 (removed 400) transitions.
// Phase 1: matrix 760 rows 79 cols
[2024-06-01 06:11:26] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 06:11:26] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 06:11:26] [INFO ] Invariant cache hit.
[2024-06-01 06:11:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:11:27] [INFO ] Implicit Places using invariants and state equation in 481 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 733 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 51 ms. Remains 76 /77 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 76 cols
[2024-06-01 06:11:27] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 06:11:27] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 06:11:27] [INFO ] Invariant cache hit.
[2024-06-01 06:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:11:27] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 695 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 1678 ms. Remains : 76/321 places, 759/1160 transitions.
Stuttering acceptance computed with spot in 125 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 53 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-04 finished in 1916 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-06-01 06:11:28] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 06:11:28] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 06:11:28] [INFO ] Invariant cache hit.
[2024-06-01 06:11:29] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:11:29] [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-06-01 06:12:06] [INFO ] Deduced a trap composed of 21 places in 1263 ms of which 5 ms to minimize.
[2024-06-01 06:12:08] [INFO ] Deduced a trap composed of 61 places in 1251 ms of which 5 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 31 places in 925 ms of which 5 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 31 places in 847 ms of which 5 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 31 places in 830 ms of which 5 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 31 places in 815 ms of which 5 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 31 places in 817 ms of which 5 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 31 places in 813 ms of which 4 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 40 places in 335 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/1477 variables, and 23 constraints, problems are : Problem set: 0 solved, 1157 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 1157/1157 constraints, Known Traps: 9/9 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, 9/23 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 17 places in 1043 ms of which 5 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 22 places in 612 ms of which 4 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 21 places in 450 ms of which 3 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 24 places in 556 ms of which 3 ms to minimize.
[2024-06-01 06:12:32] [INFO ] Deduced a trap composed of 27 places in 1270 ms of which 6 ms to minimize.
[2024-06-01 06:12:33] [INFO ] Deduced a trap composed of 42 places in 1136 ms of which 5 ms to minimize.
[2024-06-01 06:12:34] [INFO ] Deduced a trap composed of 31 places in 1139 ms of which 5 ms to minimize.
[2024-06-01 06:12:35] [INFO ] Deduced a trap composed of 23 places in 960 ms of which 4 ms to minimize.
[2024-06-01 06:12:36] [INFO ] Deduced a trap composed of 24 places in 1019 ms of which 4 ms to minimize.
[2024-06-01 06:12:37] [INFO ] Deduced a trap composed of 44 places in 1106 ms of which 5 ms to minimize.
[2024-06-01 06:12:38] [INFO ] Deduced a trap composed of 41 places in 1054 ms of which 4 ms to minimize.
[2024-06-01 06:12:39] [INFO ] Deduced a trap composed of 42 places in 1052 ms of which 4 ms to minimize.
[2024-06-01 06:12:40] [INFO ] Deduced a trap composed of 46 places in 984 ms of which 5 ms to minimize.
[2024-06-01 06:12:42] [INFO ] Deduced a trap composed of 50 places in 1069 ms of which 5 ms to minimize.
[2024-06-01 06:12:43] [INFO ] Deduced a trap composed of 43 places in 1034 ms of which 5 ms to minimize.
[2024-06-01 06:12:44] [INFO ] Deduced a trap composed of 47 places in 978 ms of which 5 ms to minimize.
[2024-06-01 06:12:45] [INFO ] Deduced a trap composed of 49 places in 898 ms of which 5 ms to minimize.
SMT process timed out in 75902ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 75918ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76974 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 148 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 77149 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 1 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 290 ms. Remains 90 /321 variables (removed 231) and now considering 816/1160 (removed 344) transitions.
// Phase 1: matrix 816 rows 90 cols
[2024-06-01 06:12:45] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 06:12:45] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 06:12:45] [INFO ] Invariant cache hit.
[2024-06-01 06:12:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:12:46] [INFO ] Implicit Places using invariants and state equation in 606 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 810 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 1 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 72 ms. Remains 87 /88 variables (removed 1) and now considering 815/816 (removed 1) transitions.
// Phase 1: matrix 815 rows 87 cols
[2024-06-01 06:12:46] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 06:12:46] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 06:12:46] [INFO ] Invariant cache hit.
[2024-06-01 06:12:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:12:46] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 603 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 1777 ms. Remains : 87/321 places, 815/1160 transitions.
Stuttering acceptance computed with spot in 74 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 9 reset in 249 ms.
Product exploration explored 100000 steps with 288 reset in 322 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 98 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 74 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1282 resets) in 1673 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (136 resets) in 204 ms. (195 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (116 resets) in 525 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (115 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
[2024-06-01 06:12:48] [INFO ] Invariant cache hit.
[2024-06-01 06:12:48] [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 474 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-06-01 06:12:51] [INFO ] Deduced a trap composed of 7 places in 498 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 2 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 4186 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 4709ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 306 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.2 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 0 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 1 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 241 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 243 ms. Remains : 63/87 places, 773/815 transitions.
RANDOM walk for 30679 steps (142 resets) in 1005 ms. (30 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 254 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 95 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 94 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 56 ms. Remains 87 /87 variables (removed 0) and now considering 815/815 (removed 0) transitions.
[2024-06-01 06:12:54] [INFO ] Invariant cache hit.
[2024-06-01 06:12:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 06:12:55] [INFO ] Invariant cache hit.
[2024-06-01 06:12:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:12:55] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-01 06:12:55] [INFO ] Redundant transitions in 110 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-06-01 06:12:55] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 06:12:55] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/901 variables, and 96 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/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 30026 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 75253ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 75268ms
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 52 ms. Remains 85 /87 variables (removed 2) and now considering 812/814 (removed 2) transitions.
// Phase 1: matrix 812 rows 85 cols
[2024-06-01 06:14:10] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 06:14:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 06:14:11] [INFO ] Invariant cache hit.
[2024-06-01 06:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:14:11] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 540 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 76679 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 98 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 82 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1364 resets) in 541 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 142 ms. (279 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (125 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (128 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2024-06-01 06:14:12] [INFO ] Invariant cache hit.
[2024-06-01 06:14:12] [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 410 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-06-01 06:14:13] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 2 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 2344 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 2810ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 732 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.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 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 137 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 138 ms. Remains : 62/85 places, 770/812 transitions.
RANDOM walk for 40000 steps (173 resets) in 1914 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (164 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (163 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 473133 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 473133 steps, saw 69714 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 770 rows 62 cols
[2024-06-01 06:14:19] [INFO ] Computed 11 invariants in 6 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 368 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-06-01 06:14:20] [INFO ] Deduced a trap composed of 6 places in 475 ms of which 1 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 1 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 7 places in 380 ms of which 1 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 6 places in 434 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 3689 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 4103ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 684 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 30 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 30 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 31 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 06:14:24] [INFO ] Invariant cache hit.
[2024-06-01 06:14:24] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 06:14:24] [INFO ] Invariant cache hit.
[2024-06-01 06:14:25] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-06-01 06:14:25] [INFO ] Redundant transitions in 82 ms returned []
Running 764 sub problems to find dead transitions.
[2024-06-01 06:14:25] [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
SMT process timed out in 44877ms, After SMT, problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 44890ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45820 ms. Remains : 62/62 places, 770/770 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 38 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 06:15:10] [INFO ] Invariant cache hit.
[2024-06-01 06:15:10] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:15:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:15:10] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
TRAPS : Iteration 1
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 7 places in 482 ms of which 2 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 6 places in 563 ms of which 1 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1207 ms
TRAPS : Iteration 2
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 6 places in 525 ms of which 1 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 6 places in 492 ms of which 1 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 6 places in 475 ms of which 1 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1824 ms
TRAPS : Iteration 3
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
TRAPS : Iteration 4
[2024-06-01 06:15:17] [INFO ] After 6763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 06:15:17] [INFO ] After 7209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 7369 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 177 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 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 137 reset in 117 ms.
Product exploration explored 100000 steps with 603 reset in 235 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 0 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 54 ms. Remains 78 /85 variables (removed 7) and now considering 787/812 (removed 25) transitions.
// Phase 1: matrix 787 rows 78 cols
[2024-06-01 06:15:18] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 06:15:18] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 06:15:18] [INFO ] Invariant cache hit.
[2024-06-01 06:15:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:15:19] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2024-06-01 06:15:19] [INFO ] Redundant transitions in 68 ms returned []
Running 781 sub problems to find dead transitions.
[2024-06-01 06:15:19] [INFO ] Invariant cache hit.
[2024-06-01 06:15:19] [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 30023 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 74168ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 74181ms
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 75273 ms. Remains : 78/85 places, 787/812 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-06 finished in 228486 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 0 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 226 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-06-01 06:16:33] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 06:16:34] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-01 06:16:34] [INFO ] Invariant cache hit.
[2024-06-01 06:16:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:16:34] [INFO ] Implicit Places using invariants and state equation in 630 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 967 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 0 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 53 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-06-01 06:16:34] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 06:16:35] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 06:16:35] [INFO ] Invariant cache hit.
[2024-06-01 06:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:16:35] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 883 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 2130 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-07
Product exploration explored 100000 steps with 1211 reset in 220 ms.
Product exploration explored 100000 steps with 619 reset in 159 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 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 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2102 resets) in 381 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 802633 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 802633 steps, saw 125665 distinct states, run finished after 3004 ms. (steps per millisecond=267 ) properties seen :0
[2024-06-01 06:16:39] [INFO ] Invariant cache hit.
[2024-06-01 06:16:39] [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 326 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 710 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 1073ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 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.2 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 113 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 114 ms. Remains : 53/65 places, 718/730 transitions.
RANDOM walk for 39666 steps (371 resets) in 577 ms. (68 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 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 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 44 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-06-01 06:16:41] [INFO ] Invariant cache hit.
[2024-06-01 06:16:41] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 06:16:41] [INFO ] Invariant cache hit.
[2024-06-01 06:16:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:16:42] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2024-06-01 06:16:42] [INFO ] Redundant transitions in 30 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-06-01 06:16:42] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 06:16:42] [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 30017 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 30636 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 74917ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 74924ms
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 1 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 64 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-06-01 06:17:57] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 06:17:57] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 06:17:57] [INFO ] Invariant cache hit.
[2024-06-01 06:17:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:17:57] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 905 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 76896 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 77 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 53 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2185 resets) in 465 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (150 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 779227 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 779227 steps, saw 123476 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-01 06:18:01] [INFO ] Invariant cache hit.
[2024-06-01 06:18:01] [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 293 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 636 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 953ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 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 99 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 100 ms. Remains : 52/63 places, 715/727 transitions.
RANDOM walk for 38746 steps (375 resets) in 610 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 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 357 reset in 128 ms.
Product exploration explored 100000 steps with 321 reset in 136 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 53 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-06-01 06:18:03] [INFO ] Invariant cache hit.
[2024-06-01 06:18:03] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 06:18:03] [INFO ] Invariant cache hit.
[2024-06-01 06:18:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:18:04] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2024-06-01 06:18:04] [INFO ] Redundant transitions in 26 ms returned []
Running 725 sub problems to find dead transitions.
[2024-06-01 06:18:04] [INFO ] Invariant cache hit.
[2024-06-01 06:18:04] [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 30021 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 30892 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 75482ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 75490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76498 ms. Remains : 63/63 places, 727/727 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-07 finished in 165991 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 16 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-06-01 06:19:19] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 06:19:20] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 06:19:20] [INFO ] Invariant cache hit.
[2024-06-01 06:19:21] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:19: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-06-01 06:19:54] [INFO ] Deduced a trap composed of 21 places in 777 ms of which 3 ms to minimize.
[2024-06-01 06:19:55] [INFO ] Deduced a trap composed of 61 places in 810 ms of which 4 ms to minimize.
[2024-06-01 06:19:56] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 3 ms to minimize.
[2024-06-01 06:19:56] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 4 ms to minimize.
[2024-06-01 06:19:57] [INFO ] Deduced a trap composed of 31 places in 539 ms of which 2 ms to minimize.
[2024-06-01 06:19:57] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 3 ms to minimize.
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 3 ms to minimize.
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 3 ms to minimize.
[2024-06-01 06:19:59] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 27 places in 810 ms of which 4 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 38 places in 749 ms of which 3 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 75 places in 802 ms of which 3 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 23 places in 771 ms of which 4 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 31 places in 808 ms of which 4 ms to minimize.
[2024-06-01 06:20:04] [INFO ] Deduced a trap composed of 43 places in 652 ms of which 5 ms to minimize.
[2024-06-01 06:20:04] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 3 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 2 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 3 ms to minimize.
[2024-06-01 06:20:06] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 3 ms to minimize.
[2024-06-01 06:20:07] [INFO ] Deduced a trap composed of 31 places in 626 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-06-01 06:20:17] [INFO ] Deduced a trap composed of 31 places in 629 ms of which 3 ms to minimize.
[2024-06-01 06:20:17] [INFO ] Deduced a trap composed of 14 places in 600 ms of which 3 ms to minimize.
[2024-06-01 06:20:18] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:20:18] [INFO ] Deduced a trap composed of 28 places in 602 ms of which 3 ms to minimize.
[2024-06-01 06:20:19] [INFO ] Deduced a trap composed of 33 places in 596 ms of which 3 ms to minimize.
[2024-06-01 06:20:20] [INFO ] Deduced a trap composed of 48 places in 554 ms of which 3 ms to minimize.
[2024-06-01 06:20:20] [INFO ] Deduced a trap composed of 34 places in 545 ms of which 2 ms to minimize.
[2024-06-01 06:20:21] [INFO ] Deduced a trap composed of 33 places in 519 ms of which 3 ms to minimize.
[2024-06-01 06:20:21] [INFO ] Deduced a trap composed of 36 places in 548 ms of which 3 ms to minimize.
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 46 places in 614 ms of which 3 ms to minimize.
[2024-06-01 06:20:23] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 3 ms to minimize.
[2024-06-01 06:20:23] [INFO ] Deduced a trap composed of 40 places in 519 ms of which 3 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 32 places in 508 ms of which 3 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 40 places in 554 ms of which 3 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 46 places in 476 ms of which 2 ms to minimize.
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 43 places in 503 ms of which 3 ms to minimize.
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 52 places in 701 ms of which 3 ms to minimize.
[2024-06-01 06:20:28] [INFO ] Deduced a trap composed of 43 places in 470 ms of which 3 ms to minimize.
[2024-06-01 06:20:28] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 2 ms to minimize.
[2024-06-01 06:20:28] [INFO ] Deduced a trap composed of 48 places in 437 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-06-01 06:20:30] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 3 ms to minimize.
[2024-06-01 06:20:30] [INFO ] Deduced a trap composed of 44 places in 514 ms of which 3 ms to minimize.
[2024-06-01 06:20:31] [INFO ] Deduced a trap composed of 29 places in 577 ms of which 3 ms to minimize.
[2024-06-01 06:20:31] [INFO ] Deduced a trap composed of 43 places in 521 ms of which 3 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 3 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 32 places in 510 ms of which 3 ms to minimize.
[2024-06-01 06:20:33] [INFO ] Deduced a trap composed of 45 places in 543 ms of which 3 ms to minimize.
[2024-06-01 06:20:34] [INFO ] Deduced a trap composed of 44 places in 553 ms of which 3 ms to minimize.
[2024-06-01 06:20:34] [INFO ] Deduced a trap composed of 46 places in 487 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 43 places in 491 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 30 places in 577 ms of which 3 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 32 places in 550 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/1477 variables, and 66 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: 52/52 constraints]
After SMT, in 76415ms problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 76427ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77749 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 122 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 582 reset in 284 ms.
Product exploration explored 100000 steps with 183 reset in 214 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 79 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 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (296 resets) in 181 ms. (219 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-06-01 06:20:38] [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 466 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-06-01 06:20:39] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 3 ms to minimize.
[2024-06-01 06:20:40] [INFO ] Deduced a trap composed of 31 places in 666 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-06-01 06:20:41] [INFO ] Deduced a trap composed of 31 places in 458 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 2874 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 3364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 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.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 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 227 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 228 ms. Remains : 57/319 places, 718/1158 transitions.
RANDOM walk for 40000 steps (248 resets) in 575 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2712 steps (0 resets) in 8 ms. (301 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 125 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))]
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 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.
[2024-06-01 06:20:42] [INFO ] Invariant cache hit.
[2024-06-01 06:20:43] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 06:20:43] [INFO ] Invariant cache hit.
[2024-06-01 06:20:43] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:20:43] [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-06-01 06:21:18] [INFO ] Deduced a trap composed of 21 places in 789 ms of which 4 ms to minimize.
[2024-06-01 06:21:19] [INFO ] Deduced a trap composed of 61 places in 776 ms of which 3 ms to minimize.
[2024-06-01 06:21:19] [INFO ] Deduced a trap composed of 31 places in 656 ms of which 4 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 3 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 31 places in 592 ms of which 3 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 31 places in 532 ms of which 4 ms to minimize.
[2024-06-01 06:21:22] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 3 ms to minimize.
[2024-06-01 06:21:22] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 4 ms to minimize.
[2024-06-01 06:21:23] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 27 places in 857 ms of which 4 ms to minimize.
[2024-06-01 06:21:25] [INFO ] Deduced a trap composed of 38 places in 826 ms of which 3 ms to minimize.
[2024-06-01 06:21:25] [INFO ] Deduced a trap composed of 75 places in 804 ms of which 4 ms to minimize.
[2024-06-01 06:21:26] [INFO ] Deduced a trap composed of 23 places in 759 ms of which 3 ms to minimize.
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 31 places in 787 ms of which 3 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 43 places in 663 ms of which 4 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 31 places in 670 ms of which 3 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 31 places in 602 ms of which 2 ms to minimize.
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 31 places in 566 ms of which 3 ms to minimize.
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 3 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 3 ms to minimize.
SMT process timed out in 47494ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 47510ms
Finished structural reductions in LTL mode , in 1 iterations and 48865 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 80 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 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (329 resets) in 210 ms. (189 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (49 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-06-01 06:21:31] [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 474 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-06-01 06:21:33] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 3 ms to minimize.
[2024-06-01 06:21:33] [INFO ] Deduced a trap composed of 31 places in 651 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-06-01 06:21:34] [INFO ] Deduced a trap composed of 31 places in 465 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 2959 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 3461ms 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 1 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 206 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 207 ms. Remains : 57/319 places, 718/1158 transitions.
RANDOM walk for 32093 steps (233 resets) in 411 ms. (77 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 134 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 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 331 reset in 240 ms.
Product exploration explored 100000 steps with 145 reset in 210 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 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 0 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 0 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 149 ms. Remains 136 /319 variables (removed 183) and now considering 805/1158 (removed 353) transitions.
[2024-06-01 06:21:37] [INFO ] Redundant transitions in 20 ms returned []
Running 804 sub problems to find dead transitions.
// Phase 1: matrix 805 rows 136 cols
[2024-06-01 06:21:37] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 06:21:37] [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-06-01 06:21:57] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 5 places in 490 ms of which 2 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 2 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 5 places in 478 ms of which 2 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 15 places in 491 ms of which 2 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 1 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 2 ms to minimize.
[2024-06-01 06:22:03] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 2 ms to minimize.
[2024-06-01 06:22:03] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 1 ms to minimize.
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 2 ms to minimize.
Problem TDEAD544 is UNSAT
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 2 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-06-01 06:22:07] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 2 ms to minimize.
Problem TDEAD546 is UNSAT
[2024-06-01 06:22:07] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 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-06-01 06:22:07] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 2 ms to minimize.
[2024-06-01 06:22:11] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 2 ms to minimize.
Problem TDEAD548 is UNSAT
[2024-06-01 06:22:11] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-06-01 06:22:11] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 2 ms to minimize.
Problem TDEAD550 is UNSAT
[2024-06-01 06:22:12] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
[2024-06-01 06:22:12] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 2 ms to minimize.
Problem TDEAD552 is UNSAT
[2024-06-01 06:22:12] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 1 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
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 58 solved, 746 unsolved
SMT process timed out in 44420ms, After SMT, problems are : Problem set: 58 solved, 746 unsolved
Search for dead transitions found 58 dead transitions in 44432ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 136/319 places, 747/1158 transitions.
Graph (complete) has 911 edges and 136 vertex of which 80 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.3 ms
Discarding 56 places :
Also discarding 0 output transitions
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 1 rules in 54 ms. Remains 80 /136 variables (removed 56) and now considering 747/747 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/319 places, 747/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44666 ms. Remains : 80/319 places, 747/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 7 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-06-01 06:22:21] [INFO ] Computed 14 invariants in 10 ms
[2024-06-01 06:22:21] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 06:22:21] [INFO ] Invariant cache hit.
[2024-06-01 06:22:22] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:22:22] [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-06-01 06:22:55] [INFO ] Deduced a trap composed of 21 places in 821 ms of which 4 ms to minimize.
[2024-06-01 06:22:56] [INFO ] Deduced a trap composed of 61 places in 808 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 31 places in 604 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 31 places in 586 ms of which 3 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 4 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 31 places in 529 ms of which 3 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 31 places in 529 ms of which 3 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 31 places in 469 ms of which 3 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 27 places in 771 ms of which 4 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 38 places in 752 ms of which 4 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 75 places in 801 ms of which 4 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 3 ms to minimize.
[2024-06-01 06:23:04] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 3 ms to minimize.
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 43 places in 617 ms of which 3 ms to minimize.
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 4 ms to minimize.
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 31 places in 561 ms of which 2 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 31 places in 552 ms of which 2 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 3 ms to minimize.
[2024-06-01 06:23:08] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 3 ms to minimize.
SMT process timed out in 45646ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 45658ms
Finished structural reductions in LTL mode , in 1 iterations and 46913 ms. Remains : 319/319 places, 1158/1158 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 228849 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 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 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 249 ms. Remains 70 /321 variables (removed 251) and now considering 742/1160 (removed 418) transitions.
// Phase 1: matrix 742 rows 70 cols
[2024-06-01 06:23:08] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 06:23:09] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 06:23:09] [INFO ] Invariant cache hit.
[2024-06-01 06:23:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:23:09] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 941 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 60 ms. Remains 67 /68 variables (removed 1) and now considering 741/742 (removed 1) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-06-01 06:23:09] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 06:23:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 06:23:10] [INFO ] Invariant cache hit.
[2024-06-01 06:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:23:10] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 909 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 2160 ms. Remains : 67/321 places, 741/1160 transitions.
Stuttering acceptance computed with spot in 112 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 18 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 2290 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 253 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-06-01 06:23:11] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 06:23:11] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 06:23:11] [INFO ] Invariant cache hit.
[2024-06-01 06:23:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:23:11] [INFO ] Implicit Places using invariants and state equation in 572 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 899 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 0 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 59 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-06-01 06:23:12] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 06:23:12] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 06:23:12] [INFO ] Invariant cache hit.
[2024-06-01 06:23:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:23:12] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 916 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 2129 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-10
Product exploration explored 100000 steps with 862 reset in 166 ms.
Product exploration explored 100000 steps with 467 reset in 131 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 80 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)]
RANDOM walk for 40000 steps (2073 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 765777 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 765777 steps, saw 120231 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
[2024-06-01 06:23:16] [INFO ] Invariant cache hit.
[2024-06-01 06:23:16] [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 293 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 827 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 1149ms 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 114 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 114 ms. Remains : 53/65 places, 718/730 transitions.
RANDOM walk for 22334 steps (175 resets) in 254 ms. (87 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 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 62 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-06-01 06:23:18] [INFO ] Invariant cache hit.
[2024-06-01 06:23:18] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 06:23:18] [INFO ] Invariant cache hit.
[2024-06-01 06:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:23:19] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2024-06-01 06:23:19] [INFO ] Redundant transitions in 31 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-06-01 06:23:19] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 06:23:19] [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
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 793/794 variables, and 76 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30017 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 30569 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 75255ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 75263ms
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 60 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-06-01 06:24:34] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 06:24:34] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 06:24:34] [INFO ] Invariant cache hit.
[2024-06-01 06:24:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:24:35] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 913 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 77222 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2248 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36155 steps (130 resets) in 44 ms. (803 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, 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1327 reset in 236 ms.
Product exploration explored 100000 steps with 52 reset in 88 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-06-01 06:24:36] [INFO ] Invariant cache hit.
[2024-06-01 06:24:36] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 06:24:36] [INFO ] Invariant cache hit.
[2024-06-01 06:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:24:37] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2024-06-01 06:24:37] [INFO ] Redundant transitions in 26 ms returned []
Running 725 sub problems to find dead transitions.
[2024-06-01 06:24:37] [INFO ] Invariant cache hit.
[2024-06-01 06:24:37] [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 30022 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 30541 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 74673ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 74680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75643 ms. Remains : 63/63 places, 727/727 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-10 finished in 161311 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 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 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 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 163 ms. Remains 79 /321 variables (removed 242) and now considering 779/1160 (removed 381) transitions.
// Phase 1: matrix 779 rows 79 cols
[2024-06-01 06:25:52] [INFO ] Computed 12 invariants in 6 ms
[2024-06-01 06:25:52] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 06:25:52] [INFO ] Invariant cache hit.
[2024-06-01 06:25:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:25:53] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 727 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 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 778
Applied a total of 2 rules in 47 ms. Remains 76 /77 variables (removed 1) and now considering 778/779 (removed 1) transitions.
// Phase 1: matrix 778 rows 76 cols
[2024-06-01 06:25:53] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 06:25:53] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 06:25:53] [INFO ] Invariant cache hit.
[2024-06-01 06:25:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:25:53] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 657 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 1595 ms. Remains : 76/321 places, 778/1160 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-11
Product exploration explored 100000 steps with 70 reset in 78 ms.
Product exploration explored 100000 steps with 13 reset in 77 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 74 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 (1611 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39499 steps (138 resets) in 63 ms. (617 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 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 35 ms. Remains 76 /76 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-06-01 06:25:54] [INFO ] Invariant cache hit.
[2024-06-01 06:25:54] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 06:25:54] [INFO ] Invariant cache hit.
[2024-06-01 06:25:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:25:55] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-06-01 06:25:55] [INFO ] Redundant transitions in 26 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-06-01 06:25:55] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 06:25:55] [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
At refinement iteration 6 (OVERLAPS) 2/852 variables, 2/86 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")
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 30019 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 34333 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 77193ms problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 77201ms
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 42 ms. Remains 74 /76 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 74 cols
[2024-06-01 06:27:12] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 06:27:12] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:27:13] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 662 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 78599 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 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 (1632 resets) in 358 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24625 steps (87 resets) in 42 ms. (572 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, 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)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 849 reset in 208 ms.
Product exploration explored 100000 steps with 783 reset in 203 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 34 ms. Remains 74 /74 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2024-06-01 06:27:14] [INFO ] Invariant cache hit.
[2024-06-01 06:27:14] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 06:27:14] [INFO ] Invariant cache hit.
[2024-06-01 06:27:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:27:14] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-06-01 06:27:14] [INFO ] Redundant transitions in 27 ms returned []
Running 770 sub problems to find dead transitions.
[2024-06-01 06:27:14] [INFO ] Invariant cache hit.
[2024-06-01 06:27:14] [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 33133 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 76025ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 76034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76766 ms. Remains : 74/74 places, 775/775 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-11 finished in 158802 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 1 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 211 ms. Remains 66 /321 variables (removed 255) and now considering 722/1160 (removed 438) transitions.
// Phase 1: matrix 722 rows 66 cols
[2024-06-01 06:28:31] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 06:28:31] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 06:28:31] [INFO ] Invariant cache hit.
[2024-06-01 06:28:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:28:32] [INFO ] Implicit Places using invariants and state equation in 582 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 929 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 49 ms. Remains 63 /64 variables (removed 1) and now considering 721/722 (removed 1) transitions.
// Phase 1: matrix 721 rows 63 cols
[2024-06-01 06:28:32] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 06:28:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 06:28:32] [INFO ] Invariant cache hit.
[2024-06-01 06:28:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:28:33] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 925 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 2117 ms. Remains : 63/321 places, 721/1160 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-12 finished in 2172 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 15 ms. Remains 320 /321 variables (removed 1) and now considering 1159/1160 (removed 1) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-06-01 06:28:33] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 06:28:33] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 06:28:33] [INFO ] Invariant cache hit.
[2024-06-01 06:28:34] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-06-01 06:28:34] [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-06-01 06:29:07] [INFO ] Deduced a trap composed of 31 places in 880 ms of which 4 ms to minimize.
[2024-06-01 06:29:08] [INFO ] Deduced a trap composed of 71 places in 755 ms of which 4 ms to minimize.
[2024-06-01 06:29:09] [INFO ] Deduced a trap composed of 22 places in 680 ms of which 4 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 24 places in 682 ms of which 3 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 74 places in 732 ms of which 4 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 27 places in 816 ms of which 3 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 31 places in 745 ms of which 3 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 23 places in 710 ms of which 3 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 24 places in 732 ms of which 4 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 42 places in 726 ms of which 3 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 44 places in 779 ms of which 3 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 47 places in 748 ms of which 3 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 49 places in 741 ms of which 3 ms to minimize.
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 45 places in 785 ms of which 3 ms to minimize.
[2024-06-01 06:29:19] [INFO ] Deduced a trap composed of 49 places in 770 ms of which 3 ms to minimize.
[2024-06-01 06:29:19] [INFO ] Deduced a trap composed of 43 places in 658 ms of which 3 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 3 ms to minimize.
SMT process timed out in 46135ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 46151ms
Starting structural reductions in LTL mode, iteration 1 : 320/321 places, 1159/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47251 ms. Remains : 320/321 places, 1159/1160 transitions.
Stuttering acceptance computed with spot in 150 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 36 reset in 157 ms.
Stack based approach found an accepted trace after 65791 steps with 536 reset with depth 431 and stack size 423 in 255 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 47841 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-06-01 06:29:20] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 06:29:21] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 06:29:21] [INFO ] Invariant cache hit.
[2024-06-01 06:29:22] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:29:22] [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-06-01 06:29:55] [INFO ] Deduced a trap composed of 21 places in 740 ms of which 4 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 61 places in 789 ms of which 4 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 3 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 31 places in 598 ms of which 4 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 31 places in 551 ms of which 3 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 31 places in 525 ms of which 3 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 1 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 27 places in 794 ms of which 4 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 38 places in 771 ms of which 3 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 75 places in 804 ms of which 3 ms to minimize.
[2024-06-01 06:30:03] [INFO ] Deduced a trap composed of 23 places in 765 ms of which 3 ms to minimize.
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 31 places in 759 ms of which 4 ms to minimize.
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 3 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 31 places in 637 ms of which 3 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 31 places in 579 ms of which 3 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 31 places in 553 ms of which 3 ms to minimize.
[2024-06-01 06:30:07] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 3 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 31 places in 647 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-06-01 06:30:17] [INFO ] Deduced a trap composed of 31 places in 611 ms of which 4 ms to minimize.
[2024-06-01 06:30:18] [INFO ] Deduced a trap composed of 14 places in 556 ms of which 3 ms to minimize.
[2024-06-01 06:30:18] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 28 places in 550 ms of which 3 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 33 places in 518 ms of which 3 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 48 places in 544 ms of which 3 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 34 places in 536 ms of which 3 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 33 places in 518 ms of which 3 ms to minimize.
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 36 places in 510 ms of which 3 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 46 places in 617 ms of which 3 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 38 places in 535 ms of which 3 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 40 places in 494 ms of which 3 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 32 places in 499 ms of which 2 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 40 places in 527 ms of which 2 ms to minimize.
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 46 places in 496 ms of which 3 ms to minimize.
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 43 places in 521 ms of which 2 ms to minimize.
[2024-06-01 06:30:27] [INFO ] Deduced a trap composed of 52 places in 729 ms of which 3 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 43 places in 472 ms of which 2 ms to minimize.
[2024-06-01 06:30:29] [INFO ] Deduced a trap composed of 53 places in 481 ms of which 2 ms to minimize.
[2024-06-01 06:30:29] [INFO ] Deduced a trap composed of 48 places in 464 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-06-01 06:30:30] [INFO ] Deduced a trap composed of 42 places in 484 ms of which 3 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 44 places in 506 ms of which 3 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 29 places in 622 ms of which 3 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 43 places in 535 ms of which 3 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 45 places in 499 ms of which 3 ms to minimize.
[2024-06-01 06:30:33] [INFO ] Deduced a trap composed of 32 places in 541 ms of which 3 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 45 places in 575 ms of which 3 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 44 places in 546 ms of which 2 ms to minimize.
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 46 places in 542 ms of which 3 ms to minimize.
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 43 places in 491 ms of which 3 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 30 places in 580 ms of which 3 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 32 places in 525 ms of which 3 ms to minimize.
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 31 places in 521 ms of which 3 ms to minimize.
SMT process timed out in 76420ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 76432ms
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77743 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 203 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 24924 reset in 310 ms.
Product exploration explored 100000 steps with 25075 reset in 340 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 134 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 202 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
RANDOM walk for 40000 steps (327 resets) in 951 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 476 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 485 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 787 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (46 resets) in 510 ms. (78 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 217081 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 6
Probabilistic random walk after 217081 steps, saw 40061 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-06-01 06:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 31 places in 678 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1158/1477 variables, 319/334 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:30:46] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 3 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 31 places in 621 ms of which 3 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 31 places in 591 ms of which 3 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 31 places in 598 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1477 variables, 4/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1477 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 338 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4362 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 106/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1158/1477 variables, 319/339 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1477 variables, 5/344 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1477 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1477 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 345 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4167 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 8638ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5390 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 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.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 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 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 38963 steps (272 resets) in 3473 ms. (11 steps per ms) remains 0/5 properties
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 (NOT p0) p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 340 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 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 155 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.
[2024-06-01 06:31:00] [INFO ] Invariant cache hit.
[2024-06-01 06:31:00] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 06:31:00] [INFO ] Invariant cache hit.
[2024-06-01 06:31:01] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:31:01] [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-06-01 06:31:34] [INFO ] Deduced a trap composed of 21 places in 822 ms of which 4 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 61 places in 823 ms of which 4 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 31 places in 673 ms of which 3 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 3 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 31 places in 580 ms of which 3 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 31 places in 549 ms of which 3 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 3 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 3 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 27 places in 825 ms of which 3 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 38 places in 824 ms of which 4 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 75 places in 811 ms of which 4 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 23 places in 809 ms of which 4 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 31 places in 807 ms of which 4 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 43 places in 630 ms of which 3 ms to minimize.
[2024-06-01 06:31:45] [INFO ] Deduced a trap composed of 31 places in 680 ms of which 3 ms to minimize.
[2024-06-01 06:31:46] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 3 ms to minimize.
[2024-06-01 06:31:46] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 2 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 4 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 3 ms to minimize.
SMT process timed out in 46353ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 46366ms
Finished structural reductions in LTL mode , in 1 iterations and 47662 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 104 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 158 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (331 resets) in 1767 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 281 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 320 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 313 ms. (127 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 248752 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 248752 steps, saw 45492 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 06:31:52] [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-06-01 06:31:53] [INFO ] Deduced a trap composed of 31 places in 666 ms of which 3 ms to minimize.
[2024-06-01 06:31:53] [INFO ] Deduced a trap composed of 31 places in 694 ms of which 3 ms to minimize.
[2024-06-01 06:31:54] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 3 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-06-01 06:31:55] [INFO ] Deduced a trap composed of 31 places in 616 ms of which 3 ms to minimize.
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 3 ms to minimize.
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 31 places in 638 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 4907 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-06-01 06:31:58] [INFO ] Deduced a trap composed of 31 places in 489 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 2625 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 7589ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1844 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 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 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 223 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 223 ms. Remains : 58/319 places, 728/1158 transitions.
RANDOM walk for 35079 steps (241 resets) in 1505 ms. (23 steps per ms) remains 0/3 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 179 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 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 33237 reset in 180 ms.
Product exploration explored 100000 steps with 33280 reset in 201 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 162 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 0 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 2 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 1 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 1 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 1 ms
Applied a total of 636 rules in 142 ms. Remains 133 /319 variables (removed 186) and now considering 810/1158 (removed 348) transitions.
[2024-06-01 06:32:04] [INFO ] Redundant transitions in 15 ms returned []
Running 809 sub problems to find dead transitions.
// Phase 1: matrix 810 rows 133 cols
[2024-06-01 06:32:04] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 06:32:04] [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-06-01 06:32:25] [INFO ] Deduced a trap composed of 21 places in 498 ms of which 2 ms to minimize.
[2024-06-01 06:32:26] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 1 ms to minimize.
[2024-06-01 06:32:26] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:32:26] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 2 ms to minimize.
[2024-06-01 06:32:27] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 1 ms to minimize.
[2024-06-01 06:32:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:32:27] [INFO ] Deduced a trap composed of 8 places in 453 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 06:32:27] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:32:31] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 2 ms to minimize.
Problem TDEAD543 is UNSAT
[2024-06-01 06:32:31] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 2 ms to minimize.
Problem TDEAD544 is UNSAT
[2024-06-01 06:32:31] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-06-01 06:32:31] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
Problem TDEAD546 is UNSAT
[2024-06-01 06:32:32] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
[2024-06-01 06:32:32] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
Problem TDEAD548 is UNSAT
[2024-06-01 06:32:32] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-06-01 06:32:32] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
[2024-06-01 06:32:33] [INFO ] Deduced a trap composed of 3 places in 302 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 30019 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 31160 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 75855ms problems are : Problem set: 68 solved, 741 unsolved
Search for dead transitions found 68 dead transitions in 75864ms
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 1 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 0 ms
Applied a total of 2 rules in 58 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 76087 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 7 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-06-01 06:33:19] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 06:33:20] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-06-01 06:33:20] [INFO ] Invariant cache hit.
[2024-06-01 06:33:21] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 1157 sub problems to find dead transitions.
[2024-06-01 06:33:21] [INFO ] Invariant cache hit.
FORMULA AutonomousCar-PT-09b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-02
FORMULA AutonomousCar-PT-09b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-07
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-08
FORMULA AutonomousCar-PT-09b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-10
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-11
FORMULA AutonomousCar-PT-09b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-13
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-15
BK_STOP 1717225418264
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-09b-LTLFireability-00
ltl formula formula --ltl=/tmp/3323/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.060 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1572 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~115!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 422
pnml2lts-mc( 0/ 4): unique transitions count: 2830
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 436
pnml2lts-mc( 0/ 4): - cum. max stack depth: 436
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 436 states 2912 transitions, fanout: 6.679
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14533, Transitions per second: 97067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-01
ltl formula formula --ltl=/tmp/3323/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.070 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1564 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~115!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 444
pnml2lts-mc( 0/ 4): unique transitions count: 2908
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 454
pnml2lts-mc( 0/ 4): - cum. max stack depth: 454
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 454 states 2955 transitions, fanout: 6.509
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11350, Transitions per second: 73875
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-02
ltl formula formula --ltl=/tmp/3323/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.080 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1560 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~117 levels ~10000 states ~40276 transitions
pnml2lts-mc( 0/ 4): ~117 levels ~20000 states ~86136 transitions
pnml2lts-mc( 0/ 4): ~117 levels ~40000 states ~183776 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~80000 states ~362940 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~160000 states ~779896 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~320000 states ~1719728 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~640000 states ~3614604 transitions
pnml2lts-mc( 1/ 4): ~150 levels ~1280000 states ~7041388 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~2560000 states ~15810108 transitions
pnml2lts-mc( 0/ 4): ~130 levels ~5120000 states ~31169612 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-03
ltl formula formula --ltl=/tmp/3323/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.090 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1562 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~108!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 405
pnml2lts-mc( 0/ 4): unique transitions count: 2522
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 421
pnml2lts-mc( 0/ 4): - cum. max stack depth: 421
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 421 states 2603 transitions, fanout: 6.183
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14033, Transitions per second: 86767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-04
ltl formula formula --ltl=/tmp/3323/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.070 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1565 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~117!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 427
pnml2lts-mc( 0/ 4): unique transitions count: 2653
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 457
pnml2lts-mc( 0/ 4): - cum. max stack depth: 457
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 457 states 2756 transitions, fanout: 6.031
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11425, Transitions per second: 68900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.7 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-05
ltl formula formula --ltl=/tmp/3323/ltl_5_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.080 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1560 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~104!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 374
pnml2lts-mc( 0/ 4): unique transitions count: 2310
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 389
pnml2lts-mc( 0/ 4): - cum. max stack depth: 389
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 389 states 2392 transitions, fanout: 6.149
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19450, Transitions per second: 119600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.3 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-06
ltl formula formula --ltl=/tmp/3323/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.070 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~124 levels ~10000 states ~32988 transitions
pnml2lts-mc( 1/ 4): ~124 levels ~20000 states ~68812 transitions
pnml2lts-mc( 1/ 4): ~124 levels ~40000 states ~150712 transitions
pnml2lts-mc( 1/ 4): ~124 levels ~80000 states ~322808 transitions
pnml2lts-mc( 1/ 4): ~124 levels ~160000 states ~685712 transitions
pnml2lts-mc( 2/ 4): ~149 levels ~320000 states ~1478556 transitions
pnml2lts-mc( 2/ 4): ~149 levels ~640000 states ~3237104 transitions
pnml2lts-mc( 2/ 4): ~149 levels ~1280000 states ~6959824 transitions
pnml2lts-mc( 2/ 4): ~483 levels ~2560000 states ~14086172 transitions
pnml2lts-mc( 2/ 4): ~483 levels ~5120000 states ~30684504 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-07
ltl formula formula --ltl=/tmp/3323/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.090 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1558 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~120 levels ~10000 states ~40904 transitions
pnml2lts-mc( 3/ 4): ~120 levels ~20000 states ~88824 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~40000 states ~173452 transitions
pnml2lts-mc( 0/ 4): ~120 levels ~80000 states ~384448 transitions
pnml2lts-mc( 0/ 4): ~120 levels ~160000 states ~820408 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~320000 states ~1677656 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~640000 states ~3563652 transitions
pnml2lts-mc( 3/ 4): ~134 levels ~1280000 states ~6951056 transitions
pnml2lts-mc( 0/ 4): ~120 levels ~2560000 states ~15096456 transitions
pnml2lts-mc( 2/ 4): ~487 levels ~5120000 states ~33540688 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-08
ltl formula formula --ltl=/tmp/3323/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.160 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1560 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~154 levels ~10000 states ~43020 transitions
pnml2lts-mc( 1/ 4): ~154 levels ~20000 states ~92360 transitions
pnml2lts-mc( 1/ 4): ~154 levels ~40000 states ~197192 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~80000 states ~376436 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~160000 states ~784744 transitions
pnml2lts-mc( 3/ 4): ~116 levels ~320000 states ~1584036 transitions
pnml2lts-mc( 3/ 4): ~118 levels ~640000 states ~3232940 transitions
pnml2lts-mc( 3/ 4): ~118 levels ~1280000 states ~6724176 transitions
pnml2lts-mc( 3/ 4): ~118 levels ~2560000 states ~13963312 transitions
pnml2lts-mc( 3/ 4): ~121 levels ~5120000 states ~28638268 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-09
ltl formula formula --ltl=/tmp/3323/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.070 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1562 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~94!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 321
pnml2lts-mc( 0/ 4): unique transitions count: 2093
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 332
pnml2lts-mc( 0/ 4): - cum. max stack depth: 332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 332 states 2146 transitions, fanout: 6.464
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11067, Transitions per second: 71533
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-10
ltl formula formula --ltl=/tmp/3323/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.080 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~130 levels ~10000 states ~40692 transitions
pnml2lts-mc( 0/ 4): ~130 levels ~20000 states ~86996 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~40000 states ~177096 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~80000 states ~373308 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~160000 states ~783608 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~320000 states ~1710536 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~640000 states ~3545200 transitions
pnml2lts-mc( 0/ 4): ~139 levels ~1280000 states ~6992812 transitions
pnml2lts-mc( 1/ 4): ~127 levels ~2560000 states ~13602736 transitions
pnml2lts-mc( 1/ 4): ~127 levels ~5120000 states ~28811704 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-11
ltl formula formula --ltl=/tmp/3323/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.070 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~125 levels ~10000 states ~37372 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~20000 states ~77764 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~40000 states ~168384 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~80000 states ~393680 transitions
pnml2lts-mc( 0/ 4): ~116 levels ~160000 states ~808892 transitions
pnml2lts-mc( 0/ 4): ~116 levels ~320000 states ~1735784 transitions
pnml2lts-mc( 0/ 4): ~117 levels ~640000 states ~3517256 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~1280000 states ~6992736 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~2560000 states ~15061552 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~5120000 states ~29804180 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-12
ltl formula formula --ltl=/tmp/3323/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.060 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1555 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~110!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 411
pnml2lts-mc( 0/ 4): unique transitions count: 2537
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 439
pnml2lts-mc( 0/ 4): - cum. max stack depth: 439
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 439 states 2663 transitions, fanout: 6.066
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14633, Transitions per second: 88767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.2 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-13
ltl formula formula --ltl=/tmp/3323/ltl_13_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.070 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1565 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~111 levels ~10000 states ~43424 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~20000 states ~95952 transitions
pnml2lts-mc( 1/ 4): ~114 levels ~40000 states ~200024 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~80000 states ~398292 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~160000 states ~840000 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~320000 states ~1762376 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~640000 states ~3647164 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~1280000 states ~7237992 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~2560000 states ~14982892 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~5120000 states ~30353076 transitions
ltl formula name AutonomousCar-PT-09b-LTLFireability-14
ltl formula formula --ltl=/tmp/3323/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.070 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1562 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~111!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 437
pnml2lts-mc( 0/ 4): unique transitions count: 2678
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 453
pnml2lts-mc( 0/ 4): - cum. max stack depth: 453
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 453 states 2768 transitions, fanout: 6.110
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 15100, Transitions per second: 92267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLFireability-15
ltl formula formula --ltl=/tmp/3323/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3323/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3323/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3323/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3323/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1569 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~121 levels ~10000 states ~35608 transitions
pnml2lts-mc( 2/ 4): ~121 levels ~20000 states ~72472 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~40000 states ~142688 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~80000 states ~295280 transitions
pnml2lts-mc( 2/ 4): ~129 levels ~160000 states ~652344 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~320000 states ~1539744 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~640000 states ~3059184 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~1280000 states ~6709536 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~2560000 states ~14593888 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~5120000 states ~30203200 transitions
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-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 r468-smll-171620167500356"
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 ;