About the Execution of GreatSPN+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 |
| 12142.628 | 3600000.00 | 8551492.00 | 5457.40 | FFTT?FFFF?T???T? | 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.r355-tall-171683758800459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758800459
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716974341035
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 09:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 09:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:19:02] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-29 09:19:02] [INFO ] Transformed 1363 places.
[2024-05-29 09:19:02] [INFO ] Transformed 1263 transitions.
[2024-05-29 09:19:02] [INFO ] Found NUPN structural information;
[2024-05-29 09:19:02] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1229 transition count 1129
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1229 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1228 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1228 transition count 1128
Applied a total of 270 rules in 610 ms. Remains 1228 /1363 variables (removed 135) and now considering 1128/1263 (removed 135) transitions.
// Phase 1: matrix 1128 rows 1228 cols
[2024-05-29 09:19:03] [INFO ] Computed 221 invariants in 31 ms
[2024-05-29 09:19:04] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-29 09:19:04] [INFO ] Invariant cache hit.
[2024-05-29 09:19:05] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-05-29 09:19:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
SMT process timed out in 30335ms, After SMT, problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 30387ms
Starting structural reductions in LTL mode, iteration 1 : 1228/1363 places, 1128/1263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32726 ms. Remains : 1228/1363 places, 1128/1263 transitions.
Support contains 45 out of 1228 places after structural reductions.
[2024-05-29 09:19:35] [INFO ] Flatten gal took : 107 ms
[2024-05-29 09:19:35] [INFO ] Flatten gal took : 62 ms
[2024-05-29 09:19:36] [INFO ] Input system was already deterministic with 1128 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (12 resets) in 1700 ms. (23 steps per ms) remains 0/24 properties
Computed a total of 242 stabilizing places and 242 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&(G(p0)||F(p1)))))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1223 transition count 1123
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1223 transition count 1123
Applied a total of 10 rules in 61 ms. Remains 1223 /1228 variables (removed 5) and now considering 1123/1128 (removed 5) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-05-29 09:19:37] [INFO ] Computed 221 invariants in 15 ms
[2024-05-29 09:19:37] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-29 09:19:37] [INFO ] Invariant cache hit.
[2024-05-29 09:19:38] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-29 09:19:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)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 30233ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30244ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1228 places, 1123/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31826 ms. Remains : 1223/1228 places, 1123/1128 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-00 finished in 32261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||G(p0)))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1223 transition count 1123
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1223 transition count 1123
Applied a total of 10 rules in 57 ms. Remains 1223 /1228 variables (removed 5) and now considering 1123/1128 (removed 5) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-05-29 09:20:09] [INFO ] Computed 221 invariants in 12 ms
[2024-05-29 09:20:09] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 09:20:09] [INFO ] Invariant cache hit.
[2024-05-29 09:20:10] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-29 09:20:10] [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 30194ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1228 places, 1123/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31608 ms. Remains : 1223/1228 places, 1123/1128 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 784 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-01 finished in 31825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(p1) U (G((X(p1)||G(!p2)))||(!p0&&(X(p1)||G(!p2))))))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 59 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-05-29 09:20:41] [INFO ] Computed 221 invariants in 15 ms
[2024-05-29 09:20:41] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-29 09:20:41] [INFO ] Invariant cache hit.
[2024-05-29 09:20:42] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-05-29 09:20:42] [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/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30217ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31625 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND p2 (NOT p1)), p2]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 400 ms.
Product exploration explored 100000 steps with 33333 reset in 278 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 p1 (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-020B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-03 finished in 32609 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((F(p0)&&F(G(!p1))))||G((p2 U p3)))))'
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 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 282 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 482 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 981 transition count 881
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 981 transition count 879
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 496 place count 979 transition count 879
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 1 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 1198 place count 628 transition count 528
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 1200 place count 626 transition count 526
Applied a total of 1200 rules in 210 ms. Remains 626 /1228 variables (removed 602) and now considering 526/1128 (removed 602) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:21:13] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 09:21:14] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 09:21:14] [INFO ] Invariant cache hit.
[2024-05-29 09:21:14] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-05-29 09:21:14] [INFO ] Redundant transitions in 27 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:21:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-05-29 09:21:23] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 2 ms to minimize.
[2024-05-29 09:21:24] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:21:24] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:21:24] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:21:24] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:21:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:21:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:21:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:21:41] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:21:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:21:44] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:21:49] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:21:50] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:21:50] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:21:55] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1228 places, 526/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61103 ms. Remains : 626/1228 places, 526/1128 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-04
Product exploration explored 100000 steps with 157 reset in 650 ms.
Product exploration explored 100000 steps with 138 reset in 735 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR (AND p3 p1) (AND p1 p2))), (X (NOT (OR (AND p3 p1) (AND p1 p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR (AND p3 p1) (AND p1 p2)))), (X (X (NOT (OR (AND p3 p1) (AND p1 p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2)))))]
Knowledge based reduction with 18 factoid took 908 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 507 ms. (78 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
[2024-05-29 09:22:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 91/189 variables, 37/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/205 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 8/213 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 135/348 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 16/364 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/380 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 160/540 variables, 79/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/540 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/560 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/560 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/560 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 12/572 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/572 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/572 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 174/746 variables, 90/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/746 variables, 15/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/746 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 16/762 variables, 17/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/762 variables, 16/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/762 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 8/770 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/770 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 135/905 variables, 72/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/905 variables, 17/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/905 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 15/920 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/920 variables, 15/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/920 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/922 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 87/1009 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1009 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1009 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/1018 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1018 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1018 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/1024 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1024 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1024 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 68/1092 variables, 34/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1092 variables, 10/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1092 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1098 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1098 variables, 6/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:19] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 52/98 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 91/189 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/205 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/213 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 135/348 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/364 variables, 14/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 16/380 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/380 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/380 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 160/540 variables, 79/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/540 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/540 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/540 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 20/560 variables, 16/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/560 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/560 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 12/572 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/572 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/572 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 174/746 variables, 90/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 15/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/746 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 16/762 variables, 17/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/762 variables, 16/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/762 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 8/770 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/770 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 135/905 variables, 72/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/905 variables, 17/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/905 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 15/920 variables, 14/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/920 variables, 15/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/920 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 2/922 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/922 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 87/1009 variables, 46/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1009 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1009 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 9/1018 variables, 11/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1018 variables, 9/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1018 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 6/1024 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1024 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1024 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 68/1092 variables, 34/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1092 variables, 10/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:22:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:22:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 4 ms to minimize.
[2024-05-29 09:22:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1092 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1092 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 6/1098 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1098 variables, 6/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1098 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 41/1139 variables, 24/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1139 variables, 4/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:22:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1139 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1139 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 4/1143 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1143 variables, 4/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1143 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 2/1145 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1145 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1145 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 7/1152 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1152 variables, 3/860 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/1152 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1152 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:22:22] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:22:22] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:22:22] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 84 (OVERLAPS) 0/1152 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 865 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3195 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4548ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2996 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 626 transition count 526
Applied a total of 118 rules in 48 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 626/626 places, 526/526 transitions.
RANDOM walk for 40000 steps (9 resets) in 615 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 146191 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 146191 steps, saw 141378 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:22:29] [INFO ] Computed 221 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/209 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/217 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/360 variables, 68/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/372 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 16/388 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/388 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 166/554 variables, 87/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/554 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 12/566 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/566 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/566 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 12/578 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/578 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 180/758 variables, 94/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/758 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 12/770 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/770 variables, 12/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 8/778 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/778 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/778 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 135/913 variables, 78/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/913 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/913 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 9/922 variables, 11/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/922 variables, 9/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/924 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/924 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 89/1013 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1013 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1013 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 9/1022 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1022 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1022 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 6/1028 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1028 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1028 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 68/1096 variables, 38/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1096 variables, 12/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1096 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/1098 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1098 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 10/209 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/217 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 143/360 variables, 68/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/372 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 12/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:30] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:30] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 16/388 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/388 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/388 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 166/554 variables, 87/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/554 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/566 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/566 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/566 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/566 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 12/578 variables, 6/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/578 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/578 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 180/758 variables, 94/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/758 variables, 17/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/758 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 12/770 variables, 15/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 12/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/770 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 8/778 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/778 variables, 8/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/778 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 135/913 variables, 78/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/913 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/913 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/922 variables, 11/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 9/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/922 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 2/924 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/924 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 89/1013 variables, 46/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1013 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 9/1022 variables, 11/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1022 variables, 9/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1022 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 6/1028 variables, 3/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1028 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1028 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 68/1096 variables, 38/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1096 variables, 12/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/1096 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1096 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1098 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1098 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1098 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 41/1139 variables, 24/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1139 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:32] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1139 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:32] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1139 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:22:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:22:33] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1139 variables, 9/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1139 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 4/1143 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1143 variables, 4/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1143 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 2/1145 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1145 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1145 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 7/1152 variables, 6/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1152 variables, 3/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1152 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 0/1152 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 868 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3583 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 4999ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1508 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 21 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 626/626 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 28 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-29 09:22:35] [INFO ] Invariant cache hit.
[2024-05-29 09:22:36] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-29 09:22:36] [INFO ] Invariant cache hit.
[2024-05-29 09:22:36] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-29 09:22:36] [INFO ] Redundant transitions in 11 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:22:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:22:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:22:43] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:22:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:22:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 09:22:44] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:22:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:22:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:22:44] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:22:45] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:22:45] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:22:45] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:22:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:22:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:22:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:22:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:22:46] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-29 09:22:47] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 18/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:22:52] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:02] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 522 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)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1152 variables, and 232 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 211/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:09] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:15] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:23:16] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:21] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:23:21] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:23:22] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:26] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 2/626 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:23:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:23:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1152 variables, and 251 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 30/30 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61026 ms. Remains : 626/626 places, 526/526 transitions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR (AND p3 p1) (AND p1 p2))), (X (NOT (OR (AND p3 p1) (AND p1 p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR (AND p3 p1) (AND p1 p2)))), (X (X (NOT (OR (AND p3 p1) (AND p1 p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p3) p1)))), (F p2), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (OR (AND p2 p1) (AND p3 p1)))), (F (NOT (OR p0 p2 p3))), (F p0)]
Knowledge based reduction with 18 factoid took 1365 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 37 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:23:38] [INFO ] Computed 221 invariants in 1 ms
[2024-05-29 09:23:39] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-29 09:23:39] [INFO ] Invariant cache hit.
[2024-05-29 09:23:39] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-05-29 09:23:39] [INFO ] Redundant transitions in 30 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:23:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:23:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 09:23:47] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:23:48] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:23:49] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:23:49] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:23:49] [INFO ] Deduced a trap composed of 129 places in 96 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:24:03] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 09:24:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:24:03] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-05-29 09:24:06] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 09:24:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:24:09] [INFO ] Deduced a trap composed of 8 places in 25 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 Real declared 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:24:14] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:24:15] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:24:15] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:24:15] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:24:15] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:24:20] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61356 ms. Remains : 626/626 places, 526/526 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (X (NOT p0)), (X p1), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 (NOT p3) p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (OR (AND p2 p1) (AND p3 p1))), (X (NOT (OR (AND p2 p1) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p2 p1) (AND p3 p1)))), (X (X (NOT (OR (AND p2 p1) (AND p3 p1)))))]
Knowledge based reduction with 18 factoid took 881 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 501 ms. (79 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
[2024-05-29 09:24:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 91/189 variables, 37/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/205 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 8/213 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 135/348 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 16/364 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/380 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 160/540 variables, 79/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/540 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/560 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/560 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/560 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 12/572 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/572 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/572 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 174/746 variables, 90/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/746 variables, 15/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/746 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 16/762 variables, 17/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/762 variables, 16/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/762 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 8/770 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/770 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 135/905 variables, 72/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/905 variables, 17/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/905 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 15/920 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/920 variables, 15/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/920 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/922 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 87/1009 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1009 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1009 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/1018 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1018 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1018 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/1024 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1024 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1024 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 68/1092 variables, 34/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1092 variables, 10/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1092 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1098 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1098 variables, 6/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:42] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 52/98 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 91/189 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/205 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/213 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 135/348 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/364 variables, 14/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 16/380 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/380 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/380 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 160/540 variables, 79/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/540 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 20/560 variables, 16/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/560 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/560 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/572 variables, 6/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/572 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/572 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 174/746 variables, 90/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/746 variables, 15/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 16/762 variables, 17/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/762 variables, 16/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/762 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 8/770 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/770 variables, 8/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 135/905 variables, 72/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/905 variables, 17/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:43] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/905 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/905 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/905 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 15/920 variables, 14/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/920 variables, 15/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/920 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 2/922 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 87/1009 variables, 46/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1009 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1009 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 9/1018 variables, 11/733 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1018 variables, 9/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:24:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1018 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1018 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1024 variables, 3/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1024 variables, 6/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:44] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1024 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1024 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 68/1092 variables, 34/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1092 variables, 10/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:44] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1092 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1092 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 6/1098 variables, 4/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1098 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1098 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 41/1139 variables, 24/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1139 variables, 4/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1139 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 4/1143 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1143 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:45] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1143 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1143 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1143 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1143 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 2/1145 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1145 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1145 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 7/1152 variables, 6/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1152 variables, 3/862 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:24:45] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:24:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1152 variables, 3/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 865 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4930ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2092 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 626 transition count 526
Applied a total of 118 rules in 38 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 626/626 places, 526/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 1063 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 91618 steps, run timeout after 3003 ms. (steps per millisecond=30 ) properties seen :0 out of 4
Probabilistic random walk after 91618 steps, saw 88784 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:24:52] [INFO ] Computed 221 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/209 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/217 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/360 variables, 68/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/372 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 16/388 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/388 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 166/554 variables, 87/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/554 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 12/566 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/566 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/566 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 12/578 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/578 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 180/758 variables, 94/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/758 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 12/770 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/770 variables, 12/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 8/778 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/778 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/778 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 135/913 variables, 78/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/913 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/913 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 9/922 variables, 11/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/922 variables, 9/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/924 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/924 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 89/1013 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1013 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1013 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 9/1022 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1022 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1022 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 6/1028 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1028 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1028 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 68/1096 variables, 38/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1096 variables, 12/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1096 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/1098 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1098 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 10/209 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/217 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 143/360 variables, 68/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 11/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/372 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:54] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:54] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 16/388 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/388 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/388 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 166/554 variables, 87/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/554 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/566 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/566 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/566 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 12/578 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/578 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/578 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 180/758 variables, 94/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/758 variables, 17/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/758 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 12/770 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/770 variables, 12/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 8/778 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/778 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/778 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 135/913 variables, 78/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/913 variables, 20/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/913 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 9/922 variables, 11/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/922 variables, 9/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/924 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/924 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 89/1013 variables, 46/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 9/1022 variables, 11/733 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1022 variables, 9/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1022 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 6/1028 variables, 3/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1028 variables, 6/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1028 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 68/1096 variables, 38/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1096 variables, 12/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1096 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 2/1098 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1098 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1098 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 41/1139 variables, 24/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1139 variables, 4/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1139 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 4/1143 variables, 6/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1143 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1143 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 2/1145 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1145 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1145 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 7/1152 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1152 variables, 3/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:24:56] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 83 (INCLUDED_ONLY) 0/1152 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1152 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 0/1152 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 856 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 4351ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1404 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 22 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 626/626 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 12 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-29 09:24:57] [INFO ] Invariant cache hit.
[2024-05-29 09:24:58] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-29 09:24:58] [INFO ] Invariant cache hit.
[2024-05-29 09:24:58] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2024-05-29 09:24:58] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:25:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:25:05] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:25:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 3 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:25:06] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:25:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:25:07] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:25:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:25:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2024-05-29 09:25:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-29 09:25:08] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-05-29 09:25:08] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:25:09] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 18/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:14] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:23] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:28] [INFO ] Deduced a trap composed of 34 places in 75 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 Real declared 624/1152 variables, and 233 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 211/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 21/233 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:32] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:37] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-29 09:25:37] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:43] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:25:44] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (OVERLAPS) 2/626 variables, 9/247 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:25:52] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:25:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:25:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:25:54] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:25:55] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 09:25:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:25:55] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 09:25:55] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:25:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:25:57] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1152 variables, and 257 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 36/36 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61058 ms. Remains : 626/626 places, 526/526 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (X (NOT p0)), (X p1), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 (NOT p3) p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (OR (AND p2 p1) (AND p3 p1))), (X (NOT (OR (AND p2 p1) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p2 p1) (AND p3 p1)))), (X (X (NOT (OR (AND p2 p1) (AND p3 p1))))), (F (NOT (OR (AND p2 (NOT p0)) (AND p3 (NOT p0))))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p1)), (F (NOT (OR (AND p1 p2) (AND p1 p3)))), (F p2), (F (NOT (AND (OR p1 (NOT p2)) (OR p1 (NOT p3))))), (F (NOT p3)), (F p0), (F (NOT (OR p2 p3 p0)))]
Knowledge based reduction with 18 factoid took 1443 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 127 reset in 666 ms.
Product exploration explored 100000 steps with 149 reset in 742 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 14 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:26:02] [INFO ] Computed 221 invariants in 5 ms
[2024-05-29 09:26:02] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 09:26:02] [INFO ] Invariant cache hit.
[2024-05-29 09:26:03] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2024-05-29 09:26:03] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:26:11] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:26:12] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:26:12] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:26:12] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:26:12] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:26:12] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:26:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:26:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:26:26] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:26:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:26:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:26:32] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:26:37] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:26:37] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:26:37] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 2 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:26:38] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:26:43] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60942 ms. Remains : 626/626 places, 526/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-04 finished in 349921 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)))&&F((X(p2)&&p1))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 58 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-05-29 09:27:03] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 09:27:04] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-29 09:27:04] [INFO ] Invariant cache hit.
[2024-05-29 09:27:04] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-05-29 09:27:05] [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/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31568 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-05 finished in 31779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1086 transition count 986
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 282 place count 1086 transition count 887
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 480 place count 987 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 492 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 492 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 498 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 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1206 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 1208 place count 622 transition count 522
Applied a total of 1208 rules in 130 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-05-29 09:27:35] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 09:27:35] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-29 09:27:35] [INFO ] Invariant cache hit.
[2024-05-29 09:27:36] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-05-29 09:27:36] [INFO ] Redundant transitions in 4 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-29 09:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:27:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:27:44] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:27:44] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-05-29 09:27:44] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:27:44] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 2/622 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:27:59] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:28:00] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 1 ms to minimize.
[2024-05-29 09:28:00] [INFO ] Deduced a trap composed of 115 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:28:00] [INFO ] Deduced a trap composed of 133 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:28:00] [INFO ] Deduced a trap composed of 146 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:28:00] [INFO ] Deduced a trap composed of 161 places in 96 ms of which 1 ms to minimize.
[2024-05-29 09:28:01] [INFO ] Deduced a trap composed of 176 places in 95 ms of which 1 ms to minimize.
[2024-05-29 09:28:01] [INFO ] Deduced a trap composed of 191 places in 105 ms of which 2 ms to minimize.
[2024-05-29 09:28:01] [INFO ] Deduced a trap composed of 203 places in 116 ms of which 2 ms to minimize.
[2024-05-29 09:28:01] [INFO ] Deduced a trap composed of 217 places in 108 ms of which 2 ms to minimize.
[2024-05-29 09:28:02] [INFO ] Deduced a trap composed of 237 places in 98 ms of which 1 ms to minimize.
[2024-05-29 09:28:02] [INFO ] Deduced a trap composed of 247 places in 103 ms of which 2 ms to minimize.
[2024-05-29 09:28:02] [INFO ] Deduced a trap composed of 267 places in 116 ms of which 2 ms to minimize.
[2024-05-29 09:28:03] [INFO ] Deduced a trap composed of 282 places in 119 ms of which 2 ms to minimize.
[2024-05-29 09:28:03] [INFO ] Deduced a trap composed of 291 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 15/241 constraints. Problems are: Problem set: 0 solved, 518 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, 518 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 2/622 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 15/241 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 102 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 104 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:28:16] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:28:17] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:28:18] [INFO ] Deduced a trap composed of 160 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 3 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 3 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:28:22] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 3 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:28:23] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 5 ms to minimize.
[2024-05-29 09:28:24] [INFO ] Deduced a trap composed of 146 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:28:24] [INFO ] Deduced a trap composed of 146 places in 94 ms of which 1 ms to minimize.
[2024-05-29 09:28:24] [INFO ] Deduced a trap composed of 142 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:28:24] [INFO ] Deduced a trap composed of 141 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:28] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:28:29] [INFO ] Deduced a trap composed of 160 places in 108 ms of which 1 ms to minimize.
[2024-05-29 09:28:29] [INFO ] Deduced a trap composed of 216 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:34] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 132 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 132 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 132 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 129 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 130 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 131 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 130 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:28:35] [INFO ] Deduced a trap composed of 132 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 129 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 132 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 128 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 132 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 128 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 133 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:28:36] [INFO ] Deduced a trap composed of 133 places in 49 ms of which 1 ms to minimize.
SMT process timed out in 60129ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61101 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-06
Stuttering criterion allowed to conclude after 12481 steps with 8 reset in 87 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-06 finished in 61239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 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 284 place count 1085 transition count 985
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 284 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 3 with 200 rules applied. Total rules applied 484 place count 985 transition count 885
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 490 place count 979 transition count 879
Iterating global reduction 3 with 6 rules applied. Total rules applied 496 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 496 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 502 place count 976 transition count 876
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 3 with 708 rules applied. Total rules applied 1210 place count 622 transition count 522
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 1212 place count 620 transition count 520
Applied a total of 1212 rules in 181 ms. Remains 620 /1228 variables (removed 608) and now considering 520/1128 (removed 608) transitions.
// Phase 1: matrix 520 rows 620 cols
[2024-05-29 09:28:36] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 09:28:37] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-29 09:28:37] [INFO ] Invariant cache hit.
[2024-05-29 09:28:38] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-05-29 09:28:38] [INFO ] Redundant transitions in 3 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-29 09:28:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:28:46] [INFO ] Deduced a trap composed of 85 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:28:47] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:28:47] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:28:47] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:28:47] [INFO ] Deduced a trap composed of 144 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:28:47] [INFO ] Deduced a trap composed of 159 places in 87 ms of which 1 ms to minimize.
[2024-05-29 09:28:48] [INFO ] Deduced a trap composed of 175 places in 90 ms of which 1 ms to minimize.
[2024-05-29 09:28:48] [INFO ] Deduced a trap composed of 190 places in 87 ms of which 1 ms to minimize.
[2024-05-29 09:28:48] [INFO ] Deduced a trap composed of 206 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:28:48] [INFO ] Deduced a trap composed of 219 places in 97 ms of which 2 ms to minimize.
[2024-05-29 09:28:49] [INFO ] Deduced a trap composed of 232 places in 110 ms of which 2 ms to minimize.
[2024-05-29 09:28:49] [INFO ] Deduced a trap composed of 252 places in 107 ms of which 2 ms to minimize.
[2024-05-29 09:28:49] [INFO ] Deduced a trap composed of 267 places in 128 ms of which 2 ms to minimize.
[2024-05-29 09:28:49] [INFO ] Deduced a trap composed of 277 places in 127 ms of which 2 ms to minimize.
[2024-05-29 09:28:50] [INFO ] Deduced a trap composed of 289 places in 117 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:28:54] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:28:54] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:28:54] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:28:54] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:28:54] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 147 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 141 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 142 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:28:55] [INFO ] Deduced a trap composed of 143 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:28:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:28:56] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 260 places in 107 ms of which 3 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 260 places in 110 ms of which 2 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 260 places in 104 ms of which 2 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 264 places in 105 ms of which 2 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 265 places in 113 ms of which 2 ms to minimize.
[2024-05-29 09:28:57] [INFO ] Deduced a trap composed of 263 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:29:02] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:29:02] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-05-29 09:29:02] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:29:02] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 144 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 144 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 148 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 144 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 144 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:29:03] [INFO ] Deduced a trap composed of 146 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:29:04] [INFO ] Deduced a trap composed of 143 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:29:04] [INFO ] Deduced a trap composed of 144 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:29:04] [INFO ] Deduced a trap composed of 146 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:29:04] [INFO ] Deduced a trap composed of 144 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:29:04] [INFO ] Deduced a trap composed of 142 places in 81 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1140 variables, and 281 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 60/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 11 ms to minimize.
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:29:12] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:29:13] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:29:13] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:29:14] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:29:14] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 1 ms to minimize.
[2024-05-29 09:29:14] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-29 09:29:14] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 1 ms to minimize.
[2024-05-29 09:29:14] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 177 places in 119 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 170 places in 108 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 161 places in 109 ms of which 2 ms to minimize.
[2024-05-29 09:29:15] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 2 ms to minimize.
[2024-05-29 09:29:16] [INFO ] Deduced a trap composed of 171 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-29 09:29:20] [INFO ] Deduced a trap composed of 130 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:29:20] [INFO ] Deduced a trap composed of 130 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:29:20] [INFO ] Deduced a trap composed of 132 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:29:20] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:29:20] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 129 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 130 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 128 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 128 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 125 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 128 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 126 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 126 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:29:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 18/319 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 520/1140 variables, 620/939 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 518/1457 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 1457 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 98/98 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/1228 places, 520/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61674 ms. Remains : 620/1228 places, 520/1128 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-07
Stuttering criterion allowed to conclude after 4950 steps with 4 reset in 34 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-07 finished in 61786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||F(p1)))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 52 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-05-29 09:29:38] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 09:29:38] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-29 09:29:38] [INFO ] Invariant cache hit.
[2024-05-29 09:29:39] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-05-29 09:29:39] [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 30165ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31512 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-08
Stuttering criterion allowed to conclude after 35711 steps with 25 reset in 196 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-08 finished in 31846 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)))'
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 78 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
[2024-05-29 09:30:10] [INFO ] Invariant cache hit.
[2024-05-29 09:30:10] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-29 09:30:10] [INFO ] Invariant cache hit.
[2024-05-29 09:30:11] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-05-29 09:30:11] [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 30179ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31704 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-09
Product exploration explored 100000 steps with 1243 reset in 311 ms.
Product exploration explored 100000 steps with 1213 reset in 303 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 348 steps (0 resets) in 5 ms. (58 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 162 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 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:30:43] [INFO ] Invariant cache hit.
[2024-05-29 09:30:43] [INFO ] [Real]Absence check using 221 positive place invariants in 160 ms returned sat
[2024-05-29 09:30:48] [INFO ] [Real]Absence check using state equation in 4196 ms returned sat
[2024-05-29 09:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:30:48] [INFO ] [Nat]Absence check using 221 positive place invariants in 167 ms returned sat
[2024-05-29 09:30:52] [INFO ] [Nat]Absence check using state equation in 4050 ms returned sat
[2024-05-29 09:30:53] [INFO ] Computed and/alt/rep : 1121/1982/1121 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-29 09:31:03] [INFO ] Added : 310 causal constraints over 62 iterations in 10236 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 1222 places. Attempting structural reductions.
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 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1221 transition count 982
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 1082 transition count 982
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 278 place count 1082 transition count 881
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 480 place count 981 transition count 881
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 1184 place count 629 transition count 529
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 1186 place count 627 transition count 527
Applied a total of 1186 rules in 126 ms. Remains 627 /1222 variables (removed 595) and now considering 527/1122 (removed 595) transitions.
// Phase 1: matrix 527 rows 627 cols
[2024-05-29 09:31:03] [INFO ] Computed 221 invariants in 1 ms
[2024-05-29 09:31:03] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-29 09:31:03] [INFO ] Invariant cache hit.
[2024-05-29 09:31:04] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2024-05-29 09:31:04] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:31:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:31:12] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 09:31:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:31:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:31:13] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:31:14] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:31:14] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:31:14] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 09:31:26] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-29 09:31:28] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:31:28] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:31:28] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:31:28] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
[2024-05-29 09:31:29] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:31:29] [INFO ] Deduced a trap composed of 114 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:31:29] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 1 ms to minimize.
[2024-05-29 09:31:29] [INFO ] Deduced a trap composed of 147 places in 89 ms of which 1 ms to minimize.
[2024-05-29 09:31:29] [INFO ] Deduced a trap composed of 160 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:31:30] [INFO ] Deduced a trap composed of 177 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:31:30] [INFO ] Deduced a trap composed of 191 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:31:30] [INFO ] Deduced a trap composed of 203 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:31:30] [INFO ] Deduced a trap composed of 220 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:31:44] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:31:45] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:31:45] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:31:45] [INFO ] Deduced a trap composed of 126 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:31:45] [INFO ] Deduced a trap composed of 140 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:31:46] [INFO ] Deduced a trap composed of 170 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:31:46] [INFO ] Deduced a trap composed of 187 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 18/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:31:51] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 114 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 132 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:31:52] [INFO ] Deduced a trap composed of 143 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:31:53] [INFO ] Deduced a trap composed of 178 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:31:53] [INFO ] Deduced a trap composed of 177 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:31:57] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:32:03] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:32:04] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 294 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 73/73 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 627/1222 places, 527/1122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61184 ms. Remains : 627/1222 places, 527/1122 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 217 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:32:05] [INFO ] Invariant cache hit.
[2024-05-29 09:32:05] [INFO ] [Real]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-05-29 09:32:06] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-29 09:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:32:06] [INFO ] [Nat]Absence check using 221 positive place invariants in 74 ms returned sat
[2024-05-29 09:32:07] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2024-05-29 09:32:07] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-29 09:32:12] [INFO ] Added : 431 causal constraints over 87 iterations in 5379 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25595 reset in 428 ms.
Product exploration explored 100000 steps with 25631 reset in 501 ms.
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 11 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-29 09:32:13] [INFO ] Invariant cache hit.
[2024-05-29 09:32:14] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 09:32:14] [INFO ] Invariant cache hit.
[2024-05-29 09:32:14] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-05-29 09:32:14] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:32:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 09:32:22] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-29 09:32:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:32:24] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-29 09:32:24] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:32:24] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:32:24] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:32:37] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 09:32:38] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 91 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 114 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:32:39] [INFO ] Deduced a trap composed of 134 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:32:40] [INFO ] Deduced a trap composed of 147 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:32:40] [INFO ] Deduced a trap composed of 160 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:32:40] [INFO ] Deduced a trap composed of 177 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:32:40] [INFO ] Deduced a trap composed of 191 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:32:40] [INFO ] Deduced a trap composed of 203 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:32:41] [INFO ] Deduced a trap composed of 220 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 0 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:32:54] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:32:55] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:32:55] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2024-05-29 09:32:55] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:32:55] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:32:55] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:32:56] [INFO ] Deduced a trap composed of 126 places in 93 ms of which 1 ms to minimize.
[2024-05-29 09:32:56] [INFO ] Deduced a trap composed of 140 places in 94 ms of which 2 ms to minimize.
[2024-05-29 09:32:56] [INFO ] Deduced a trap composed of 170 places in 107 ms of which 2 ms to minimize.
[2024-05-29 09:32:56] [INFO ] Deduced a trap composed of 187 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 18/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:33:02] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 12 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:33:03] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:33:04] [INFO ] Deduced a trap composed of 178 places in 89 ms of which 1 ms to minimize.
[2024-05-29 09:33:04] [INFO ] Deduced a trap composed of 177 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:08] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:14] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
SMT process timed out in 60143ms, After SMT, problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60921 ms. Remains : 627/627 places, 527/527 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-09 finished in 184442 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 G(p1)))'
Support contains 3 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 985
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1085 transition count 985
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 1085 transition count 886
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 986 transition count 886
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 488 place count 980 transition count 880
Iterating global reduction 2 with 6 rules applied. Total rules applied 494 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 494 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 500 place count 977 transition count 877
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1198 place count 628 transition count 528
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 1200 place count 626 transition count 526
Applied a total of 1200 rules in 108 ms. Remains 626 /1228 variables (removed 602) and now considering 526/1128 (removed 602) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:33:14] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 09:33:15] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 09:33:15] [INFO ] Invariant cache hit.
[2024-05-29 09:33:15] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-29 09:33:15] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:23] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 09:33:23] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-29 09:33:23] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-05-29 09:33:23] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-29 09:33:23] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:33:24] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:33:24] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:33:24] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:33:24] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:33:24] [INFO ] Deduced a trap composed of 146 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:33:40] [INFO ] Deduced a trap composed of 159 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:33:40] [INFO ] Deduced a trap composed of 170 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:33:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 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 1.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 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 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.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 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 235 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:33:49] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1384 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1228 places, 526/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60985 ms. Remains : 626/1228 places, 526/1128 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 33229 reset in 429 ms.
Product exploration explored 100000 steps with 33046 reset in 498 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (28 resets) in 487 ms. (81 steps per ms) remains 1/4 properties
BEST_FIRST walk for 25856 steps (4 resets) in 114 ms. (224 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 463 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2024-05-29 09:34:18] [INFO ] Invariant cache hit.
[2024-05-29 09:34:18] [INFO ] [Real]Absence check using 221 positive place invariants in 84 ms returned sat
[2024-05-29 09:34:19] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-05-29 09:34:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:34:19] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2024-05-29 09:34:20] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2024-05-29 09:34:20] [INFO ] Computed and/alt/rep : 522/1013/522 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-29 09:34:27] [INFO ] Added : 521 causal constraints over 105 iterations in 7732 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 16 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-29 09:34:27] [INFO ] Invariant cache hit.
[2024-05-29 09:34:28] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 09:34:28] [INFO ] Invariant cache hit.
[2024-05-29 09:34:28] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-29 09:34:28] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:34:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:34:36] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:34:36] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-29 09:34:36] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:34:36] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:34:37] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:34:37] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:34:37] [INFO ] Deduced a trap composed of 113 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:34:37] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:34:37] [INFO ] Deduced a trap composed of 146 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:34:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 09:34:53] [INFO ] Deduced a trap composed of 159 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:34:53] [INFO ] Deduced a trap composed of 170 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:34:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:34:58] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 236 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 15/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:35:21] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:35:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1386 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60911 ms. Remains : 626/626 places, 526/526 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) 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 based reduction with 6 factoid took 515 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (28 resets) in 312 ms. (127 steps per ms) remains 1/4 properties
BEST_FIRST walk for 28038 steps (5 resets) in 113 ms. (245 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) 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))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 541 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2024-05-29 09:35:30] [INFO ] Invariant cache hit.
[2024-05-29 09:35:30] [INFO ] [Real]Absence check using 221 positive place invariants in 73 ms returned sat
[2024-05-29 09:35:31] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-29 09:35:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:35:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 74 ms returned sat
[2024-05-29 09:35:32] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2024-05-29 09:35:32] [INFO ] Computed and/alt/rep : 522/1013/522 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-29 09:35:40] [INFO ] Added : 521 causal constraints over 105 iterations in 7995 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 33203 reset in 418 ms.
Product exploration explored 100000 steps with 33317 reset in 491 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-29 09:35:41] [INFO ] Invariant cache hit.
[2024-05-29 09:35:41] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 09:35:41] [INFO ] Invariant cache hit.
[2024-05-29 09:35:42] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-29 09:35:42] [INFO ] Redundant transitions in 4 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:35:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:35:50] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:35:50] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:35:50] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:35:50] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:35:51] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:35:51] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:35:51] [INFO ] Deduced a trap composed of 113 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:35:51] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:35:51] [INFO ] Deduced a trap composed of 146 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:36:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:36:08] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:36:08] [INFO ] Deduced a trap composed of 170 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:36:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 235 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:36:16] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1384 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60880 ms. Remains : 626/626 places, 526/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-11 finished in 207768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 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 282 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 482 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 981 transition count 881
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 981 transition count 879
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 979 transition count 879
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1206 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 1208 place count 622 transition count 522
Applied a total of 1208 rules in 107 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-05-29 09:36:42] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 09:36:42] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 09:36:42] [INFO ] Invariant cache hit.
[2024-05-29 09:36:43] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-05-29 09:36:43] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:36:43] [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-05-29 09:36:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:36:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:36:51] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:36:52] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:36:52] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:37:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:37:06] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:37:06] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 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 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 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, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:37:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:37:33] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:37:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:37:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 14/14 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61037 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-12
Product exploration explored 100000 steps with 73 reset in 544 ms.
Product exploration explored 100000 steps with 73 reset in 650 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(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 10 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-29 09:37:45] [INFO ] Invariant cache hit.
[2024-05-29 09:37:45] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-29 09:37:45] [INFO ] Invariant cache hit.
[2024-05-29 09:37:46] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-29 09:37:46] [INFO ] Redundant transitions in 4 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:37:46] [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-05-29 09:37:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:37:54] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:37:54] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:37:54] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-29 09:37:54] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 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 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 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, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:38:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:38:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 09:38:45] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-29 09:38:45] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 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: 519/519 constraints, Known Traps: 14/14 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60990 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 73 reset in 566 ms.
Product exploration explored 100000 steps with 73 reset in 672 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 11 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-29 09:38:48] [INFO ] Invariant cache hit.
[2024-05-29 09:38:48] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 09:38:48] [INFO ] Invariant cache hit.
[2024-05-29 09:38:48] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-05-29 09:38:48] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:38:48] [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-05-29 09:38:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:38:57] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:38:57] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:38:57] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:38:57] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:39:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:39:11] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:39:11] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 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 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 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, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:39:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:39:39] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:39:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 09:39:42] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:39:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:39:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 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: 14/14 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60874 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-12 finished in 186509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(G(p1)||X(p2)))))'
Support contains 6 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1224 transition count 1124
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1224 transition count 1124
Applied a total of 8 rules in 59 ms. Remains 1224 /1228 variables (removed 4) and now considering 1124/1128 (removed 4) transitions.
// Phase 1: matrix 1124 rows 1224 cols
[2024-05-29 09:39:49] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 09:39:49] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-29 09:39:49] [INFO ] Invariant cache hit.
[2024-05-29 09:39:50] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 09:39:50] [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/1223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Starting structural reductions in LTL mode, iteration 1 : 1224/1228 places, 1124/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31592 ms. Remains : 1224/1228 places, 1124/1128 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-13
Product exploration explored 100000 steps with 130 reset in 521 ms.
Product exploration explored 100000 steps with 125 reset in 609 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 p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5964 steps (0 resets) in 51 ms. (114 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1224 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 : 1224/1224 places, 1124/1124 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1223 transition count 984
Reduce places removed 139 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 141 rules applied. Total rules applied 280 place count 1084 transition count 982
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 1082 transition count 982
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 282 place count 1082 transition count 883
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 480 place count 983 transition count 883
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 3 with 710 rules applied. Total rules applied 1190 place count 628 transition count 528
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 1192 place count 626 transition count 526
Applied a total of 1192 rules in 82 ms. Remains 626 /1224 variables (removed 598) and now considering 526/1124 (removed 598) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-05-29 09:40:22] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 09:40:22] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-29 09:40:22] [INFO ] Invariant cache hit.
[2024-05-29 09:40:23] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2024-05-29 09:40:23] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-29 09:40:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (OVERLAPS) 1/626 variables, 11/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 526/1152 variables, 626/849 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 849 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (OVERLAPS) 1/626 variables, 11/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 526/1152 variables, 626/849 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 523/1372 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1372 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 2/2 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1224 places, 526/1124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61024 ms. Remains : 626/1224 places, 526/1124 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2366 steps (0 resets) in 37 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 155 reset in 554 ms.
Product exploration explored 100000 steps with 153 reset in 625 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 623 transition count 523
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 622 transition count 522
Applied a total of 5 rules in 27 ms. Remains 622 /626 variables (removed 4) and now considering 522/526 (removed 4) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-05-29 09:41:25] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 09:41:25] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 09:41:25] [INFO ] Invariant cache hit.
[2024-05-29 09:41:26] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-05-29 09:41:26] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-05-29 09:41:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 522/1144 variables, 622/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 846 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 520/1366 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1366 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 3/3 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/626 places, 522/526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60899 ms. Remains : 622/626 places, 522/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-13 finished in 157336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 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 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 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 282 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 482 place count 986 transition count 886
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 488 place count 980 transition count 880
Iterating global reduction 2 with 6 rules applied. Total rules applied 494 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 494 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 500 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 1206 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 1208 place count 622 transition count 522
Applied a total of 1208 rules in 99 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-05-29 09:42:26] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 09:42:26] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-29 09:42:26] [INFO ] Invariant cache hit.
[2024-05-29 09:42:27] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-29 09:42:27] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:42:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:42:35] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 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 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 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, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 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 1365 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61032 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-15
Product exploration explored 100000 steps with 73 reset in 549 ms.
Product exploration explored 100000 steps with 72 reset in 659 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 : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
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 10 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-29 09:43:29] [INFO ] Invariant cache hit.
[2024-05-29 09:43:29] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-29 09:43:29] [INFO ] Invariant cache hit.
[2024-05-29 09:43:29] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2024-05-29 09:43:29] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:43:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:43:53] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 09:43:53] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 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 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 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, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 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 1365 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60103ms 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 60889 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
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 72 reset in 550 ms.
Product exploration explored 100000 steps with 72 reset in 662 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 9 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-29 09:44:31] [INFO ] Invariant cache hit.
[2024-05-29 09:44:32] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 09:44:32] [INFO ] Invariant cache hit.
[2024-05-29 09:44:32] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-05-29 09:44:32] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 09:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:44:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 09:44:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:44:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 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 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 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, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 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 1365 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: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60952 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-15 finished in 186426 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((F(p0)&&F(G(!p1))))||G((p2 U p3)))))'
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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLCardinality-09
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1227 transition count 988
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 1088 transition count 988
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 278 place count 1088 transition count 887
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 480 place count 987 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 492 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 492 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 498 place count 978 transition count 878
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1196 place count 629 transition count 529
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 1198 place count 627 transition count 527
Applied a total of 1198 rules in 125 ms. Remains 627 /1228 variables (removed 601) and now considering 527/1128 (removed 601) transitions.
// Phase 1: matrix 527 rows 627 cols
[2024-05-29 09:45:33] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 09:45:33] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-29 09:45:33] [INFO ] Invariant cache hit.
[2024-05-29 09:45:34] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-05-29 09:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:45:41] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:45:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:45:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:45:43] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:45:43] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2024-05-29 09:45:43] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:45:44] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 2 ms to minimize.
[2024-05-29 09:45:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 102 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:45:58] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:45:59] [INFO ] Deduced a trap composed of 134 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:45:59] [INFO ] Deduced a trap composed of 147 places in 77 ms of which 5 ms to minimize.
[2024-05-29 09:45:59] [INFO ] Deduced a trap composed of 160 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:45:59] [INFO ] Deduced a trap composed of 177 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:45:59] [INFO ] Deduced a trap composed of 191 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:46:00] [INFO ] Deduced a trap composed of 203 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:46:00] [INFO ] Deduced a trap composed of 220 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:46:13] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:46:13] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:46:14] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:46:15] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:46:15] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:46:15] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 1 ms to minimize.
[2024-05-29 09:46:16] [INFO ] Deduced a trap composed of 170 places in 105 ms of which 2 ms to minimize.
[2024-05-29 09:46:16] [INFO ] Deduced a trap composed of 187 places in 109 ms of which 2 ms to minimize.
[2024-05-29 09:46:16] [INFO ] Deduced a trap composed of 185 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:46:21] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:46:21] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:46:21] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2024-05-29 09:46:21] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:46:21] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 99 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:46:22] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:46:23] [INFO ] Deduced a trap composed of 132 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:46:23] [INFO ] Deduced a trap composed of 143 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:46:23] [INFO ] Deduced a trap composed of 178 places in 92 ms of which 2 ms to minimize.
[2024-05-29 09:46:23] [INFO ] Deduced a trap composed of 186 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:46:24] [INFO ] Deduced a trap composed of 198 places in 112 ms of which 1 ms to minimize.
[2024-05-29 09:46:24] [INFO ] Deduced a trap composed of 215 places in 108 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2024-05-29 09:46:29] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 0 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:46:30] [INFO ] Deduced a trap composed of 116 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:46:31] [INFO ] Deduced a trap composed of 175 places in 97 ms of which 1 ms to minimize.
[2024-05-29 09:46:31] [INFO ] Deduced a trap composed of 202 places in 96 ms of which 2 ms to minimize.
[2024-05-29 09:46:31] [INFO ] Deduced a trap composed of 201 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LI_LTL mode, iteration 1 : 627/1228 places, 527/1128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61040 ms. Remains : 627/1228 places, 527/1128 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-09
Product exploration explored 100000 steps with 25507 reset in 394 ms.
Product exploration explored 100000 steps with 25368 reset in 502 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 155 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:46:35] [INFO ] Invariant cache hit.
[2024-05-29 09:46:35] [INFO ] [Real]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-05-29 09:46:37] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2024-05-29 09:46:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:46:37] [INFO ] [Nat]Absence check using 221 positive place invariants in 90 ms returned sat
[2024-05-29 09:46:38] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-29 09:46:38] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-29 09:46:44] [INFO ] Added : 437 causal constraints over 88 iterations in 5855 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 9 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-29 09:46:44] [INFO ] Invariant cache hit.
[2024-05-29 09:46:44] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 09:46:44] [INFO ] Invariant cache hit.
[2024-05-29 09:46:44] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-05-29 09:46:44] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:46:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:46:53] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:46:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:46:54] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:46:54] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:46:55] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:46:55] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:47:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 09:47:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:47:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 09:47:08] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:47:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:47:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 09:47:08] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 09:47:09] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:47:10] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 0 ms to minimize.
[2024-05-29 09:47:10] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:47:10] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:47:10] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:47:10] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:47:11] [INFO ] Deduced a trap composed of 134 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:47:11] [INFO ] Deduced a trap composed of 147 places in 93 ms of which 1 ms to minimize.
[2024-05-29 09:47:11] [INFO ] Deduced a trap composed of 160 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:47:11] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 2 ms to minimize.
[2024-05-29 09:47:11] [INFO ] Deduced a trap composed of 191 places in 91 ms of which 2 ms to minimize.
[2024-05-29 09:47:12] [INFO ] Deduced a trap composed of 203 places in 110 ms of which 2 ms to minimize.
[2024-05-29 09:47:12] [INFO ] Deduced a trap composed of 220 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 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 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:47:25] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:47:26] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:47:26] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:47:26] [INFO ] Deduced a trap composed of 126 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:47:26] [INFO ] Deduced a trap composed of 140 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:47:27] [INFO ] Deduced a trap composed of 170 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:47:27] [INFO ] Deduced a trap composed of 187 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:47:27] [INFO ] Deduced a trap composed of 185 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:47:32] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 114 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 132 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:47:33] [INFO ] Deduced a trap composed of 143 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:47:34] [INFO ] Deduced a trap composed of 178 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:47:34] [INFO ] Deduced a trap composed of 186 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:47:34] [INFO ] Deduced a trap composed of 198 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:47:35] [INFO ] Deduced a trap composed of 215 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:47:39] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 57 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:47:40] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:47:41] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:47:41] [INFO ] Deduced a trap composed of 175 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:47:42] [INFO ] Deduced a trap composed of 202 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:47:42] [INFO ] Deduced a trap composed of 201 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60932 ms. Remains : 627/627 places, 527/527 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 192 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:47:45] [INFO ] Invariant cache hit.
[2024-05-29 09:47:45] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2024-05-29 09:47:47] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2024-05-29 09:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:47:47] [INFO ] [Nat]Absence check using 221 positive place invariants in 77 ms returned sat
[2024-05-29 09:47:48] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-29 09:47:48] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-29 09:47:54] [INFO ] Added : 437 causal constraints over 88 iterations in 5839 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25514 reset in 414 ms.
Product exploration explored 100000 steps with 25829 reset in 485 ms.
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 10 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-29 09:47:55] [INFO ] Invariant cache hit.
[2024-05-29 09:47:55] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-29 09:47:55] [INFO ] Invariant cache hit.
[2024-05-29 09:47:55] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-05-29 09:47:55] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-05-29 09:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:48:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:48:04] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:48:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:48:05] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:48:06] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:48:06] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 0 ms to minimize.
[2024-05-29 09:48:06] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:48:18] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:48:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:48:20] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-29 09:48:20] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 114 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 134 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:48:21] [INFO ] Deduced a trap composed of 147 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:48:22] [INFO ] Deduced a trap composed of 160 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:48:22] [INFO ] Deduced a trap composed of 177 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:48:22] [INFO ] Deduced a trap composed of 191 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:48:22] [INFO ] Deduced a trap composed of 203 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:48:23] [INFO ] Deduced a trap composed of 220 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 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 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:48:35] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:48:35] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:48:36] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:48:37] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:48:37] [INFO ] Deduced a trap composed of 126 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:48:37] [INFO ] Deduced a trap composed of 140 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:48:37] [INFO ] Deduced a trap composed of 170 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:48:38] [INFO ] Deduced a trap composed of 187 places in 91 ms of which 1 ms to minimize.
[2024-05-29 09:48:38] [INFO ] Deduced a trap composed of 185 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:48:43] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:48:44] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:48:44] [INFO ] Deduced a trap composed of 114 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:48:44] [INFO ] Deduced a trap composed of 132 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:48:44] [INFO ] Deduced a trap composed of 143 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:48:45] [INFO ] Deduced a trap composed of 178 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:48:45] [INFO ] Deduced a trap composed of 186 places in 85 ms of which 1 ms to minimize.
[2024-05-29 09:48:45] [INFO ] Deduced a trap composed of 198 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:48:45] [INFO ] Deduced a trap composed of 215 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-29 09:48:50] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:48:50] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:48:51] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:48:52] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:48:52] [INFO ] Deduced a trap composed of 175 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:48:53] [INFO ] Deduced a trap composed of 202 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:48:53] [INFO ] Deduced a trap composed of 201 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60927 ms. Remains : 627/627 places, 527/527 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-09 finished in 203056 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 G(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(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(G(p1)||X(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-29 09:48:56] [INFO ] Flatten gal took : 61 ms
[2024-05-29 09:48:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 09:48:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1228 places, 1128 transitions and 3216 arcs took 12 ms.
Total runtime 1794402 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPs-PT-020B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1228
TRANSITIONS: 1128
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5112
MODEL NAME: /home/mcc/execution/412/model
1228 places, 1128 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPs-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758800459"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;