About the Execution of LTSMin+red for ShieldPPPs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1195.735 | 3600000.00 | 7972696.00 | 5177.50 | ?F?FFFT??T?FF??F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761100460.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 ShieldPPPs-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100460
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 349K May 18 16:43 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 ShieldPPPs-PT-020B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717245304199
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:35:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:35:05] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-01 12:35:05] [INFO ] Transformed 1363 places.
[2024-06-01 12:35:05] [INFO ] Transformed 1263 transitions.
[2024-06-01 12:35:05] [INFO ] Found NUPN structural information;
[2024-06-01 12:35:05] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-020B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 135 place count 1228 transition count 1128
Iterating global reduction 0 with 135 rules applied. Total rules applied 270 place count 1228 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 271 place count 1227 transition count 1127
Iterating global reduction 0 with 1 rules applied. Total rules applied 272 place count 1227 transition count 1127
Applied a total of 272 rules in 280 ms. Remains 1227 /1363 variables (removed 136) and now considering 1127/1263 (removed 136) transitions.
// Phase 1: matrix 1127 rows 1227 cols
[2024-06-01 12:35:06] [INFO ] Computed 221 invariants in 27 ms
[2024-06-01 12:35:06] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-06-01 12:35:06] [INFO ] Invariant cache hit.
[2024-06-01 12:35:07] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Running 1126 sub problems to find dead transitions.
[2024-06-01 12:35:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 1126 unsolved
Search for dead transitions found 0 dead transitions in 30442ms
Starting structural reductions in LTL mode, iteration 1 : 1227/1363 places, 1127/1263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32223 ms. Remains : 1227/1363 places, 1127/1263 transitions.
Support contains 44 out of 1227 places after structural reductions.
[2024-06-01 12:35:38] [INFO ] Flatten gal took : 101 ms
[2024-06-01 12:35:38] [INFO ] Flatten gal took : 58 ms
[2024-06-01 12:35:38] [INFO ] Input system was already deterministic with 1127 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (12 resets) in 1343 ms. (29 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
[2024-06-01 12:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 561/569 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 18 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:35:39] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 658/1227 variables, 125/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1227 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1127/2354 variables, 1227/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:35:41] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2024-06-01 12:35:41] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 4 ms to minimize.
[2024-06-01 12:35:41] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 4 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 4 ms to minimize.
[2024-06-01 12:35:43] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:35:43] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:35:43] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-06-01 12:35:43] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 12:35:43] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-06-01 12:35:44] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:35:44] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 5065ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1227 transition count 987
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1087 transition count 987
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 280 place count 1087 transition count 887
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 480 place count 987 transition count 887
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 483 place count 984 transition count 884
Iterating global reduction 2 with 3 rules applied. Total rules applied 486 place count 984 transition count 884
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 486 place count 984 transition count 883
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 983 transition count 883
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 2 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1196 place count 629 transition count 529
Partial Free-agglomeration rule applied 175 times.
Drop transitions (Partial Free agglomeration) removed 175 transitions
Iterating global reduction 2 with 175 rules applied. Total rules applied 1371 place count 629 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1372 place count 628 transition count 528
Applied a total of 1372 rules in 307 ms. Remains 628 /1227 variables (removed 599) and now considering 528/1127 (removed 599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 628/1227 places, 528/1127 transitions.
RANDOM walk for 40000 steps (10 resets) in 1561 ms. (25 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4188 steps (0 resets) in 35 ms. (116 steps per ms) remains 0/1 properties
Computed a total of 244 stabilizing places and 244 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' '!(F(p0))'
Support contains 1 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1226 transition count 984
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1084 transition count 984
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 284 place count 1084 transition count 885
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 482 place count 985 transition count 885
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 4 rules applied. Total rules applied 490 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 490 place count 981 transition count 878
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 496 place count 978 transition count 878
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1204 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1206 place count 622 transition count 522
Applied a total of 1206 rules in 157 ms. Remains 622 /1227 variables (removed 605) and now considering 522/1127 (removed 605) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:35:45] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 12:35:45] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 12:35:45] [INFO ] Invariant cache hit.
[2024-06-01 12:35:46] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-06-01 12:35:46] [INFO ] Redundant transitions in 27 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:35:55] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:35:55] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:35:55] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:35:55] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:35:55] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 144 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 159 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 173 places in 74 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:36:01] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 227 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 212/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 15/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 104 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 104 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 6 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 98 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 144 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 144 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 143 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:38] [INFO ] Deduced a trap composed of 190 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 203 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 215 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 231 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 248 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 264 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 280 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 287 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 260 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 39/39 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1227 places, 522/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61071 ms. Remains : 622/1227 places, 522/1127 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-00
Product exploration explored 100000 steps with 22328 reset in 478 ms.
Product exploration explored 100000 steps with 22161 reset in 517 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/622 stabilizing places and 2/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-06-01 12:36:48] [INFO ] Invariant cache hit.
[2024-06-01 12:36:48] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2024-06-01 12:36:49] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-06-01 12:36:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:36:49] [INFO ] [Nat]Absence check using 221 positive place invariants in 81 ms returned sat
[2024-06-01 12:36:50] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2024-06-01 12:36:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-01 12:36:50] [INFO ] Computed and/alt/rep : 519/1008/519 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 12:36:57] [INFO ] Added : 500 causal constraints over 100 iterations in 7268 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:36:57] [INFO ] Invariant cache hit.
[2024-06-01 12:36:58] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 12:36:58] [INFO ] Invariant cache hit.
[2024-06-01 12:36:58] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2024-06-01 12:36:58] [INFO ] Redundant transitions in 19 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:37:08] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:37:08] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:37:08] [INFO ] Deduced a trap composed of 173 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:18] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:37:18] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 timeout
0.0)
(s499 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 227 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 212/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 15/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 104 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 100 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 101 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 98 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:37:33] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:39] [INFO ] Deduced a trap composed of 144 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:37:39] [INFO ] Deduced a trap composed of 144 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:37:39] [INFO ] Deduced a trap composed of 143 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:37:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:37:50] [INFO ] Deduced a trap composed of 190 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:37:51] [INFO ] Deduced a trap composed of 203 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:37:51] [INFO ] Deduced a trap composed of 215 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:37:51] [INFO ] Deduced a trap composed of 231 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:37:51] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:37:51] [INFO ] Deduced a trap composed of 264 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:37:52] [INFO ] Deduced a trap composed of 280 places in 104 ms of which 3 ms to minimize.
[2024-06-01 12:37:52] [INFO ] Deduced a trap composed of 287 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 882 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 39/39 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60962 ms. Remains : 622/622 places, 522/522 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/622 stabilizing places and 2/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 12:37:59] [INFO ] Invariant cache hit.
[2024-06-01 12:37:59] [INFO ] [Real]Absence check using 221 positive place invariants in 73 ms returned sat
[2024-06-01 12:38:00] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-06-01 12:38:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:38:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 69 ms returned sat
[2024-06-01 12:38:01] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-06-01 12:38:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-01 12:38:01] [INFO ] Computed and/alt/rep : 519/1008/519 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-01 12:38:08] [INFO ] Added : 500 causal constraints over 100 iterations in 7083 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22370 reset in 372 ms.
Product exploration explored 100000 steps with 22158 reset in 439 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:38:09] [INFO ] Invariant cache hit.
[2024-06-01 12:38:09] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 12:38:09] [INFO ] Invariant cache hit.
[2024-06-01 12:38:10] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-06-01 12:38:10] [INFO ] Redundant transitions in 43 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:38:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:38:17] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:38:18] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:38:19] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:38:19] [INFO ] Deduced a trap composed of 144 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:38:19] [INFO ] Deduced a trap composed of 159 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:38:19] [INFO ] Deduced a trap composed of 173 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:24] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:29] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:38:29] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 227 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 212/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 15/227 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 104 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 101 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 104 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 100 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:38:45] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:38:45] [INFO ] Deduced a trap composed of 98 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:38:45] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:50] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:38:50] [INFO ] Deduced a trap composed of 144 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:38:50] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:38:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:39:02] [INFO ] Deduced a trap composed of 190 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:39:02] [INFO ] Deduced a trap composed of 203 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 215 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 231 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 248 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 264 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:39:04] [INFO ] Deduced a trap composed of 280 places in 113 ms of which 3 ms to minimize.
[2024-06-01 12:39:04] [INFO ] Deduced a trap composed of 287 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 260 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 39/39 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60889 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-00 finished in 204992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1223 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1223 transition count 1123
Applied a total of 8 rules in 95 ms. Remains 1223 /1227 variables (removed 4) and now considering 1123/1127 (removed 4) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:39:10] [INFO ] Computed 221 invariants in 5 ms
[2024-06-01 12:39:10] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 12:39:10] [INFO ] Invariant cache hit.
[2024-06-01 12:39:11] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:39:11] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30182ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1227 places, 1123/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31650 ms. Remains : 1223/1227 places, 1123/1127 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-01
Stuttering criterion allowed to conclude after 3156 steps with 0 reset in 41 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-01 finished in 31902 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(F(p0)))))'
Support contains 3 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1222 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1222 transition count 1122
Applied a total of 10 rules in 67 ms. Remains 1222 /1227 variables (removed 5) and now considering 1122/1127 (removed 5) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:39:42] [INFO ] Computed 221 invariants in 8 ms
[2024-06-01 12:39:42] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-06-01 12:39:42] [INFO ] Invariant cache hit.
[2024-06-01 12:39:43] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30194ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1227 places, 1122/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31561 ms. Remains : 1222/1227 places, 1122/1127 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Product exploration explored 100000 steps with 25000 reset in 216 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1941 steps (0 resets) in 17 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Applied a total of 0 rules in 38 ms. Remains 1222 /1222 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2024-06-01 12:40:15] [INFO ] Invariant cache hit.
[2024-06-01 12:40:15] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 12:40:15] [INFO ] Invariant cache hit.
[2024-06-01 12:40:16] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Finished structural reductions in LTL mode , in 1 iterations and 31501 ms. Remains : 1222/1222 places, 1122/1122 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1622 steps (0 resets) in 13 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 218 ms.
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1222 transition count 1122
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 140 place count 1222 transition count 1123
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 182 place count 1222 transition count 1123
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 597 places in 1 ms
Iterating global reduction 1 with 415 rules applied. Total rules applied 597 place count 1222 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 737 place count 1082 transition count 983
Deduced a syphon composed of 457 places in 1 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 877 place count 1082 transition count 983
Deduced a syphon composed of 457 places in 1 ms
Applied a total of 877 rules in 396 ms. Remains 1082 /1222 variables (removed 140) and now considering 983/1122 (removed 139) transitions.
[2024-06-01 12:40:48] [INFO ] Redundant transitions in 12 ms returned []
Running 982 sub problems to find dead transitions.
// Phase 1: matrix 983 rows 1082 cols
[2024-06-01 12:40:48] [INFO ] Computed 221 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (OVERLAPS) 1/1082 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 982 unsolved
[2024-06-01 12:41:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD955 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 20/241 constraints. Problems are: Problem set: 93 solved, 889 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/2065 variables, and 241 constraints, problems are : Problem set: 93 solved, 889 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1082 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 93 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 0/0 constraints. Problems are: Problem set: 93 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 94/1082 variables, 221/221 constraints. Problems are: Problem set: 93 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 20/241 constraints. Problems are: Problem set: 93 solved, 889 unsolved
[2024-06-01 12:41:31] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 12:41:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD839 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 20/261 constraints. Problems are: Problem set: 169 solved, 813 unsolved
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-06-01 12:41:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-06-01 12:41:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1082 variables, 20/281 constraints. Problems are: Problem set: 242 solved, 740 unsolved
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD198 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
[2024-06-01 12:41:39] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-06-01 12:41:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1082 variables, 20/301 constraints. Problems are: Problem set: 292 solved, 690 unsolved
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-06-01 12:41:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-06-01 12:41:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1082 variables, 20/321 constraints. Problems are: Problem set: 342 solved, 640 unsolved
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 12:41:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
[2024-06-01 12:41:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 20/341 constraints. Problems are: Problem set: 391 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/2065 variables, and 341 constraints, problems are : Problem set: 391 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1082 constraints, PredecessorRefiner: 0/982 constraints, Known Traps: 120/120 constraints]
After SMT, in 60374ms problems are : Problem set: 391 solved, 591 unsolved
Search for dead transitions found 391 dead transitions in 60383ms
Found 391 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 391 transitions
Dead transitions reduction (with SMT) removed 391 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1082/1222 places, 592/1122 transitions.
Graph (complete) has 1768 edges and 1082 vertex of which 691 are kept as prefixes of interest. Removing 391 places using SCC suffix rule.2 ms
Discarding 391 places :
Also discarding 0 output transitions
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 1 rules in 19 ms. Remains 691 /1082 variables (removed 391) and now considering 592/592 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 691/1222 places, 592/1122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60841 ms. Remains : 691/1222 places, 592/1122 transitions.
Support contains 3 out of 1222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Applied a total of 0 rules in 34 ms. Remains 1222 /1222 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:41:49] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:41:49] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-01 12:41:49] [INFO ] Invariant cache hit.
[2024-06-01 12:41:50] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:41:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30160ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30170ms
Finished structural reductions in LTL mode , in 1 iterations and 31483 ms. Remains : 1222/1222 places, 1122/1122 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-02 finished in 158189 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(((p1 U p2)&&p0))))'
Support contains 4 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1226 transition count 986
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1086 transition count 986
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 280 place count 1086 transition count 886
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 480 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 485 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 490 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 490 place count 981 transition count 878
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 496 place count 978 transition count 878
Performed 352 Post agglomeration using F-continuation condition.Transition count delta: 352
Deduced a syphon composed of 352 places in 0 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 2 with 704 rules applied. Total rules applied 1200 place count 626 transition count 526
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1202 place count 624 transition count 524
Applied a total of 1202 rules in 133 ms. Remains 624 /1227 variables (removed 603) and now considering 524/1127 (removed 603) transitions.
// Phase 1: matrix 524 rows 624 cols
[2024-06-01 12:42:20] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 12:42:21] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-01 12:42:21] [INFO ] Invariant cache hit.
[2024-06-01 12:42:21] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-06-01 12:42:21] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:42:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:42:44] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 114 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:42:46] [INFO ] Deduced a trap composed of 128 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 230 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 524/1148 variables, 624/854 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1148 variables, 520/1374 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1148/1148 variables, and 1374 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 9/9 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in SI_LTL mode, iteration 1 : 624/1227 places, 524/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61138 ms. Remains : 624/1227 places, 524/1127 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-03
Stuttering criterion allowed to conclude after 1321 steps with 0 reset in 16 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-03 finished in 61266 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' '!(((p0||X(G(p1))) U (!p0&&(p1 U p2))))'
Support contains 5 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1223 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1223 transition count 1123
Applied a total of 8 rules in 53 ms. Remains 1223 /1227 variables (removed 4) and now considering 1123/1127 (removed 4) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:43:21] [INFO ] Computed 221 invariants in 8 ms
[2024-06-01 12:43:22] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 12:43:22] [INFO ] Invariant cache hit.
[2024-06-01 12:43:23] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:43:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30153ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30163ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1227 places, 1123/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31466 ms. Remains : 1223/1227 places, 1123/1127 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-04 finished in 31655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 3 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1226 transition count 986
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1086 transition count 986
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 280 place count 1086 transition count 886
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 480 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 485 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 490 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 490 place count 981 transition count 878
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 496 place count 978 transition count 878
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1202 place count 625 transition count 525
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1204 place count 623 transition count 523
Applied a total of 1204 rules in 101 ms. Remains 623 /1227 variables (removed 604) and now considering 523/1127 (removed 604) transitions.
// Phase 1: matrix 523 rows 623 cols
[2024-06-01 12:43:53] [INFO ] Computed 221 invariants in 1 ms
[2024-06-01 12:43:53] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 12:43:53] [INFO ] Invariant cache hit.
[2024-06-01 12:43:54] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2024-06-01 12:43:54] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:43:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:17] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 58 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 132 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 146 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 162 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 176 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 191 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 205 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 222 places in 90 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 233 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 250 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 261 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 279 places in 94 ms of which 3 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 296 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 19/241 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1146 variables, and 241 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 19/241 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:33] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:44:34] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:44:34] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:44:34] [INFO ] Deduced a trap composed of 161 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 161 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 157 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 128 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 157 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 156 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 193 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:44:35] [INFO ] Deduced a trap composed of 189 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 220 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 220 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 222 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 219 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 220 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 219 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 218 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:40] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:44:40] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:44:40] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 146 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 145 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 145 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 145 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:44:41] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:44:42] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:46] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:44:46] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 158 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 157 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 157 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 157 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 163 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 163 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 159 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:44:53] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 161 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 159 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 159 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 158 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 160 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:44:54] [INFO ] Deduced a trap composed of 160 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 60118ms, After SMT, problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/1227 places, 523/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60957 ms. Remains : 623/1227 places, 523/1127 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, p0]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1047 steps with 0 reset in 11 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-05 finished in 61065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 2 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1222 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1222 transition count 1122
Applied a total of 10 rules in 51 ms. Remains 1222 /1227 variables (removed 5) and now considering 1122/1127 (removed 5) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:44:54] [INFO ] Computed 221 invariants in 7 ms
[2024-06-01 12:44:54] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 12:44:54] [INFO ] Invariant cache hit.
[2024-06-01 12:44:55] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:44:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1227 places, 1122/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31489 ms. Remains : 1222/1227 places, 1122/1127 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-07
Product exploration explored 100000 steps with 700 reset in 294 ms.
Product exploration explored 100000 steps with 711 reset in 305 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1222 stabilizing places and 239/1122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (12 resets) in 496 ms. (80 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
[2024-06-01 12:45:27] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 515/517 variables, 91/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 705/1222 variables, 130/221 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:45:27] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 5 ms to minimize.
[2024-06-01 12:45:28] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2024-06-01 12:45:28] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 4 ms to minimize.
[2024-06-01 12:45:28] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 4 ms to minimize.
[2024-06-01 12:45:28] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 4 ms to minimize.
[2024-06-01 12:45:28] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 4 ms to minimize.
[2024-06-01 12:45:29] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 4 ms to minimize.
[2024-06-01 12:45:29] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2024-06-01 12:45:29] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 9/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1222 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1122/2344 variables, 1222/1452 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:45:30] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 5 ms to minimize.
[2024-06-01 12:45:30] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 5 ms to minimize.
[2024-06-01 12:45:30] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 5 ms to minimize.
[2024-06-01 12:45:31] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 5 ms to minimize.
[2024-06-01 12:45:31] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 5 ms to minimize.
[2024-06-01 12:45:31] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 5 ms to minimize.
[2024-06-01 12:45:31] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 5 ms to minimize.
[2024-06-01 12:45:32] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 5 ms to minimize.
[2024-06-01 12:45:32] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 4 ms to minimize.
SMT process timed out in 5147ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1222 transition count 980
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1080 transition count 980
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1080 transition count 880
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 980 transition count 880
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1196 place count 624 transition count 524
Partial Free-agglomeration rule applied 177 times.
Drop transitions (Partial Free agglomeration) removed 177 transitions
Iterating global reduction 2 with 177 rules applied. Total rules applied 1373 place count 624 transition count 524
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1374 place count 623 transition count 523
Applied a total of 1374 rules in 101 ms. Remains 623 /1222 variables (removed 599) and now considering 523/1122 (removed 599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 623/1222 places, 523/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 8461 steps (0 resets) in 23 ms. (352 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 330 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:45:33] [INFO ] Invariant cache hit.
[2024-06-01 12:45:33] [INFO ] [Real]Absence check using 221 positive place invariants in 135 ms returned sat
[2024-06-01 12:45:37] [INFO ] [Real]Absence check using state equation in 3963 ms returned sat
[2024-06-01 12:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:45:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 113 ms returned sat
[2024-06-01 12:45:40] [INFO ] [Nat]Absence check using state equation in 2512 ms returned sat
[2024-06-01 12:45:41] [INFO ] Computed and/alt/rep : 1121/1982/1121 causal constraints (skipped 0 transitions) in 59 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1222 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 : 1222/1222 places, 1122/1122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1221 transition count 979
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1079 transition count 979
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1079 transition count 879
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 979 transition count 879
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1192 place count 625 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1194 place count 623 transition count 523
Applied a total of 1194 rules in 85 ms. Remains 623 /1222 variables (removed 599) and now considering 523/1122 (removed 599) transitions.
// Phase 1: matrix 523 rows 623 cols
[2024-06-01 12:45:52] [INFO ] Computed 221 invariants in 5 ms
[2024-06-01 12:45:53] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 12:45:53] [INFO ] Invariant cache hit.
[2024-06-01 12:45:53] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-06-01 12:45:53] [INFO ] Redundant transitions in 4 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:02] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 63 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 111 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 127 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:46:17] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:46:18] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:46:18] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:46:18] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:46:18] [INFO ] Deduced a trap composed of 66 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 11/238 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:46:19] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1146 variables, and 243 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:33] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:46:33] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:46:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:39] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:40] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:46:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:46:50] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:46:52] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1146 variables, and 260 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 39/39 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/1222 places, 523/1122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61026 ms. Remains : 623/1222 places, 523/1122 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/623 stabilizing places and 2/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:46:54] [INFO ] Invariant cache hit.
[2024-06-01 12:46:54] [INFO ] [Real]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-06-01 12:46:55] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2024-06-01 12:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:46:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 63 ms returned sat
[2024-06-01 12:46:56] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-06-01 12:46:56] [INFO ] Computed and/alt/rep : 520/1195/520 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 12:47:00] [INFO ] Added : 320 causal constraints over 64 iterations in 3721 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22472 reset in 274 ms.
Product exploration explored 100000 steps with 22198 reset in 377 ms.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 622 transition count 522
Applied a total of 2 rules in 18 ms. Remains 622 /623 variables (removed 1) and now considering 522/523 (removed 1) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:47:01] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 12:47:01] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 12:47:01] [INFO ] Invariant cache hit.
[2024-06-01 12:47:01] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2024-06-01 12:47:01] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:47:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 95 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 111 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 127 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 143 places in 54 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 100/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:47:26] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:47:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:47:27] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:47:27] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:47:27] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:47:31] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:47:31] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:47:31] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 244 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 100/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (OVERLAPS) 522/1144 variables, 622/866 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 519/1385 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 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 1144/1144 variables, and 1386 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 24/24 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/623 places, 522/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60921 ms. Remains : 622/623 places, 522/523 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-07 finished in 187460 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 U (p1||G(p0))))))'
Support contains 2 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1226 transition count 985
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1085 transition count 985
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 282 place count 1085 transition count 885
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 482 place count 985 transition count 885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 980 transition count 880
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 980 transition count 880
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 492 place count 980 transition count 878
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 496 place count 978 transition count 878
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1204 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1206 place count 622 transition count 522
Applied a total of 1206 rules in 107 ms. Remains 622 /1227 variables (removed 605) and now considering 522/1127 (removed 605) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:48:02] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:48:02] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 12:48:02] [INFO ] Invariant cache hit.
[2024-06-01 12:48:02] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-06-01 12:48:02] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:48:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:48:11] [INFO ] Deduced a trap composed of 113 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:48:12] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:48:12] [INFO ] Deduced a trap composed of 144 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:27] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:48:28] [INFO ] Deduced a trap composed of 175 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:48:28] [INFO ] Deduced a trap composed of 188 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:48:28] [INFO ] Deduced a trap composed of 206 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:48:28] [INFO ] Deduced a trap composed of 223 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:48:28] [INFO ] Deduced a trap composed of 236 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 253 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 270 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 282 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 295 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 241 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:42] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:48:43] [INFO ] Deduced a trap composed of 113 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:48:43] [INFO ] Deduced a trap composed of 113 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:48:43] [INFO ] Deduced a trap composed of 130 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:48:43] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 101 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 114 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 144 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 160 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:48:51] [INFO ] Deduced a trap composed of 175 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:48:51] [INFO ] Deduced a trap composed of 189 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:48:51] [INFO ] Deduced a trap composed of 213 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:48:52] [INFO ] Deduced a trap composed of 226 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:56] [INFO ] Deduced a trap composed of 142 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:48:56] [INFO ] Deduced a trap composed of 146 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 253 places in 94 ms of which 3 ms to minimize.
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 252 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 248 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 248 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 247 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 247 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 247 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 247 places in 87 ms of which 3 ms to minimize.
[2024-06-01 12:48:58] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:48:59] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:48:59] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 280 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 59/59 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1227 places, 522/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61034 ms. Remains : 622/1227 places, 522/1127 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-08
Product exploration explored 100000 steps with 249 reset in 531 ms.
Product exploration explored 100000 steps with 207 reset in 627 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1291 steps (0 resets) in 16 ms. (75 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 458 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:49:05] [INFO ] Invariant cache hit.
[2024-06-01 12:49:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 12:49:05] [INFO ] Invariant cache hit.
[2024-06-01 12:49:06] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2024-06-01 12:49:06] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:49:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:14] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:49:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:49:14] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:49:14] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:49:14] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:49:15] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:15] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:49:15] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:49:15] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:49:15] [INFO ] Deduced a trap composed of 144 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:31] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 175 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 188 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 206 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 223 places in 85 ms of which 5 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 236 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 253 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 270 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 282 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:49:34] [INFO ] Deduced a trap composed of 295 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 241 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:45] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 113 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 144 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:49:54] [INFO ] Deduced a trap composed of 160 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:49:54] [INFO ] Deduced a trap composed of 175 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:49:54] [INFO ] Deduced a trap composed of 189 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:49:55] [INFO ] Deduced a trap composed of 213 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:49:55] [INFO ] Deduced a trap composed of 226 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:00] [INFO ] Deduced a trap composed of 142 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:50:00] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:50:00] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 253 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 252 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 248 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 248 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 247 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:50:01] [INFO ] Deduced a trap composed of 247 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:50:02] [INFO ] Deduced a trap composed of 247 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:50:02] [INFO ] Deduced a trap composed of 247 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:50:02] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:50:02] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 3 ms to minimize.
[2024-06-01 12:50:02] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 280 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 59/59 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60839 ms. Remains : 622/622 places, 522/522 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 429 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 2942 steps (1 resets) in 31 ms. (91 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 431 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 236 reset in 514 ms.
Product exploration explored 100000 steps with 217 reset in 614 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 11 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:50:08] [INFO ] Invariant cache hit.
[2024-06-01 12:50:08] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 12:50:08] [INFO ] Invariant cache hit.
[2024-06-01 12:50:09] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-06-01 12:50:09] [INFO ] Redundant transitions in 4 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:50:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 144 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:34] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:50:34] [INFO ] Deduced a trap composed of 175 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 188 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 206 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 223 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 236 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:50:36] [INFO ] Deduced a trap composed of 253 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:50:36] [INFO ] Deduced a trap composed of 270 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:50:36] [INFO ] Deduced a trap composed of 282 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:50:36] [INFO ] Deduced a trap composed of 295 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 241 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 113 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 100 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:50:56] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:50:56] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:50:56] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:50:56] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:50:56] [INFO ] Deduced a trap composed of 130 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:50:57] [INFO ] Deduced a trap composed of 144 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:50:57] [INFO ] Deduced a trap composed of 160 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:50:57] [INFO ] Deduced a trap composed of 175 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:50:57] [INFO ] Deduced a trap composed of 189 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:50:58] [INFO ] Deduced a trap composed of 213 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:50:58] [INFO ] Deduced a trap composed of 226 places in 104 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:51:03] [INFO ] Deduced a trap composed of 142 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:51:03] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:51:03] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 253 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 252 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 248 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 248 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 247 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 247 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 247 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:51:04] [INFO ] Deduced a trap composed of 247 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:51:05] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:51:05] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:51:05] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 280 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 59/59 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60863 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-08 finished in 187469 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||G(F(p1))))||X(p2)))'
Support contains 5 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1222 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1222 transition count 1122
Applied a total of 10 rules in 54 ms. Remains 1222 /1227 variables (removed 5) and now considering 1122/1127 (removed 5) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:51:09] [INFO ] Computed 221 invariants in 12 ms
[2024-06-01 12:51:09] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 12:51:09] [INFO ] Invariant cache hit.
[2024-06-01 12:51:10] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30185ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1227 places, 1122/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31556 ms. Remains : 1222/1227 places, 1122/1127 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-020B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-020B-LTLFireability-09 finished in 32417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((p1 U (p2||G(p1)))))))'
Support contains 2 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1223 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1223 transition count 1123
Applied a total of 8 rules in 53 ms. Remains 1223 /1227 variables (removed 4) and now considering 1123/1127 (removed 4) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:51:41] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:51:42] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-06-01 12:51:42] [INFO ] Invariant cache hit.
[2024-06-01 12:51:43] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:51:43] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1227 places, 1123/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31460 ms. Remains : 1223/1227 places, 1123/1127 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-10
Product exploration explored 100000 steps with 442 reset in 315 ms.
Product exploration explored 100000 steps with 449 reset in 343 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3072 steps (0 resets) in 28 ms. (105 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1123/1123 transitions.
Applied a total of 0 rules in 24 ms. Remains 1223 /1223 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
[2024-06-01 12:52:15] [INFO ] Invariant cache hit.
[2024-06-01 12:52:15] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 12:52:15] [INFO ] Invariant cache hit.
[2024-06-01 12:52:16] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:52:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30180ms
Finished structural reductions in LTL mode , in 1 iterations and 31428 ms. Remains : 1223/1223 places, 1123/1123 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3581 steps (0 resets) in 37 ms. (94 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 444 reset in 308 ms.
Product exploration explored 100000 steps with 442 reset in 346 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 1123/1123 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1223 transition count 1123
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 141 place count 1223 transition count 1124
Deduced a syphon composed of 181 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 181 place count 1223 transition count 1124
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 601 places in 1 ms
Iterating global reduction 1 with 420 rules applied. Total rules applied 601 place count 1223 transition count 1124
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 743 place count 1081 transition count 982
Deduced a syphon composed of 459 places in 1 ms
Iterating global reduction 1 with 142 rules applied. Total rules applied 885 place count 1081 transition count 982
Deduced a syphon composed of 459 places in 1 ms
Applied a total of 885 rules in 161 ms. Remains 1081 /1223 variables (removed 142) and now considering 982/1123 (removed 141) transitions.
[2024-06-01 12:52:48] [INFO ] Redundant transitions in 13 ms returned []
Running 981 sub problems to find dead transitions.
// Phase 1: matrix 982 rows 1081 cols
[2024-06-01 12:52:48] [INFO ] Computed 221 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (OVERLAPS) 1/1081 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:53:17] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:53:18] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/2063 variables, and 233 constraints, problems are : Problem set: 12 solved, 969 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1081 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 12 solved, 969 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1068 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 969 unsolved
At refinement iteration 1 (OVERLAPS) 13/1081 variables, 221/221 constraints. Problems are: Problem set: 12 solved, 969 unsolved
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD955 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1081 variables, 12/233 constraints. Problems are: Problem set: 63 solved, 918 unsolved
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD770 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1081 variables, 20/253 constraints. Problems are: Problem set: 137 solved, 844 unsolved
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-06-01 12:53:36] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 12:53:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD931 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1081 variables, 20/273 constraints. Problems are: Problem set: 212 solved, 769 unsolved
[2024-06-01 12:53:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
[2024-06-01 12:53:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-06-01 12:53:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
[2024-06-01 12:53:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-06-01 12:53:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-06-01 12:53:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 20/293 constraints. Problems are: Problem set: 269 solved, 712 unsolved
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD889 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 20/313 constraints. Problems are: Problem set: 319 solved, 662 unsolved
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-06-01 12:53:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 5 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD774 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/333 constraints. Problems are: Problem set: 369 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/2063 variables, and 333 constraints, problems are : Problem set: 369 solved, 612 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1081 constraints, PredecessorRefiner: 0/981 constraints, Known Traps: 112/112 constraints]
After SMT, in 60379ms problems are : Problem set: 369 solved, 612 unsolved
Search for dead transitions found 369 dead transitions in 60387ms
Found 369 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 369 transitions
Dead transitions reduction (with SMT) removed 369 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1223 places, 613/1123 transitions.
Graph (complete) has 1815 edges and 1081 vertex of which 712 are kept as prefixes of interest. Removing 369 places using SCC suffix rule.1 ms
Discarding 369 places :
Also discarding 0 output transitions
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 712 /1081 variables (removed 369) and now considering 613/613 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 712/1223 places, 613/1123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60587 ms. Remains : 712/1223 places, 613/1123 transitions.
Support contains 2 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1123/1123 transitions.
Applied a total of 0 rules in 25 ms. Remains 1223 /1223 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:53:48] [INFO ] Computed 221 invariants in 7 ms
[2024-06-01 12:53:48] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 12:53:48] [INFO ] Invariant cache hit.
[2024-06-01 12:53:49] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:53:49] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Finished structural reductions in LTL mode , in 1 iterations and 31485 ms. Remains : 1223/1223 places, 1123/1123 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-10 finished in 158240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1223 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1223 transition count 1123
Applied a total of 8 rules in 48 ms. Remains 1223 /1227 variables (removed 4) and now considering 1123/1127 (removed 4) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:54:20] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:54:20] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 12:54:20] [INFO ] Invariant cache hit.
[2024-06-01 12:54:21] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:54:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1227 places, 1123/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31481 ms. Remains : 1223/1227 places, 1123/1127 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-11 finished in 31619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1226 transition count 984
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1084 transition count 984
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 284 place count 1084 transition count 885
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 482 place count 985 transition count 885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 980 transition count 880
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 980 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 492 place count 980 transition count 877
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 498 place count 977 transition count 877
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1204 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1206 place count 622 transition count 522
Applied a total of 1206 rules in 124 ms. Remains 622 /1227 variables (removed 605) and now considering 522/1127 (removed 605) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:54:51] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 12:54:52] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 12:54:52] [INFO ] Invariant cache hit.
[2024-06-01 12:54:52] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-06-01 12:54:52] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:55:00] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:55:00] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:55:00] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:55:01] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:55:01] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:55:02] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:55:02] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:55:02] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:55:02] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:55:02] [INFO ] Deduced a trap composed of 111 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:55:03] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:55:03] [INFO ] Deduced a trap composed of 142 places in 82 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:55:08] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 142 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 141 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 140 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 143 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 139 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:55:15] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 247 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 220/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 27/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:55:28] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:55:28] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:55:34] [INFO ] Deduced a trap composed of 141 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:55:34] [INFO ] Deduced a trap composed of 139 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:55:35] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:55:35] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 132 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:55:46] [INFO ] Deduced a trap composed of 156 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 263 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 42/42 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1227 places, 522/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60993 ms. Remains : 622/1227 places, 522/1127 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-13
Product exploration explored 100000 steps with 200 reset in 509 ms.
Product exploration explored 100000 steps with 201 reset in 621 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3230 steps (0 resets) in 34 ms. (92 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 12:55:54] [INFO ] Invariant cache hit.
[2024-06-01 12:55:54] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2024-06-01 12:55:55] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2024-06-01 12:55:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:55:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 70 ms returned sat
[2024-06-01 12:55:56] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2024-06-01 12:55:56] [INFO ] Computed and/alt/rep : 519/995/519 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 12:56:04] [INFO ] Added : 518 causal constraints over 104 iterations in 8072 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 12 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:56:04] [INFO ] Invariant cache hit.
[2024-06-01 12:56:05] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 12:56:05] [INFO ] Invariant cache hit.
[2024-06-01 12:56:05] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-06-01 12:56:05] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:56:13] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:56:13] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:56:13] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:56:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:56:14] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:56:15] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:56:15] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:56:15] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:56:15] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:56:15] [INFO ] Deduced a trap composed of 111 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:56:16] [INFO ] Deduced a trap composed of 129 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:56:16] [INFO ] Deduced a trap composed of 142 places in 80 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:27] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 142 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 141 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 143 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 139 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 247 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 220/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 27/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 128 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:46] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 141 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 139 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 88 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 99 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 132 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 156 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 885 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 42/42 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60866 ms. Remains : 622/622 places, 522/522 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3191 steps (0 resets) in 32 ms. (96 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 12:57:06] [INFO ] Invariant cache hit.
[2024-06-01 12:57:06] [INFO ] [Real]Absence check using 221 positive place invariants in 78 ms returned sat
[2024-06-01 12:57:07] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2024-06-01 12:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:57:07] [INFO ] [Nat]Absence check using 221 positive place invariants in 69 ms returned sat
[2024-06-01 12:57:08] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2024-06-01 12:57:08] [INFO ] Computed and/alt/rep : 519/995/519 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 12:57:16] [INFO ] Added : 518 causal constraints over 104 iterations in 8112 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 203 reset in 507 ms.
Product exploration explored 100000 steps with 199 reset in 617 ms.
Support contains 4 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:57:17] [INFO ] Invariant cache hit.
[2024-06-01 12:57:17] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-01 12:57:17] [INFO ] Invariant cache hit.
[2024-06-01 12:57:18] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-06-01 12:57:18] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:57:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:26] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:57:26] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:57:26] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:57:26] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:57:28] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:57:28] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:57:28] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:57:28] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:57:28] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 142 places in 85 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:57:34] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 142 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 141 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 143 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 139 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 247 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 220/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 27/247 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 141 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 139 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 1/622 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 116 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 132 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 156 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (OVERLAPS) 522/1144 variables, 622/885 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1404 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 42/42 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60864 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-13 finished in 206870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 1 out of 1227 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 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1226 transition count 984
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1084 transition count 984
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1084 transition count 884
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 984 transition count 884
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 489 place count 979 transition count 879
Iterating global reduction 2 with 5 rules applied. Total rules applied 494 place count 979 transition count 879
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 979 transition count 876
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 500 place count 976 transition count 876
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 1202 place count 625 transition count 525
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1204 place count 623 transition count 523
Applied a total of 1204 rules in 95 ms. Remains 623 /1227 variables (removed 604) and now considering 523/1127 (removed 604) transitions.
// Phase 1: matrix 523 rows 623 cols
[2024-06-01 12:58:18] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:58:18] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 12:58:18] [INFO ] Invariant cache hit.
[2024-06-01 12:58:19] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-06-01 12:58:19] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:58:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:58:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:58:27] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1146 variables, and 228 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 523/1146 variables, 623/851 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 520/1371 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 1373 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 9/9 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/1227 places, 523/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60959 ms. Remains : 623/1227 places, 523/1127 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-14
Product exploration explored 100000 steps with 103 reset in 537 ms.
Product exploration explored 100000 steps with 101 reset in 662 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 3867 steps (0 resets) in 41 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 12:59:21] [INFO ] Invariant cache hit.
[2024-06-01 12:59:21] [INFO ] [Real]Absence check using 221 positive place invariants in 76 ms returned sat
[2024-06-01 12:59:22] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2024-06-01 12:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:59:22] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2024-06-01 12:59:23] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-06-01 12:59:23] [INFO ] Computed and/alt/rep : 520/1013/520 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 12:59:33] [INFO ] Added : 517 causal constraints over 104 iterations in 10076 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 623 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 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 12:59:33] [INFO ] Invariant cache hit.
[2024-06-01 12:59:33] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 12:59:33] [INFO ] Invariant cache hit.
[2024-06-01 12:59:34] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-06-01 12:59:34] [INFO ] Redundant transitions in 4 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:59:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:59:42] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:59:42] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1146 variables, and 228 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 1/623 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 523/1146 variables, 623/851 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 520/1371 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:00:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:00:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 1373 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 9/9 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60862 ms. Remains : 623/623 places, 523/523 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 4156 steps (0 resets) in 35 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-06-01 13:00:34] [INFO ] Invariant cache hit.
[2024-06-01 13:00:35] [INFO ] [Real]Absence check using 221 positive place invariants in 77 ms returned sat
[2024-06-01 13:00:35] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2024-06-01 13:00:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:00:36] [INFO ] [Nat]Absence check using 221 positive place invariants in 71 ms returned sat
[2024-06-01 13:00:36] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-06-01 13:00:37] [INFO ] Computed and/alt/rep : 520/1013/520 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 13:00:46] [INFO ] Added : 517 causal constraints over 104 iterations in 9836 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 101 reset in 522 ms.
Product exploration explored 100000 steps with 103 reset in 616 ms.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 621 transition count 521
Applied a total of 1 rules in 18 ms. Remains 621 /623 variables (removed 2) and now considering 521/523 (removed 2) transitions.
// Phase 1: matrix 521 rows 621 cols
[2024-06-01 13:00:48] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 13:00:48] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 13:00:48] [INFO ] Invariant cache hit.
[2024-06-01 13:00:48] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-06-01 13:00:48] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 13:00:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 521/1142 variables, 621/844 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:01:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 845 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 521/1142 variables, 621/845 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1142 variables, 519/1364 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1364 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 621/623 places, 521/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60841 ms. Remains : 621/623 places, 521/523 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-14 finished in 210274 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)&&F(p1))))'
Support contains 4 out of 1227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1226 transition count 986
Reduce places removed 140 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 141 rules applied. Total rules applied 281 place count 1086 transition count 985
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 1085 transition count 985
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 282 place count 1085 transition count 884
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 484 place count 984 transition count 884
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 489 place count 979 transition count 879
Iterating global reduction 3 with 5 rules applied. Total rules applied 494 place count 979 transition count 879
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 494 place count 979 transition count 876
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 500 place count 976 transition count 876
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 0 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 1200 place count 626 transition count 526
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1202 place count 624 transition count 524
Applied a total of 1202 rules in 109 ms. Remains 624 /1227 variables (removed 603) and now considering 524/1127 (removed 603) transitions.
// Phase 1: matrix 524 rows 624 cols
[2024-06-01 13:01:48] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 13:01:49] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 13:01:49] [INFO ] Invariant cache hit.
[2024-06-01 13:01:49] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-06-01 13:01:49] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 13:01:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:01:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:01:57] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:01:57] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:01:57] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 21/226 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:02:13] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:02:13] [INFO ] Deduced a trap composed of 98 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:02:13] [INFO ] Deduced a trap composed of 113 places in 59 ms of which 5 ms to minimize.
[2024-06-01 13:02:13] [INFO ] Deduced a trap composed of 128 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:02:14] [INFO ] Deduced a trap composed of 148 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:02:14] [INFO ] Deduced a trap composed of 160 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:02:14] [INFO ] Deduced a trap composed of 175 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:02:14] [INFO ] Deduced a trap composed of 187 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:02:14] [INFO ] Deduced a trap composed of 203 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 215 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 234 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 247 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 265 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 246 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 22/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:02:24] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:24] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:24] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:24] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:29] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:02:30] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:02:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:02:30] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:02:30] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 14/245 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 71 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 2/624 variables, 21/273 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 159 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 156 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 159 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 157 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 158 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 157 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 157 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 156 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 60106ms, After SMT, problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 624/1227 places, 524/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60919 ms. Remains : 624/1227 places, 524/1127 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-15
Stuttering criterion allowed to conclude after 1338 steps with 3 reset in 10 ms.
FORMULA ShieldPPPs-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLFireability-15 finished in 61064 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))'
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(F(p0)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLFireability-02
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1226 transition count 985
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1085 transition count 985
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 282 place count 1085 transition count 885
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 482 place count 985 transition count 885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 980 transition count 880
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 980 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 492 place count 980 transition count 877
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 498 place count 977 transition count 877
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 1200 place count 626 transition count 526
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1202 place count 624 transition count 524
Applied a total of 1202 rules in 100 ms. Remains 624 /1227 variables (removed 603) and now considering 524/1127 (removed 603) transitions.
// Phase 1: matrix 524 rows 624 cols
[2024-06-01 13:02:50] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 13:02:50] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 13:02:50] [INFO ] Invariant cache hit.
[2024-06-01 13:02:51] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-01 13:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:59] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:02:59] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:03:12] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 87 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 115 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 132 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 158 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 175 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 191 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 203 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 218 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 234 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 251 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 260 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:03:17] [INFO ] Deduced a trap composed of 276 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:03:17] [INFO ] Deduced a trap composed of 300 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 244 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:32] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 69 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 145 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 146 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 145 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 218 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 216 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 218 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:43] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:03:43] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:43] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:03:43] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 92 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1148 variables, and 310 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 89/89 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LI_LTL mode, iteration 1 : 624/1227 places, 524/1127 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60934 ms. Remains : 624/1227 places, 524/1127 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-02
Product exploration explored 100000 steps with 17264 reset in 389 ms.
Product exploration explored 100000 steps with 17392 reset in 488 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 524/524 transitions.
Applied a total of 0 rules in 11 ms. Remains 624 /624 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-01 13:03:52] [INFO ] Invariant cache hit.
[2024-06-01 13:03:53] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 13:03:53] [INFO ] Invariant cache hit.
[2024-06-01 13:03:53] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-01 13:03:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:04:01] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:04:01] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:04:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:04:17] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:17] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:17] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:17] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:04:18] [INFO ] Deduced a trap composed of 115 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:18] [INFO ] Deduced a trap composed of 132 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:04:18] [INFO ] Deduced a trap composed of 144 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:04:18] [INFO ] Deduced a trap composed of 158 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:04:18] [INFO ] Deduced a trap composed of 175 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:04:19] [INFO ] Deduced a trap composed of 191 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:04:19] [INFO ] Deduced a trap composed of 203 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:04:19] [INFO ] Deduced a trap composed of 218 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:04:19] [INFO ] Deduced a trap composed of 234 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:04:19] [INFO ] Deduced a trap composed of 251 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:04:20] [INFO ] Deduced a trap composed of 260 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:04:20] [INFO ] Deduced a trap composed of 276 places in 111 ms of which 3 ms to minimize.
[2024-06-01 13:04:20] [INFO ] Deduced a trap composed of 300 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 244 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 145 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 146 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 146 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 145 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 218 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 216 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 218 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 83 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 81 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 81 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 92 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 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 624/1148 variables, and 310 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 89/89 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60858 ms. Remains : 624/624 places, 524/524 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17215 reset in 349 ms.
Product exploration explored 100000 steps with 17235 reset in 437 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 524/524 transitions.
Applied a total of 0 rules in 15 ms. Remains 624 /624 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-01 13:04:55] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 13:04:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:05:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:05:03] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:05:17] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 115 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:05:19] [INFO ] Deduced a trap composed of 132 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:05:20] [INFO ] Deduced a trap composed of 144 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:05:20] [INFO ] Deduced a trap composed of 158 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:05:20] [INFO ] Deduced a trap composed of 175 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:05:20] [INFO ] Deduced a trap composed of 191 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:05:20] [INFO ] Deduced a trap composed of 203 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 218 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 234 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 251 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 260 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:05:22] [INFO ] Deduced a trap composed of 276 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:05:22] [INFO ] Deduced a trap composed of 300 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 244 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 88 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:05:35] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 84 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 86 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:05:36] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 70 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 69 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:05:40] [INFO ] Deduced a trap composed of 145 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:05:41] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:05:41] [INFO ] Deduced a trap composed of 146 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:05:41] [INFO ] Deduced a trap composed of 145 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:05:41] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:05:41] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:05:42] [INFO ] Deduced a trap composed of 218 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:05:42] [INFO ] Deduced a trap composed of 216 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:05:42] [INFO ] Deduced a trap composed of 218 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 57 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:05:46] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:05:47] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:05:47] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:52] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:05:52] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:05:52] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:05:52] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 81 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 92 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 84 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:05:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:05:54] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:05:54] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:05:54] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1148 variables, and 310 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 89/89 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60130 ms. Remains : 624/624 places, 524/524 transitions.
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 524/524 transitions.
Applied a total of 0 rules in 7 ms. Remains 624 /624 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-01 13:05:55] [INFO ] Invariant cache hit.
[2024-06-01 13:05:56] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 13:05:56] [INFO ] Invariant cache hit.
[2024-06-01 13:05:56] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-01 13:05:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:06:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:06:20] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:06:20] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:06:20] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:06:20] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:06:20] [INFO ] Deduced a trap composed of 115 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:06:21] [INFO ] Deduced a trap composed of 132 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:06:21] [INFO ] Deduced a trap composed of 144 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:06:21] [INFO ] Deduced a trap composed of 158 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:06:21] [INFO ] Deduced a trap composed of 175 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:06:21] [INFO ] Deduced a trap composed of 191 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:06:22] [INFO ] Deduced a trap composed of 203 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:06:22] [INFO ] Deduced a trap composed of 218 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:06:22] [INFO ] Deduced a trap composed of 234 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:06:22] [INFO ] Deduced a trap composed of 251 places in 100 ms of which 3 ms to minimize.
[2024-06-01 13:06:23] [INFO ] Deduced a trap composed of 260 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:06:23] [INFO ] Deduced a trap composed of 276 places in 116 ms of which 3 ms to minimize.
[2024-06-01 13:06:23] [INFO ] Deduced a trap composed of 300 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1148 variables, and 244 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/624 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 88 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:36] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:06:37] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:41] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:06:41] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:06:41] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:06:41] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:06:41] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 145 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 146 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 146 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 145 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:06:42] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:06:43] [INFO ] Deduced a trap composed of 218 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:06:43] [INFO ] Deduced a trap composed of 216 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:06:43] [INFO ] Deduced a trap composed of 218 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:06:48] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 83 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 81 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:06:54] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 92 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:06:55] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1148 variables, and 310 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 89/89 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 624/624 places, 524/524 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-02 finished in 246783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLFireability-07
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1226 transition count 984
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1084 transition count 984
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1084 transition count 884
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 984 transition count 884
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 489 place count 979 transition count 879
Iterating global reduction 2 with 5 rules applied. Total rules applied 494 place count 979 transition count 879
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 979 transition count 876
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 500 place count 976 transition count 876
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 1202 place count 625 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1204 place count 623 transition count 523
Applied a total of 1204 rules in 94 ms. Remains 623 /1227 variables (removed 604) and now considering 523/1127 (removed 604) transitions.
// Phase 1: matrix 523 rows 623 cols
[2024-06-01 13:06:57] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 13:06:57] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 13:06:57] [INFO ] Invariant cache hit.
[2024-06-01 13:06:57] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-01 13:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:06] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:06] [INFO ] Deduced a trap composed of 52 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:07:06] [INFO ] Deduced a trap composed of 51 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:07:06] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:07:07] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:07:07] [INFO ] Deduced a trap composed of 95 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:07] [INFO ] Deduced a trap composed of 111 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:07] [INFO ] Deduced a trap composed of 127 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:07:07] [INFO ] Deduced a trap composed of 143 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:09] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:07:09] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:07:09] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:07:12] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (OVERLAPS) 1/623 variables, 100/235 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1146 variables, and 235 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 123 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 122 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 116 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 122 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 113 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 120 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:07:30] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:07:30] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:07:30] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:07:30] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:07:30] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 112 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 102 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 95 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 100 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 112 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 111 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 105 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 104 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 110 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 65 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 60 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:41] [INFO ] Deduced a trap composed of 111 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:07:41] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:41] [INFO ] Deduced a trap composed of 112 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:41] [INFO ] Deduced a trap composed of 106 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 106 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 109 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 109 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 106 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 108 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 109 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 109 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 107 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 108 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 105 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:07:42] [INFO ] Deduced a trap composed of 93 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 95 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 97 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 98 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 97 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 90 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 80 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 69 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:07:44] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:07:45] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:07:45] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:45] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:45] [INFO ] Deduced a trap composed of 88 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:45] [INFO ] Deduced a trap composed of 88 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:49] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 83 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:07:50] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 83 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 83 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 84 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 84 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 82 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:52] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 87 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:53] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:54] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:54] [INFO ] Deduced a trap composed of 78 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:54] [INFO ] Deduced a trap composed of 78 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:54] [INFO ] Deduced a trap composed of 77 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:54] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 77 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 77 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 78 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 76 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 75 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 73 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 74 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:07:55] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:07:57] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:07:57] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:07:57] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1146 variables, and 265 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 121/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 144/144 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LI_LTL mode, iteration 1 : 623/1227 places, 523/1127 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60929 ms. Remains : 623/1227 places, 523/1127 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-07
Product exploration explored 100000 steps with 22102 reset in 269 ms.
Product exploration explored 100000 steps with 22359 reset in 319 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/623 stabilizing places and 2/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 368 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (28 resets) in 461 ms. (86 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2024-06-01 13:07:59] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 2/1146 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 550 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:08:00] [INFO ] Invariant cache hit.
[2024-06-01 13:08:00] [INFO ] [Real]Absence check using 221 positive place invariants in 70 ms returned sat
[2024-06-01 13:08:01] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-06-01 13:08:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:08:01] [INFO ] [Nat]Absence check using 221 positive place invariants in 62 ms returned sat
[2024-06-01 13:08:02] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-06-01 13:08:02] [INFO ] Computed and/alt/rep : 520/1195/520 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 13:08:06] [INFO ] Added : 351 causal constraints over 71 iterations in 4492 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 623 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 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 13:08:06] [INFO ] Invariant cache hit.
[2024-06-01 13:08:07] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 13:08:07] [INFO ] Invariant cache hit.
[2024-06-01 13:08:07] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-06-01 13:08:07] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 13:08:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:16] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:16] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:16] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:08:16] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:08:16] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:08:17] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:08:17] [INFO ] Deduced a trap composed of 111 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:08:17] [INFO ] Deduced a trap composed of 127 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:08:17] [INFO ] Deduced a trap composed of 143 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:19] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:08:19] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:08:19] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:08:22] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 520 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 622/1146 variables, and 135 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 121/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 123 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 122 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 116 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 122 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 113 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 120 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:08:39] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:08:40] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:08:40] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:08:40] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:08:40] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:45] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:08:46] [INFO ] Deduced a trap composed of 111 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 104 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 105 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 104 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 110 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 65 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 60 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:08:50] [INFO ] Deduced a trap composed of 54 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:51] [INFO ] Deduced a trap composed of 111 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:08:51] [INFO ] Deduced a trap composed of 107 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 112 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 106 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 106 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 109 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 109 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 106 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 108 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 109 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 109 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 107 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 99 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 108 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 105 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 100 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 93 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:52] [INFO ] Deduced a trap composed of 93 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 95 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 97 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 98 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 90 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 80 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 69 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 82 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:08:54] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:08:55] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:08:55] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:08:55] [INFO ] Deduced a trap composed of 83 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:08:55] [INFO ] Deduced a trap composed of 88 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:08:55] [INFO ] Deduced a trap composed of 88 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 88 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 66 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:09:00] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 83 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 83 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 83 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:09:02] [INFO ] Deduced a trap composed of 82 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 81 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 82 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 84 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 78 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 78 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 77 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 75 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 73 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 74 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 73 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1146 variables, and 265 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 121/221 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 144/144 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60908 ms. Remains : 623/623 places, 523/523 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/623 stabilizing places and 2/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 221 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 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 199 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)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:09:08] [INFO ] Invariant cache hit.
[2024-06-01 13:09:08] [INFO ] [Real]Absence check using 221 positive place invariants in 78 ms returned sat
[2024-06-01 13:09:09] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2024-06-01 13:09:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:09:09] [INFO ] [Nat]Absence check using 221 positive place invariants in 60 ms returned sat
[2024-06-01 13:09:10] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-06-01 13:09:10] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-06-01 13:09:10] [INFO ] Computed and/alt/rep : 520/1195/520 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-01 13:09:15] [INFO ] Added : 351 causal constraints over 71 iterations in 4427 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22055 reset in 309 ms.
Product exploration explored 100000 steps with 22203 reset in 332 ms.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 622 transition count 522
Applied a total of 2 rules in 18 ms. Remains 622 /623 variables (removed 1) and now considering 522/523 (removed 1) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 13:09:15] [INFO ] Computed 221 invariants in 6 ms
[2024-06-01 13:09:16] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 13:09:16] [INFO ] Invariant cache hit.
[2024-06-01 13:09:16] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-06-01 13:09:16] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 13:09:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 64 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 111 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 127 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:09:26] [INFO ] Deduced a trap composed of 143 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 100/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:09:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:09:39] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:09:39] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:09:45] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:09:46] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 243 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 100/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 13/243 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:09:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:09:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:09:56] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:09:56] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 6/249 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 522/1144 variables, 622/871 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 519/1390 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1390 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 28/28 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/623 places, 522/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60968 ms. Remains : 622/623 places, 522/523 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-07 finished in 200082 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 U (p1||G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((p1 U (p2||G(p1)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLFireability-10
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1227/1227 places, 1127/1127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1226 transition count 984
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1084 transition count 984
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 284 place count 1084 transition count 885
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 482 place count 985 transition count 885
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 4 rules applied. Total rules applied 490 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 490 place count 981 transition count 878
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 496 place count 978 transition count 878
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1206 place count 623 transition count 523
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 621 transition count 521
Applied a total of 1208 rules in 91 ms. Remains 621 /1227 variables (removed 606) and now considering 521/1127 (removed 606) transitions.
// Phase 1: matrix 521 rows 621 cols
[2024-06-01 13:10:17] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 13:10:17] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 13:10:17] [INFO ] Invariant cache hit.
[2024-06-01 13:10:18] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2024-06-01 13:10:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:10:26] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 144 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 159 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 175 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:10:27] [INFO ] Deduced a trap composed of 190 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:10:28] [INFO ] Deduced a trap composed of 206 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:10:28] [INFO ] Deduced a trap composed of 219 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:10:28] [INFO ] Deduced a trap composed of 232 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:10:28] [INFO ] Deduced a trap composed of 252 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 267 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 277 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 293 places in 102 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:10:34] [INFO ] Deduced a trap composed of 128 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:10:34] [INFO ] Deduced a trap composed of 147 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:10:34] [INFO ] Deduced a trap composed of 141 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:35] [INFO ] Deduced a trap composed of 278 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:10:35] [INFO ] Deduced a trap composed of 281 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 9/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:36] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 146 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 143 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 142 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 145 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 145 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 143 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 144 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 142 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 142 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 144 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 143 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 141 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 142 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1142 variables, and 271 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 84 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 89 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 85 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:10:53] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 14/285 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:54] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:10:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 90 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:10:58] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 87 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 87 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 83 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 67 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 16/321 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 521/1142 variables, 621/944 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 519/1463 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1463 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 102/102 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LI_LTL mode, iteration 1 : 621/1227 places, 521/1127 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60916 ms. Remains : 621/1227 places, 521/1127 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLFireability-10
Product exploration explored 100000 steps with 4940 reset in 362 ms.
Product exploration explored 100000 steps with 4949 reset in 458 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 816 steps (0 resets) in 12 ms. (62 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-06-01 13:11:19] [INFO ] Invariant cache hit.
[2024-06-01 13:11:20] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 13:11:20] [INFO ] Invariant cache hit.
[2024-06-01 13:11:20] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2024-06-01 13:11:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:11:29] [INFO ] Deduced a trap composed of 144 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 159 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 175 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 190 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 206 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 219 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:11:31] [INFO ] Deduced a trap composed of 232 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:11:31] [INFO ] Deduced a trap composed of 252 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:11:31] [INFO ] Deduced a trap composed of 267 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:11:31] [INFO ] Deduced a trap composed of 277 places in 97 ms of which 3 ms to minimize.
[2024-06-01 13:11:32] [INFO ] Deduced a trap composed of 293 places in 107 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 101 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 128 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:36] [INFO ] Deduced a trap composed of 147 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:11:37] [INFO ] Deduced a trap composed of 141 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:11:38] [INFO ] Deduced a trap composed of 278 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:11:38] [INFO ] Deduced a trap composed of 281 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 9/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 109 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 146 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 142 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 143 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 145 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 145 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 143 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 144 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 142 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 142 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:11:43] [INFO ] Deduced a trap composed of 143 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 144 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 143 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 143 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 143 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 141 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 142 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:49] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1142 variables, and 271 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 84 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 85 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 84 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:11:55] [INFO ] Deduced a trap composed of 84 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 14/285 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 85 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 83 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 68 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 67 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:02] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:12:02] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 67 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 16/321 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 521/1142 variables, 621/944 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 519/1463 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1463 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 102/102 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 621/621 places, 521/521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1103 steps (0 resets) in 15 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4933 reset in 372 ms.
Product exploration explored 100000 steps with 4851 reset in 453 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 14 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-06-01 13:12:22] [INFO ] Redundant transitions in 5 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 13:12:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 175 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 190 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 206 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 219 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 232 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:12:33] [INFO ] Deduced a trap composed of 252 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:12:33] [INFO ] Deduced a trap composed of 267 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:12:33] [INFO ] Deduced a trap composed of 277 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:12:33] [INFO ] Deduced a trap composed of 293 places in 107 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:37] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 128 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 147 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:12:38] [INFO ] Deduced a trap composed of 141 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:12:39] [INFO ] Deduced a trap composed of 278 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:12:40] [INFO ] Deduced a trap composed of 281 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 9/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:40] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:12:44] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:12:44] [INFO ] Deduced a trap composed of 146 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:12:44] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:12:44] [INFO ] Deduced a trap composed of 142 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:12:44] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 145 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 145 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 143 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 144 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 142 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 142 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 143 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 144 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 143 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 143 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 143 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 141 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:12:45] [INFO ] Deduced a trap composed of 142 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:50] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1142 variables, and 271 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:56] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 89 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 87 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:12:57] [INFO ] Deduced a trap composed of 84 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 14/285 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:12:59] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:12:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 90 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 83 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 67 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:13:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:04] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:13:04] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 16/321 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:14] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:13:14] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 521/1142 variables, 621/944 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 519/1463 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1463 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 102/102 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60107 ms. Remains : 621/621 places, 521/521 transitions.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-06-01 13:13:22] [INFO ] Invariant cache hit.
[2024-06-01 13:13:22] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 13:13:22] [INFO ] Invariant cache hit.
[2024-06-01 13:13:23] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2024-06-01 13:13:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 144 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 159 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 175 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 190 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:13:33] [INFO ] Deduced a trap composed of 206 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:13:33] [INFO ] Deduced a trap composed of 219 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:13:33] [INFO ] Deduced a trap composed of 232 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:13:33] [INFO ] Deduced a trap composed of 252 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:13:34] [INFO ] Deduced a trap composed of 267 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:13:34] [INFO ] Deduced a trap composed of 277 places in 100 ms of which 3 ms to minimize.
[2024-06-01 13:13:34] [INFO ] Deduced a trap composed of 293 places in 104 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:38] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:13:38] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:13:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:13:38] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:13:39] [INFO ] Deduced a trap composed of 128 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:39] [INFO ] Deduced a trap composed of 147 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:13:39] [INFO ] Deduced a trap composed of 141 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:13:40] [INFO ] Deduced a trap composed of 278 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:13:40] [INFO ] Deduced a trap composed of 281 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 9/250 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 109 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 146 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 143 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 142 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 143 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 145 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 145 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 143 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 144 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 142 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 142 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 143 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 143 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 143 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 141 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 142 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:51] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1142 variables, and 271 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 84 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 86 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:13:58] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:13:58] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 14/285 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:14:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 90 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 87 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 87 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 86 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 83 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 67 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 16/321 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 521/1142 variables, 621/944 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 519/1463 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1463 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 102/102 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 621/621 places, 521/521 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLFireability-10 finished in 246304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
[2024-06-01 13:14:23] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:14:23] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 13:14:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1227 places, 1127 transitions and 3214 arcs took 11 ms.
Total runtime 2358276 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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 r528-tall-171683761100460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B 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 ;