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-171683759200620.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 ShieldPPPt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K 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 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 185K 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 ShieldPPPt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717010898021

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:28:19] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-29 19:28:19] [INFO ] Transformed 783 places.
[2024-05-29 19:28:19] [INFO ] Transformed 713 transitions.
[2024-05-29 19:28:19] [INFO ] Found NUPN structural information;
[2024-05-29 19:28:19] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-010B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 104 place count 679 transition count 609
Iterating global reduction 0 with 104 rules applied. Total rules applied 208 place count 679 transition count 609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 678 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 678 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 677 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 677 transition count 607
Applied a total of 212 rules in 206 ms. Remains 677 /783 variables (removed 106) and now considering 607/713 (removed 106) transitions.
// Phase 1: matrix 607 rows 677 cols
[2024-05-29 19:28:19] [INFO ] Computed 111 invariants in 27 ms
[2024-05-29 19:28:20] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-29 19:28:20] [INFO ] Invariant cache hit.
[2024-05-29 19:28:20] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2024-05-29 19:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/677 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 10 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:28:32] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 4 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:28:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:28:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/677 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:28:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-05-29 19:28:35] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:28:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:28:36] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:28:36] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:28:36] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-29 19:28:36] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
[2024-05-29 19:28:37] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-29 19:28:38] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:28:38] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:28:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:28:38] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:28:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:28:45] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:28:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:28:46] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 11 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:28:49] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
(s92 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1284 variables, and 172 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/677 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/677 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/677 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:28:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:28:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 19:29:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:29:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 606 unsolved
(s479 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0timeout
)
(s480 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1284 variables, and 204 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/677 constraints, PredecessorRefiner: 0/606 constraints, Known Traps: 93/93 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 677/783 places, 607/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61374 ms. Remains : 677/783 places, 607/713 transitions.
Support contains 29 out of 677 places after structural reductions.
[2024-05-29 19:29:21] [INFO ] Flatten gal took : 87 ms
[2024-05-29 19:29:21] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:29:21] [INFO ] Input system was already deterministic with 607 transitions.
RANDOM walk for 40000 steps (8 resets) in 1482 ms. (26 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2024-05-29 19:29:21] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/149 variables, 23/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 528/677 variables, 88/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 12/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 607/1284 variables, 677/801 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 6/807 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1284 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1284 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1284/1284 variables, and 807 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 677/677 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 594/677 variables, 99/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 19/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 5/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 607/1284 variables, 677/812 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 1/813 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1284 variables, 1/814 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1284 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1284 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 814 constraints, problems are : Problem set: 1 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 677/677 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 2454ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 607/607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 677 transition count 467
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 537 transition count 467
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 280 place count 537 transition count 389
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 436 place count 459 transition count 389
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 439 place count 456 transition count 386
Iterating global reduction 2 with 3 rules applied. Total rules applied 442 place count 456 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 442 place count 456 transition count 384
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 446 place count 454 transition count 384
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 784 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 785 place count 285 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 787 place count 284 transition count 213
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 845 place count 255 transition count 213
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 873 place count 255 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 874 place count 254 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 875 place count 253 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 875 place count 253 transition count 210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 879 place count 251 transition count 210
Applied a total of 879 rules in 141 ms. Remains 251 /677 variables (removed 426) and now considering 210/607 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 251/677 places, 210/607 transitions.
RANDOM walk for 40000 steps (8 resets) in 555 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 858714 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 1
Probabilistic random walk after 858714 steps, saw 627601 distinct states, run finished after 3004 ms. (steps per millisecond=285 ) properties seen :0
// Phase 1: matrix 210 rows 251 cols
[2024-05-29 19:29:27] [INFO ] Computed 110 invariants in 4 ms
[2024-05-29 19:29:27] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/46 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/152 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/154 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/158 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/235 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/235 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/241 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/253 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/253 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 74/327 variables, 51/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/327 variables, 17/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/329 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/329 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/329 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/333 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/333 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 55/388 variables, 29/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/388 variables, 9/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/388 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/388 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 3/391 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/391 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/391 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 5/396 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/396 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/396 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 44/440 variables, 29/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/440 variables, 11/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/440 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 1/441 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/441 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/441 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 2/443 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/443 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 15/458 variables, 11/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/458 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/458 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 3/461 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/461 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/461 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 0/461 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 251/251 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/46 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/152 variables, 30/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/154 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/158 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 77/235 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/241 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/253 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 74/327 variables, 51/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/327 variables, 17/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/327 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/329 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/329 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/329 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/333 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/333 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 55/388 variables, 29/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/388 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/388 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/388 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 3/391 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/391 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/391 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 5/396 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/396 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/396 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 44/440 variables, 29/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/440 variables, 11/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/440 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/441 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/441 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/441 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/443 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/443 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 15/458 variables, 11/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/458 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/458 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 3/461 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/461 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/461 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 0/461 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 251/251 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 990ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 251/251 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-29 19:29:28] [INFO ] Invariant cache hit.
[2024-05-29 19:29:29] [INFO ] Implicit Places using invariants in 146 ms returned [234, 238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 249/251 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 247 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 247 transition count 208
Applied a total of 4 rules in 11 ms. Remains 247 /249 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 247 cols
[2024-05-29 19:29:29] [INFO ] Computed 108 invariants in 2 ms
[2024-05-29 19:29:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 19:29:29] [INFO ] Invariant cache hit.
[2024-05-29 19:29:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 19:29:29] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 247/251 places, 208/210 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 529 ms. Remains : 247/251 places, 208/210 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 911421 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 1
Probabilistic random walk after 911421 steps, saw 675170 distinct states, run finished after 3002 ms. (steps per millisecond=303 ) properties seen :0
[2024-05-29 19:29:32] [INFO ] Invariant cache hit.
[2024-05-29 19:29:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/46 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/152 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/154 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/158 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 76/234 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/234 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/240 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/252 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 72/324 variables, 49/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/324 variables, 16/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/324 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/326 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/330 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/330 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 54/384 variables, 29/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/384 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/384 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/386 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/386 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/386 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/390 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/390 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 44/434 variables, 29/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/434 variables, 11/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/434 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1/435 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/435 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/435 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 2/437 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/437 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 15/452 variables, 11/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/452 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/452 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 3/455 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/455 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/455 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 0/455 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 247/247 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/46 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/152 variables, 30/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/154 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/158 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 76/234 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/240 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/252 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/252 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 72/324 variables, 49/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/324 variables, 16/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/324 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/326 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/330 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 54/384 variables, 29/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/384 variables, 10/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/384 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/386 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/386 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/386 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/390 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/390 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/434 variables, 29/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/434 variables, 11/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/434 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/435 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/435 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/435 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/437 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/437 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 15/452 variables, 11/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/452 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/452 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 3/455 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/455 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/455 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/455 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 247/247 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 208/208 transitions.
Applied a total of 0 rules in 17 ms. Remains 247 /247 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 247/247 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 208/208 transitions.
Applied a total of 0 rules in 18 ms. Remains 247 /247 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-29 19:29:33] [INFO ] Invariant cache hit.
[2024-05-29 19:29:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 19:29:33] [INFO ] Invariant cache hit.
[2024-05-29 19:29:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 19:29:33] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-29 19:29:33] [INFO ] Redundant transitions in 6 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-29 19:29:33] [INFO ] Invariant cache hit.
[2024-05-29 19:29:33] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 4/247 variables, 19/128 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 208/455 variables, 247/375 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/455 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 380 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7391 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 247/247 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 19:29:41] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:29:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:29:41] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 4/247 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 19:29:42] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:29:43] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:29:43] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 208/455 variables, 247/381 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 202/588 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 19:29:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 19:29:51] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/455 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 14 (OVERLAPS) 0/455 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 590 constraints, problems are : Problem set: 0 solved, 202 unsolved in 20493 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 247/247 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 28/28 constraints]
After SMT, in 27912ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 27914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28268 ms. Remains : 247/247 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 247 transition count 208
Applied a total of 58 rules in 15 ms. Remains 247 /247 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 208 rows 247 cols
[2024-05-29 19:30:01] [INFO ] Computed 108 invariants in 2 ms
[2024-05-29 19:30:01] [INFO ] [Real]Absence check using 108 positive place invariants in 12 ms returned sat
[2024-05-29 19:30:01] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 19:30:01] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-29 19:30:01] [INFO ] After 17ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:30:01] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:30:01] [INFO ] [Nat]Absence check using 108 positive place invariants in 12 ms returned sat
[2024-05-29 19:30:01] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:30:01] [INFO ] After 23ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 19:30:01] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 19:30:01] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 390 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 159 stabilizing places and 159 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(F(p0)))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 672 transition count 602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 672 transition count 602
Applied a total of 10 rules in 23 ms. Remains 672 /677 variables (removed 5) and now considering 602/607 (removed 5) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:30:02] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 19:30:02] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 19:30:02] [INFO ] Invariant cache hit.
[2024-05-29 19:30:02] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:30:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 4 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:30:20] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-29 19:30:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:30:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:30:28] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 172 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 19/191 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:30:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:30:51] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (OVERLAPS) 602/1274 variables, 672/865 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1274 variables, 601/1466 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 1466 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 82/82 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 672/677 places, 602/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60787 ms. Remains : 672/677 places, 602/607 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-00
Product exploration explored 100000 steps with 88 reset in 360 ms.
Stack based approach found an accepted trace after 7589 steps with 6 reset with depth 584 and stack size 584 in 28 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-00 finished in 61438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 607/607 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 676 transition count 465
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 535 transition count 465
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 282 place count 535 transition count 388
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 436 place count 458 transition count 388
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 439 place count 455 transition count 385
Iterating global reduction 2 with 3 rules applied. Total rules applied 442 place count 455 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 442 place count 455 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 446 place count 453 transition count 383
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 786 place count 283 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 283 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 282 transition count 211
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 845 place count 254 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 847 place count 252 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 251 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 848 place count 251 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 852 place count 249 transition count 207
Applied a total of 852 rules in 66 ms. Remains 249 /677 variables (removed 428) and now considering 207/607 (removed 400) transitions.
// Phase 1: matrix 207 rows 249 cols
[2024-05-29 19:31:03] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:31:03] [INFO ] Implicit Places using invariants in 169 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 170 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/677 places, 207/607 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 245 transition count 205
Applied a total of 4 rules in 7 ms. Remains 245 /247 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 245 cols
[2024-05-29 19:31:03] [INFO ] Computed 108 invariants in 0 ms
[2024-05-29 19:31:04] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 19:31:04] [INFO ] Invariant cache hit.
[2024-05-29 19:31:04] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/677 places, 205/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 611 ms. Remains : 245/677 places, 205/607 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-01
Product exploration explored 100000 steps with 172 reset in 293 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-01 finished in 954 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||G(p1)))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 671 transition count 601
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 671 transition count 601
Applied a total of 12 rules in 36 ms. Remains 671 /677 variables (removed 6) and now considering 601/607 (removed 6) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:31:04] [INFO ] Computed 111 invariants in 12 ms
[2024-05-29 19:31:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-29 19:31:04] [INFO ] Invariant cache hit.
[2024-05-29 19:31:05] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 4 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:31:22] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-05-29 19:31:22] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:31:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:31:52] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:31:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:32:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:32:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1464 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 82/82 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 671/677 places, 601/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60787 ms. Remains : 671/677 places, 601/607 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-02
Product exploration explored 100000 steps with 659 reset in 261 ms.
Product exploration explored 100000 steps with 646 reset in 333 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 217 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/6 properties
BEST_FIRST walk for 6450 steps (0 resets) in 51 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 670 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 19:32:07] [INFO ] Invariant cache hit.
[2024-05-29 19:32:07] [INFO ] [Real]Absence check using 111 positive place invariants in 44 ms returned sat
[2024-05-29 19:32:08] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2024-05-29 19:32:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:32:09] [INFO ] [Nat]Absence check using 111 positive place invariants in 49 ms returned sat
[2024-05-29 19:32:10] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 449 ms
[2024-05-29 19:32:10] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-29 19:32:17] [INFO ] Added : 592 causal constraints over 119 iterations in 6845 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 671 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 671/671 places, 601/601 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 670 transition count 461
Reduce places removed 139 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 140 rules applied. Total rules applied 279 place count 531 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 530 transition count 460
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 280 place count 530 transition count 380
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 440 place count 450 transition count 380
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 768 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 769 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 771 place count 285 transition count 214
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 829 place count 256 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 831 place count 254 transition count 212
Applied a total of 831 rules in 52 ms. Remains 254 /671 variables (removed 417) and now considering 212/601 (removed 389) transitions.
// Phase 1: matrix 212 rows 254 cols
[2024-05-29 19:32:17] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 19:32:17] [INFO ] Implicit Places using invariants in 144 ms returned [246]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/671 places, 212/601 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 253 transition count 210
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 251 transition count 210
Applied a total of 4 rules in 6 ms. Remains 251 /253 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 251 cols
[2024-05-29 19:32:17] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:32:17] [INFO ] Implicit Places using invariants in 129 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/671 places, 210/601 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 247 transition count 208
Applied a total of 4 rules in 7 ms. Remains 247 /249 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 247 cols
[2024-05-29 19:32:17] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:32:17] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-29 19:32:17] [INFO ] Invariant cache hit.
[2024-05-29 19:32:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 19:32:17] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 247/671 places, 208/601 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 650 ms. Remains : 247/671 places, 208/601 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/247 stabilizing places and 4/208 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 997 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 6689 steps (2 resets) in 48 ms. (136 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 1021 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 19:32:20] [INFO ] Invariant cache hit.
[2024-05-29 19:32:20] [INFO ] [Real]Absence check using 108 positive place invariants in 20 ms returned sat
[2024-05-29 19:32:20] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-29 19:32:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:32:20] [INFO ] [Nat]Absence check using 108 positive place invariants in 20 ms returned sat
[2024-05-29 19:32:20] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-29 19:32:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 19:32:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2024-05-29 19:32:21] [INFO ] Computed and/alt/rep : 206/357/206 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 19:32:21] [INFO ] Added : 188 causal constraints over 39 iterations in 877 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 23226 reset in 231 ms.
Stack based approach found an accepted trace after 488 steps with 108 reset with depth 6 and stack size 6 in 2 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-02 finished in 77830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(!p0))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 607/607 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 676 transition count 465
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 535 transition count 465
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 282 place count 535 transition count 388
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 436 place count 458 transition count 388
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 439 place count 455 transition count 385
Iterating global reduction 2 with 3 rules applied. Total rules applied 442 place count 455 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 442 place count 455 transition count 383
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 446 place count 453 transition count 383
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 786 place count 283 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 283 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 282 transition count 211
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 845 place count 254 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 847 place count 252 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 251 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 848 place count 251 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 852 place count 249 transition count 207
Applied a total of 852 rules in 59 ms. Remains 249 /677 variables (removed 428) and now considering 207/607 (removed 400) transitions.
// Phase 1: matrix 207 rows 249 cols
[2024-05-29 19:32:22] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:32:22] [INFO ] Implicit Places using invariants in 119 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/677 places, 207/607 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 245 transition count 205
Applied a total of 4 rules in 7 ms. Remains 245 /247 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 245 cols
[2024-05-29 19:32:22] [INFO ] Computed 108 invariants in 0 ms
[2024-05-29 19:32:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 19:32:22] [INFO ] Invariant cache hit.
[2024-05-29 19:32:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/677 places, 205/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 479 ms. Remains : 245/677 places, 205/607 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, p0]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 218 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-03 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))&&X(G(p2))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 671 transition count 601
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 671 transition count 601
Applied a total of 12 rules in 25 ms. Remains 671 /677 variables (removed 6) and now considering 601/607 (removed 6) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:32:22] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:32:23] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 19:32:23] [INFO ] Invariant cache hit.
[2024-05-29 19:32:23] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:32:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:32:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:32:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:32:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:32:34] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 4 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:32:35] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:32:36] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:32:38] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:32:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:32:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:32:39] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-29 19:32:40] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:32:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:32:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:32:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:32:51] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:32:51] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:32:51] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:32:51] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:32:51] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 171 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:32:59] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:33:01] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:33:02] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:33:10] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:33:15] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 188 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 77/77 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 671/677 places, 601/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60726 ms. Remains : 671/677 places, 601/607 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-04 finished in 60899 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(p1)||p0))||G(p2)))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 676 transition count 466
Reduce places removed 140 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 141 rules applied. Total rules applied 281 place count 536 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 535 transition count 465
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 282 place count 535 transition count 388
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 436 place count 458 transition count 388
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 439 place count 455 transition count 385
Iterating global reduction 3 with 3 rules applied. Total rules applied 442 place count 455 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 455 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 446 place count 453 transition count 383
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 778 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 779 place count 287 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 781 place count 286 transition count 215
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 839 place count 257 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 841 place count 255 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 842 place count 254 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 842 place count 254 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 846 place count 252 transition count 211
Applied a total of 846 rules in 59 ms. Remains 252 /677 variables (removed 425) and now considering 211/607 (removed 396) transitions.
// Phase 1: matrix 211 rows 252 cols
[2024-05-29 19:33:23] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:33:24] [INFO ] Implicit Places using invariants in 139 ms returned [235, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 140 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/677 places, 211/607 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 248 transition count 209
Applied a total of 4 rules in 7 ms. Remains 248 /250 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 248 cols
[2024-05-29 19:33:24] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:33:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 19:33:24] [INFO ] Invariant cache hit.
[2024-05-29 19:33:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 19:33:24] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 248/677 places, 209/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 248/677 places, 209/607 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-05
Product exploration explored 100000 steps with 2 reset in 325 ms.
Product exploration explored 100000 steps with 2 reset in 408 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/248 stabilizing places and 4/209 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1478 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/7 properties
BEST_FIRST walk for 3168 steps (0 resets) in 19 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 9 factoid took 2110 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 248 /248 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-05-29 19:33:29] [INFO ] Invariant cache hit.
[2024-05-29 19:33:29] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 19:33:29] [INFO ] Invariant cache hit.
[2024-05-29 19:33:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 19:33:29] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-29 19:33:29] [INFO ] Redundant transitions in 7 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-29 19:33:29] [INFO ] Invariant cache hit.
[2024-05-29 19:33:29] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 4/248 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:33:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10457 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 248/248 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 4/248 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 203/572 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:33:43] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 573 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10859 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 248/248 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 7/7 constraints]
After SMT, in 21342ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21345ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21720 ms. Remains : 248/248 places, 209/209 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/248 stabilizing places and 4/209 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1357 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/7 properties
BEST_FIRST walk for 1615 steps (0 resets) in 7 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 9 factoid took 2146 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 407 ms.
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 248 /248 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-05-29 19:33:56] [INFO ] Invariant cache hit.
[2024-05-29 19:33:56] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 19:33:56] [INFO ] Invariant cache hit.
[2024-05-29 19:33:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 19:33:56] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-29 19:33:56] [INFO ] Redundant transitions in 2 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-29 19:33:56] [INFO ] Invariant cache hit.
[2024-05-29 19:33:56] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 4/248 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:33:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:33:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:33:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:33:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 19:33:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:34:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10435 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 248/248 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 4/248 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 203/572 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 19:34:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 573 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10678 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 248/248 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 7/7 constraints]
After SMT, in 21138ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21480 ms. Remains : 248/248 places, 209/209 transitions.
Treatment of property ShieldPPPt-PT-010B-LTLFireability-05 finished in 53878 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||X(p1)||G(p2))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 672 transition count 602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 672 transition count 602
Applied a total of 10 rules in 21 ms. Remains 672 /677 variables (removed 5) and now considering 602/607 (removed 5) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:34:17] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 19:34:17] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 19:34:17] [INFO ] Invariant cache hit.
[2024-05-29 19:34:18] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:34:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 4 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:34:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:34:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:34:43] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:34:43] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:34:44] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:34:45] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:34:46] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:34:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:34:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:34:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 172 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:34:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:34:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:34:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:34:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:34:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:34:59] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:35:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:35:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:35:05] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1274 variables, and 197 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 86/86 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 672/677 places, 602/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 672/677 places, 602/607 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/672 stabilizing places and 158/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-29 19:35:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 83/1274 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 12/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 5 factoid took 346 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 602/602 transitions.
Applied a total of 0 rules in 17 ms. Remains 672 /672 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2024-05-29 19:35:20] [INFO ] Invariant cache hit.
[2024-05-29 19:35:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-29 19:35:20] [INFO ] Invariant cache hit.
[2024-05-29 19:35:20] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:35:33] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 4 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:35:37] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:35:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:35:39] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:35:47] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:35:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:35:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:35:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:35:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:35:50] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:35:50] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 171 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:35:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:35:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:35:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:35:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:36:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:36:00] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:36:00] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:36:00] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:36:01] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:36:02] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:36:02] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:36:02] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 19/190 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:36:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:36:06] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:36:07] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:36:07] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:36:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (OVERLAPS) 602/1274 variables, 672/867 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1274 variables, 601/1468 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 1468 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 84/84 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 60835 ms. Remains : 672/672 places, 602/602 transitions.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/672 stabilizing places and 158/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10431 steps (1 resets) in 41 ms. (248 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 602/602 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 672 transition count 602
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 139 place count 672 transition count 641
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 189 place count 672 transition count 641
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 378 place count 672 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 379 place count 672 transition count 640
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 451 place count 600 transition count 568
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 523 place count 600 transition count 568
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 307 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 524 place count 600 transition count 568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 526 place count 598 transition count 566
Deduced a syphon composed of 305 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 528 place count 598 transition count 566
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 343 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 566 place count 598 transition count 726
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 604 place count 560 transition count 650
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 642 place count 560 transition count 650
Deduced a syphon composed of 305 places in 1 ms
Applied a total of 642 rules in 141 ms. Remains 560 /672 variables (removed 112) and now considering 650/602 (removed -48) transitions.
[2024-05-29 19:36:22] [INFO ] Redundant transitions in 14 ms returned []
Running 649 sub problems to find dead transitions.
// Phase 1: matrix 650 rows 560 cols
[2024-05-29 19:36:22] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:36:22] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/560 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-29 19:36:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 20/131 constraints. Problems are: Problem set: 120 solved, 529 unsolved
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-29 19:36:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-29 19:36:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-29 19:36:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-29 19:36:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-29 19:36:34] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 20/151 constraints. Problems are: Problem set: 218 solved, 431 unsolved
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 20/171 constraints. Problems are: Problem set: 336 solved, 313 unsolved
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 20/191 constraints. Problems are: Problem set: 434 solved, 215 unsolved
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD217 is UNSAT
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 4/195 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/195 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 650/1210 variables, 560/755 constraints. Problems are: Problem set: 438 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1210 variables, 68/823 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1210 variables, 0/823 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/1210 variables, 0/823 constraints. Problems are: Problem set: 438 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 823 constraints, problems are : Problem set: 438 solved, 211 unsolved in 29781 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 560/560 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 438 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 306/560 variables, 111/111 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 84/195 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/195 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 650/1210 variables, 560/755 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 68/823 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1210 variables, 211/1034 constraints. Problems are: Problem set: 438 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1210 variables, 0/1034 constraints. Problems are: Problem set: 438 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1034 constraints, problems are : Problem set: 438 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 560/560 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 211/649 constraints, Known Traps: 84/84 constraints]
After SMT, in 59919ms problems are : Problem set: 438 solved, 211 unsolved
Search for dead transitions found 438 dead transitions in 59927ms
Found 438 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 438 transitions
Dead transitions reduction (with SMT) removed 438 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 560/672 places, 212/602 transitions.
Graph (complete) has 721 edges and 560 vertex of which 255 are kept as prefixes of interest. Removing 305 places using SCC suffix rule.3 ms
Discarding 305 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 255 /560 variables (removed 305) and now considering 212/212 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 255/672 places, 212/602 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60108 ms. Remains : 255/672 places, 212/602 transitions.
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 602/602 transitions.
Applied a total of 0 rules in 16 ms. Remains 672 /672 variables (removed 0) and now considering 602/602 (removed 0) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:37:22] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:37:22] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 19:37:22] [INFO ] Invariant cache hit.
[2024-05-29 19:37:23] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:37:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 4 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 4 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:37:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-29 19:37:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:37:41] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:37:48] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:37:48] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:37:48] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:37:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:37:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:37:49] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:37:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:37:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:37:51] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:37:51] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:37:51] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:37:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.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 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 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 672/1274 variables, and 172 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:00] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:38:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:38:01] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:38:01] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:38:01] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:38:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:03] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:38:04] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:38:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:38:09] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:22] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1274 variables, and 197 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 86/86 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 672/672 places, 602/602 transitions.
Treatment of property ShieldPPPt-PT-010B-LTLFireability-06 finished in 245723 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 U (p1||G(F(p2)))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 676 transition count 469
Reduce places removed 137 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 276 place count 539 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 278 place count 537 transition count 467
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 278 place count 537 transition count 390
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 432 place count 460 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 435 place count 457 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 438 place count 457 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 438 place count 457 transition count 385
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 442 place count 455 transition count 385
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 780 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 781 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 783 place count 285 transition count 214
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 837 place count 258 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 839 place count 256 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 840 place count 255 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 840 place count 255 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 253 transition count 210
Applied a total of 844 rules in 56 ms. Remains 253 /677 variables (removed 424) and now considering 210/607 (removed 397) transitions.
// Phase 1: matrix 210 rows 253 cols
[2024-05-29 19:38:23] [INFO ] Computed 110 invariants in 0 ms
[2024-05-29 19:38:23] [INFO ] Implicit Places using invariants in 141 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/677 places, 210/607 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 249 transition count 208
Applied a total of 4 rules in 7 ms. Remains 249 /251 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 249 cols
[2024-05-29 19:38:23] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:38:23] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 19:38:23] [INFO ] Invariant cache hit.
[2024-05-29 19:38:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 19:38:23] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/677 places, 208/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 249/677 places, 208/607 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-07
Product exploration explored 100000 steps with 637 reset in 304 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-07 finished in 1003 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(p0)))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 672 transition count 602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 672 transition count 602
Applied a total of 10 rules in 28 ms. Remains 672 /677 variables (removed 5) and now considering 602/607 (removed 5) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:38:24] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:38:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-29 19:38:24] [INFO ] Invariant cache hit.
[2024-05-29 19:38:25] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:38:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:38:36] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:38:37] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:38:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:40] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-29 19:38:40] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:40] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:38:40] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:38:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:38:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:38:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:38:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:38:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:38:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:38:52] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 171 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:39:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:39:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:39:04] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:39:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:39:05] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:39:06] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 19/190 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:39:08] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:39:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:39:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:39:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:39:19] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:19] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:39:19] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:39:24] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1274 variables, and 198 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 87/87 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 672/677 places, 602/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 672/677 places, 602/607 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-09 finished in 60890 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&&X(X(X(G(p1))))))))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 671 transition count 601
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 671 transition count 601
Applied a total of 12 rules in 28 ms. Remains 671 /677 variables (removed 6) and now considering 601/607 (removed 6) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:39:25] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:39:25] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 19:39:25] [INFO ] Invariant cache hit.
[2024-05-29 19:39:25] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:37] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 3 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:39:38] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:39] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 4 ms to minimize.
[2024-05-29 19:39:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:39:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:39:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:39:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:39:41] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:39:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:39:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:39:43] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-29 19:39:43] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:39:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:39:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:39:51] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:39:51] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 3 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:39:54] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 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 671/1272 variables, and 171 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:40:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:40:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:40:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:40:05] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:40:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:40:07] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:40:07] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:40:07] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:40:13] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:40:17] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 188 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 77/77 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 671/677 places, 601/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 671/677 places, 601/607 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 321 steps with 0 reset with depth 322 and stack size 322 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-11 finished in 61415 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) U (!F(X(X(p0))) U p1))))'
Support contains 2 out of 677 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 : 677/677 places, 607/607 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 676 transition count 465
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 535 transition count 465
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 282 place count 535 transition count 389
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 434 place count 459 transition count 389
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 457 transition count 387
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 457 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 438 place count 457 transition count 386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 440 place count 456 transition count 386
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 780 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 285 transition count 214
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 841 place count 256 transition count 214
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 842 place count 256 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 844 place count 254 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 845 place count 253 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 845 place count 253 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 849 place count 251 transition count 210
Applied a total of 849 rules in 56 ms. Remains 251 /677 variables (removed 426) and now considering 210/607 (removed 397) transitions.
// Phase 1: matrix 210 rows 251 cols
[2024-05-29 19:40:26] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:40:26] [INFO ] Implicit Places using invariants in 136 ms returned [234, 238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 150 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/677 places, 210/607 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 247 transition count 208
Applied a total of 4 rules in 6 ms. Remains 247 /249 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 247 cols
[2024-05-29 19:40:26] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:40:27] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 19:40:27] [INFO ] Invariant cache hit.
[2024-05-29 19:40:27] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/677 places, 208/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 247/677 places, 208/607 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-12
Product exploration explored 100000 steps with 2993 reset in 246 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-12 finished in 860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 676 transition count 466
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 536 transition count 466
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 280 place count 536 transition count 388
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 436 place count 458 transition count 388
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 439 place count 455 transition count 385
Iterating global reduction 2 with 3 rules applied. Total rules applied 442 place count 455 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 442 place count 455 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 446 place count 453 transition count 383
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 2 with 334 rules applied. Total rules applied 780 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 285 transition count 214
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 841 place count 256 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 843 place count 254 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 253 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 844 place count 253 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 848 place count 251 transition count 210
Applied a total of 848 rules in 47 ms. Remains 251 /677 variables (removed 426) and now considering 210/607 (removed 397) transitions.
// Phase 1: matrix 210 rows 251 cols
[2024-05-29 19:40:27] [INFO ] Computed 110 invariants in 2 ms
[2024-05-29 19:40:27] [INFO ] Implicit Places using invariants in 143 ms returned [234, 238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/677 places, 210/607 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 208
Applied a total of 4 rules in 5 ms. Remains 247 /249 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 247 cols
[2024-05-29 19:40:27] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:40:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 19:40:27] [INFO ] Invariant cache hit.
[2024-05-29 19:40:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 19:40:28] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/677 places, 208/607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 560 ms. Remains : 247/677 places, 208/607 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 306 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-13 finished in 1002 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(p1)||p0))||G(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' '!(X(X(F((p0||X(p1)||G(p2))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-010B-LTLFireability-06
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 677/677 places, 607/607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 676 transition count 466
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 536 transition count 466
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 280 place count 536 transition count 389
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 434 place count 459 transition count 389
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 437 place count 456 transition count 386
Iterating global reduction 2 with 3 rules applied. Total rules applied 440 place count 456 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 440 place count 456 transition count 384
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 444 place count 454 transition count 384
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 780 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 839 place count 257 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 841 place count 255 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 842 place count 254 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 842 place count 254 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 846 place count 252 transition count 210
Applied a total of 846 rules in 43 ms. Remains 252 /677 variables (removed 425) and now considering 210/607 (removed 397) transitions.
// Phase 1: matrix 210 rows 252 cols
[2024-05-29 19:40:28] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:40:29] [INFO ] Implicit Places using invariants in 147 ms returned [235, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/677 places, 210/607 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 248 transition count 208
Applied a total of 4 rules in 4 ms. Remains 248 /250 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 248 cols
[2024-05-29 19:40:29] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:40:29] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 19:40:29] [INFO ] Invariant cache hit.
[2024-05-29 19:40:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 19:40:29] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 248/677 places, 208/607 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 550 ms. Remains : 248/677 places, 208/607 transitions.
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-06
Product exploration explored 100000 steps with 21763 reset in 249 ms.
Stack based approach found an accepted trace after 97 steps with 18 reset with depth 11 and stack size 11 in 0 ms.
Treatment of property ShieldPPPt-PT-010B-LTLFireability-06 finished in 1050 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 19:40:29] [INFO ] Flatten gal took : 28 ms
[2024-05-29 19:40:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 19:40:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 677 places, 607 transitions and 1574 arcs took 7 ms.
Total runtime 730643 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-010B

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: 677
TRANSITIONS: 607
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 4602
MODEL NAME: /home/mcc/execution/412/model
677 places, 607 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPt-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759200620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;