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.r091-tall-171624187200212.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 CloudReconfiguration-PT-313, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187200212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716268975139

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-313
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:22:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 05:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:22:56] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-21 05:22:56] [INFO ] Transformed 2585 places.
[2024-05-21 05:22:57] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:22:57] [INFO ] Found NUPN structural information;
[2024-05-21 05:22:57] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-313-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2068 transition count 2578
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2068 transition count 2578
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1062 place count 2068 transition count 2550
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1301 place count 1829 transition count 2311
Iterating global reduction 1 with 239 rules applied. Total rules applied 1540 place count 1829 transition count 2311
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1630 place count 1739 transition count 2221
Iterating global reduction 1 with 90 rules applied. Total rules applied 1720 place count 1739 transition count 2221
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1738 place count 1739 transition count 2203
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1785 place count 1692 transition count 2156
Iterating global reduction 2 with 47 rules applied. Total rules applied 1832 place count 1692 transition count 2156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1840 place count 1692 transition count 2148
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1878 place count 1654 transition count 2106
Iterating global reduction 3 with 38 rules applied. Total rules applied 1916 place count 1654 transition count 2106
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1943 place count 1627 transition count 2079
Iterating global reduction 3 with 27 rules applied. Total rules applied 1970 place count 1627 transition count 2079
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1996 place count 1601 transition count 2053
Iterating global reduction 3 with 26 rules applied. Total rules applied 2022 place count 1601 transition count 2053
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2048 place count 1575 transition count 2027
Iterating global reduction 3 with 26 rules applied. Total rules applied 2074 place count 1575 transition count 2027
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2096 place count 1553 transition count 1991
Iterating global reduction 3 with 22 rules applied. Total rules applied 2118 place count 1553 transition count 1991
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2126 place count 1545 transition count 1978
Iterating global reduction 3 with 8 rules applied. Total rules applied 2134 place count 1545 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2141 place count 1538 transition count 1970
Iterating global reduction 3 with 7 rules applied. Total rules applied 2148 place count 1538 transition count 1970
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2151 place count 1538 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2152 place count 1537 transition count 1966
Iterating global reduction 4 with 1 rules applied. Total rules applied 2153 place count 1537 transition count 1966
Applied a total of 2153 rules in 1628 ms. Remains 1537 /2585 variables (removed 1048) and now considering 1966/3095 (removed 1129) transitions.
// Phase 1: matrix 1966 rows 1537 cols
[2024-05-21 05:22:59] [INFO ] Computed 4 invariants in 45 ms
[2024-05-21 05:22:59] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-21 05:22:59] [INFO ] Invariant cache hit.
[2024-05-21 05:23:00] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Running 1965 sub problems to find dead transitions.
[2024-05-21 05:23:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1536 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/3503 variables, and 4 constraints, problems are : Problem set: 0 solved, 1965 unsolved in 30102 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1537 constraints, PredecessorRefiner: 1965/1965 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1965 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1536 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/3503 variables, and 4 constraints, problems are : Problem set: 0 solved, 1965 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1537 constraints, PredecessorRefiner: 0/1965 constraints, Known Traps: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 1965 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Starting structural reductions in LTL mode, iteration 1 : 1537/2585 places, 1966/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63954 ms. Remains : 1537/2585 places, 1966/3095 transitions.
Support contains 25 out of 1537 places after structural reductions.
[2024-05-21 05:24:01] [INFO ] Flatten gal took : 236 ms
[2024-05-21 05:24:01] [INFO ] Flatten gal took : 72 ms
[2024-05-21 05:24:02] [INFO ] Input system was already deterministic with 1966 transitions.
RANDOM walk for 40000 steps (278 resets) in 3114 ms. (12 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
[2024-05-21 05:24:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1526 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1526 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3482 variables, 1526/1530 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3482 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/3484 variables, 1/1531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3484 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/3486 variables, 1/1532 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3486 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 2/3488 variables, 1/1533 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3488/3503 variables, and 1533 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1529/1537 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1526 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1526 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3482 variables, 1526/1530 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3482 variables, 16/1546 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3482 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/3484 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3484 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/3486 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3486 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 2/3488 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3488 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 2/3490 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3490 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 2/3492 variables, 1/1551 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3492/3503 variables, and 1551 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1531/1537 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10074ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 1537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1836 edges and 1537 vertex of which 672 / 1537 are part of one of the 63 SCC in 9 ms
Free SCC test removed 609 places
Drop transitions (Empty/Sink Transition effects.) removed 767 transitions
Reduce isomorphic transitions removed 767 transitions.
Graph (complete) has 1374 edges and 928 vertex of which 919 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 919 transition count 689
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 551 rules applied. Total rules applied 1059 place count 420 transition count 637
Reduce places removed 33 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 41 rules applied. Total rules applied 1100 place count 387 transition count 629
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 1112 place count 379 transition count 625
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1115 place count 378 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1116 place count 377 transition count 623
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 50 Pre rules applied. Total rules applied 1116 place count 377 transition count 573
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1216 place count 327 transition count 573
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1224 place count 319 transition count 562
Iterating global reduction 6 with 8 rules applied. Total rules applied 1232 place count 319 transition count 562
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1234 place count 319 transition count 560
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1236 place count 317 transition count 560
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1241 place count 312 transition count 555
Iterating global reduction 8 with 5 rules applied. Total rules applied 1246 place count 312 transition count 555
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1251 place count 312 transition count 550
Performed 153 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 9 with 306 rules applied. Total rules applied 1557 place count 159 transition count 307
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1578 place count 159 transition count 286
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1582 place count 155 transition count 282
Iterating global reduction 10 with 4 rules applied. Total rules applied 1586 place count 155 transition count 282
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1587 place count 154 transition count 281
Iterating global reduction 10 with 1 rules applied. Total rules applied 1588 place count 154 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1589 place count 154 transition count 280
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1609 place count 144 transition count 268
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1620 place count 144 transition count 257
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 12 with 2 rules applied. Total rules applied 1622 place count 143 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1624 place count 143 transition count 254
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 13 with 64 rules applied. Total rules applied 1688 place count 111 transition count 287
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 13 with 28 rules applied. Total rules applied 1716 place count 111 transition count 259
Discarding 16 places :
Symmetric choice reduction at 14 with 16 rule applications. Total rules 1732 place count 95 transition count 227
Iterating global reduction 14 with 16 rules applied. Total rules applied 1748 place count 95 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1754 place count 95 transition count 221
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 1759 place count 90 transition count 211
Iterating global reduction 15 with 5 rules applied. Total rules applied 1764 place count 90 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1767 place count 90 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 16 with 15 rules applied. Total rules applied 1782 place count 90 transition count 193
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1783 place count 89 transition count 192
Iterating global reduction 16 with 1 rules applied. Total rules applied 1784 place count 89 transition count 192
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 16 with 2 rules applied. Total rules applied 1786 place count 88 transition count 191
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 1791 place count 88 transition count 186
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1797 place count 83 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1798 place count 83 transition count 184
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1800 place count 83 transition count 184
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1802 place count 83 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1803 place count 82 transition count 183
Applied a total of 1803 rules in 200 ms. Remains 82 /1537 variables (removed 1455) and now considering 183/1966 (removed 1783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 82/1537 places, 183/1966 transitions.
RANDOM walk for 40000 steps (536 resets) in 453 ms. (88 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (141 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2024-05-21 05:24:13] [INFO ] Flow matrix only has 171 transitions (discarded 12 similar events)
// Phase 1: matrix 171 rows 82 cols
[2024-05-21 05:24:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 05:24:13] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 21/253 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/82 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CloudReconfiguration-PT-313-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2145 edges and 1537 vertex of which 1528 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(G(p1)))||F(p2))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1518 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1516 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Applied a total of 60 rules in 712 ms. Remains 1508 /1537 variables (removed 29) and now considering 1930/1966 (removed 36) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 05:24:14] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:24:15] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 05:24:15] [INFO ] Invariant cache hit.
[2024-05-21 05:24:16] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:24:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 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 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60694ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1537 places, 1930/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62612 ms. Remains : 1508/1537 places, 1930/1966 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-00
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-00 finished in 63004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1873 edges and 1537 vertex of which 682 / 1537 are part of one of the 63 SCC in 7 ms
Free SCC test removed 619 places
Ensure Unique test removed 719 transitions
Reduce isomorphic transitions removed 719 transitions.
Graph (complete) has 1422 edges and 918 vertex of which 909 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 908 transition count 742
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 526 rules applied. Total rules applied 1027 place count 409 transition count 715
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1041 place count 395 transition count 715
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1041 place count 395 transition count 669
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1133 place count 349 transition count 669
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1148 place count 334 transition count 644
Iterating global reduction 3 with 15 rules applied. Total rules applied 1163 place count 334 transition count 644
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1165 place count 334 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1167 place count 332 transition count 642
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1177 place count 322 transition count 627
Iterating global reduction 5 with 10 rules applied. Total rules applied 1187 place count 322 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 1192 place count 322 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1193 place count 321 transition count 622
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1196 place count 318 transition count 616
Iterating global reduction 7 with 3 rules applied. Total rules applied 1199 place count 318 transition count 616
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1202 place count 315 transition count 610
Iterating global reduction 7 with 3 rules applied. Total rules applied 1205 place count 315 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 313 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 313 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 311 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 311 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1215 place count 309 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1217 place count 309 transition count 598
Performed 140 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 7 with 280 rules applied. Total rules applied 1497 place count 169 transition count 379
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1512 place count 169 transition count 364
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1517 place count 164 transition count 354
Iterating global reduction 8 with 5 rules applied. Total rules applied 1522 place count 164 transition count 354
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1546 place count 152 transition count 339
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1557 place count 152 transition count 328
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1558 place count 151 transition count 324
Iterating global reduction 9 with 1 rules applied. Total rules applied 1559 place count 151 transition count 324
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 9 with 2 rules applied. Total rules applied 1561 place count 150 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1563 place count 150 transition count 321
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1603 place count 130 transition count 356
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1623 place count 130 transition count 336
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1632 place count 121 transition count 318
Iterating global reduction 11 with 9 rules applied. Total rules applied 1641 place count 121 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1647 place count 121 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1683 place count 121 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1684 place count 120 transition count 275
Applied a total of 1684 rules in 133 ms. Remains 120 /1537 variables (removed 1417) and now considering 275/1966 (removed 1691) transitions.
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
// Phase 1: matrix 218 rows 120 cols
[2024-05-21 05:25:17] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:25:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
[2024-05-21 05:25:17] [INFO ] Invariant cache hit.
[2024-05-21 05:25:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:25:17] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [8, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1537 places, 275/1966 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 116 transition count 273
Applied a total of 4 rules in 8 ms. Remains 116 /118 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 116 cols
[2024-05-21 05:25:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:25:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 05:25:17] [INFO ] Invariant cache hit.
[2024-05-21 05:25:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:25:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1537 places, 273/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 116/1537 places, 273/1966 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-01 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1877 edges and 1537 vertex of which 695 / 1537 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1406 edges and 905 vertex of which 896 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 895 transition count 732
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 518 rules applied. Total rules applied 1014 place count 401 transition count 708
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1026 place count 389 transition count 708
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1026 place count 389 transition count 663
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1116 place count 344 transition count 663
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1132 place count 328 transition count 636
Iterating global reduction 3 with 16 rules applied. Total rules applied 1148 place count 328 transition count 636
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1150 place count 328 transition count 634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1152 place count 326 transition count 634
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1162 place count 316 transition count 619
Iterating global reduction 5 with 10 rules applied. Total rules applied 1172 place count 316 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 1178 place count 316 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1179 place count 315 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1181 place count 313 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1183 place count 313 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1185 place count 311 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1187 place count 311 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1189 place count 309 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1191 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 307 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1197 place count 305 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1199 place count 305 transition count 593
Performed 143 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1485 place count 162 transition count 367
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1500 place count 162 transition count 352
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1506 place count 156 transition count 341
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 156 transition count 341
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1513 place count 155 transition count 340
Iterating global reduction 8 with 1 rules applied. Total rules applied 1514 place count 155 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1515 place count 155 transition count 339
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1539 place count 143 transition count 324
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1550 place count 143 transition count 313
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1551 place count 142 transition count 309
Iterating global reduction 10 with 1 rules applied. Total rules applied 1552 place count 142 transition count 309
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 10 with 2 rules applied. Total rules applied 1554 place count 141 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1556 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1590 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1607 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1616 place count 115 transition count 305
Iterating global reduction 12 with 9 rules applied. Total rules applied 1625 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1631 place count 115 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1667 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1668 place count 114 transition count 262
Applied a total of 1668 rules in 107 ms. Remains 114 /1537 variables (removed 1423) and now considering 262/1966 (removed 1704) transitions.
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-21 05:25:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:25:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 05:25:17] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 05:25:17] [INFO ] Invariant cache hit.
[2024-05-21 05:25:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:25:18] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 156 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1537 places, 262/1966 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 110 transition count 260
Applied a total of 4 rules in 6 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-21 05:25:18] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-21 05:25:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:25:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 05:25:18] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 05:25:18] [INFO ] Invariant cache hit.
[2024-05-21 05:25:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:25:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1537 places, 260/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 110/1537 places, 260/1966 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-03 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||X((F(p2)||!p0))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1520 transition count 1945
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1517 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1515 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Applied a total of 62 rules in 541 ms. Remains 1507 /1537 variables (removed 30) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 05:25:18] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 05:25:19] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 05:25:19] [INFO ] Invariant cache hit.
[2024-05-21 05:25:19] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:25:19] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60581ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1537 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62280 ms. Remains : 1507/1537 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p1 (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-04
Product exploration explored 100000 steps with 708 reset in 259 ms.
Product exploration explored 100000 steps with 708 reset in 237 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 141 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (277 resets) in 351 ms. (113 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (82 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-05-21 05:26:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 817/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3409 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 817/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1514 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2637 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6057ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 9 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 12 factoid took 309 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 164 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 41 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
[2024-05-21 05:26:28] [INFO ] Invariant cache hit.
[2024-05-21 05:26:29] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 05:26:29] [INFO ] Invariant cache hit.
[2024-05-21 05:26:30] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 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 Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Finished structural reductions in LTL mode , in 1 iterations and 61879 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.17 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 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 194 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (284 resets) in 378 ms. (105 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (70 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (76 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
[2024-05-21 05:27:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 817/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3349 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 817/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1514 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2836 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6217ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 253 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 158 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 706 reset in 172 ms.
Product exploration explored 100000 steps with 697 reset in 253 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1836 edges and 1507 vertex of which 685 / 1507 are part of one of the 62 SCC in 3 ms
Free SCC test removed 623 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1376 edges and 884 vertex of which 875 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 875 transition count 1200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 489 place count 875 transition count 1189
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 489 place count 875 transition count 1203
Deduced a syphon composed of 498 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 511 place count 875 transition count 1203
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 796 place count 590 transition count 908
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1081 place count 590 transition count 908
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1093 place count 578 transition count 892
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1105 place count 578 transition count 892
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1111 place count 578 transition count 886
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1123 place count 566 transition count 874
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1135 place count 566 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 564 transition count 870
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 564 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1141 place count 562 transition count 866
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1143 place count 562 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1147 place count 558 transition count 862
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1151 place count 558 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1153 place count 556 transition count 858
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1155 place count 556 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 554 transition count 854
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 554 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1163 place count 550 transition count 848
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1167 place count 550 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1171 place count 546 transition count 832
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1175 place count 546 transition count 832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1176 place count 546 transition count 832
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1180 place count 542 transition count 828
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1184 place count 542 transition count 828
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 315 places in 1 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1289 place count 542 transition count 903
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1327 place count 542 transition count 865
Discarding 99 places :
Symmetric choice reduction at 5 with 99 rule applications. Total rules 1426 place count 443 transition count 756
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 99 rules applied. Total rules applied 1525 place count 443 transition count 756
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1529 place count 439 transition count 750
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 1533 place count 439 transition count 750
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1540 place count 439 transition count 750
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1544 place count 439 transition count 746
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1559 place count 424 transition count 727
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1574 place count 424 transition count 727
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1578 place count 424 transition count 723
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1582 place count 420 transition count 719
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1586 place count 420 transition count 719
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1589 place count 420 transition count 719
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1595 place count 420 transition count 713
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1598 place count 417 transition count 710
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1601 place count 417 transition count 710
Performed 72 Post agglomeration using F-continuation condition with reduction of 125 identical transitions.
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 8 with 72 rules applied. Total rules applied 1673 place count 417 transition count 1032
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 8 with 122 rules applied. Total rules applied 1795 place count 417 transition count 910
Discarding 128 places :
Symmetric choice reduction at 9 with 128 rule applications. Total rules 1923 place count 289 transition count 570
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 9 with 128 rules applied. Total rules applied 2051 place count 289 transition count 570
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 2064 place count 289 transition count 557
Discarding 23 places :
Symmetric choice reduction at 10 with 23 rule applications. Total rules 2087 place count 266 transition count 511
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 10 with 23 rules applied. Total rules applied 2110 place count 266 transition count 511
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2113 place count 266 transition count 563
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2116 place count 263 transition count 534
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2119 place count 263 transition count 534
Deduced a syphon composed of 142 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2165 place count 263 transition count 488
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2169 place count 259 transition count 484
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2173 place count 259 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2176 place count 259 transition count 544
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2179 place count 256 transition count 529
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2182 place count 256 transition count 529
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2182 rules in 342 ms. Remains 256 /1507 variables (removed 1251) and now considering 529/1929 (removed 1400) transitions.
[2024-05-21 05:27:39] [INFO ] Redundant transitions in 30 ms returned []
Running 528 sub problems to find dead transitions.
[2024-05-21 05:27:39] [INFO ] Flow matrix only has 473 transitions (discarded 56 similar events)
// Phase 1: matrix 473 rows 256 cols
[2024-05-21 05:27:39] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 05:27:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 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 TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 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 TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 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 TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
At refinement iteration 1 (OVERLAPS) 472/727 variables, 255/255 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/727 variables, 2/257 constraints. Problems are: Problem set: 257 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/727 variables, 0/257 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 1/728 variables, 1/258 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/258 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/729 variables, 1/259 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/259 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/729 variables, 0/259 constraints. Problems are: Problem set: 257 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 729/729 variables, and 259 constraints, problems are : Problem set: 257 solved, 271 unsolved in 19192 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 257 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 469/586 variables, 117/117 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 2/119 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 271/390 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 0/390 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 142/728 variables, 139/529 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/529 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/729 variables, 1/530 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/729 variables, 0/530 constraints. Problems are: Problem set: 257 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/729 variables, 0/530 constraints. Problems are: Problem set: 257 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 729/729 variables, and 530 constraints, problems are : Problem set: 257 solved, 271 unsolved in 29010 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 271/528 constraints, Known Traps: 0/0 constraints]
After SMT, in 48404ms problems are : Problem set: 257 solved, 271 unsolved
Search for dead transitions found 257 dead transitions in 48407ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1507 places, 272/1929 transitions.
Graph (complete) has 424 edges and 256 vertex of which 118 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.0 ms
Discarding 138 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 118 /256 variables (removed 138) and now considering 272/272 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1507 places, 272/1929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48797 ms. Remains : 118/1507 places, 272/1929 transitions.
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 41 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 05:28:27] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:28:28] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 05:28:28] [INFO ] Invariant cache hit.
[2024-05-21 05:28:29] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:28:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60592ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Finished structural reductions in LTL mode , in 1 iterations and 61784 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Treatment of property CloudReconfiguration-PT-313-LTLFireability-04 finished in 251657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1518 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1516 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Applied a total of 60 rules in 805 ms. Remains 1508 /1537 variables (removed 29) and now considering 1930/1966 (removed 36) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 05:29:30] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 05:29:30] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 05:29:31] [INFO ] Invariant cache hit.
[2024-05-21 05:29:31] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:29:31] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 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 0.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 0.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.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 0.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 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 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 0.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1537 places, 1930/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62568 ms. Remains : 1508/1537 places, 1930/1966 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 395 ms.
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 30 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-313-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-313-LTLFireability-05 finished in 63532 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 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1526 transition count 1953
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1526 transition count 1952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1519 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1519 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1516 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1514 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1514 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1928
Applied a total of 64 rules in 581 ms. Remains 1506 /1537 variables (removed 31) and now considering 1928/1966 (removed 38) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:30:34] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 05:30:34] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 05:30:34] [INFO ] Invariant cache hit.
[2024-05-21 05:30:35] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1537 places, 1928/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62269 ms. Remains : 1506/1537 places, 1928/1966 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-06 finished in 62375 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((G(p0)||(p0&&G(F(!p1))))))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1528 transition count 1955
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1528 transition count 1955
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 1522 transition count 1948
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1520 transition count 1946
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1520 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1519 transition count 1945
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1519 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1518 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1518 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1517 transition count 1943
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1516 transition count 1942
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1515 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1514 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1513 transition count 1938
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1512 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1511 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1511 transition count 1935
Applied a total of 52 rules in 559 ms. Remains 1511 /1537 variables (removed 26) and now considering 1935/1966 (removed 31) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 05:31:36] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:31:36] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-21 05:31:36] [INFO ] Invariant cache hit.
[2024-05-21 05:31:37] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 05:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1537 places, 1935/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62410 ms. Remains : 1511/1537 places, 1935/1966 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-08
Product exploration explored 100000 steps with 702 reset in 252 ms.
Product exploration explored 100000 steps with 699 reset in 231 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (272 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (79 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 271754 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 4
Probabilistic random walk after 271754 steps, saw 67055 distinct states, run finished after 3004 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-21 05:32:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1096/1099 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1099 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1500 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3446/3446 variables, and 1515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4339 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1096/1099 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1099 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1500 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 4/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3445 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3446 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3446 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3446 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3446/3446 variables, and 1519 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3641 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7994ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 700 ms.
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1311 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 872 transition count 640
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1045 place count 384 transition count 580
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1085 place count 345 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1086 place count 344 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1086 place count 344 transition count 529
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1186 place count 294 transition count 529
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1197 place count 283 transition count 513
Iterating global reduction 4 with 11 rules applied. Total rules applied 1208 place count 283 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1211 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1214 place count 280 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1222 place count 272 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1230 place count 272 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1236 place count 272 transition count 494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 271 transition count 488
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 271 transition count 488
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1522 place count 129 transition count 250
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1536 place count 129 transition count 236
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1539 place count 126 transition count 233
Iterating global reduction 8 with 3 rules applied. Total rules applied 1542 place count 126 transition count 233
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1568 place count 113 transition count 217
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1583 place count 113 transition count 202
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 9 with 2 rules applied. Total rules applied 1585 place count 112 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1587 place count 112 transition count 199
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 10 with 2 rules applied. Total rules applied 1589 place count 111 transition count 198
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1591 place count 111 transition count 196
Performed 31 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 62 rules applied. Total rules applied 1653 place count 80 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 11 with 43 rules applied. Total rules applied 1696 place count 80 transition count 184
Discarding 21 places :
Symmetric choice reduction at 12 with 21 rule applications. Total rules 1717 place count 59 transition count 156
Iterating global reduction 12 with 21 rules applied. Total rules applied 1738 place count 59 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1751 place count 59 transition count 143
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1756 place count 54 transition count 133
Iterating global reduction 13 with 5 rules applied. Total rules applied 1761 place count 54 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1766 place count 54 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 14 with 22 rules applied. Total rules applied 1788 place count 54 transition count 106
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1791 place count 51 transition count 99
Iterating global reduction 14 with 3 rules applied. Total rules applied 1794 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1796 place count 49 transition count 97
Iterating global reduction 14 with 2 rules applied. Total rules applied 1798 place count 49 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1800 place count 49 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1802 place count 49 transition count 93
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1806 place count 49 transition count 89
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1811 place count 45 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1812 place count 45 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1814 place count 45 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1815 place count 45 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1816 place count 44 transition count 85
Applied a total of 1816 rules in 62 ms. Remains 44 /1511 variables (removed 1467) and now considering 85/1935 (removed 1850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 44/1511 places, 85/1935 transitions.
RANDOM walk for 15749 steps (303 resets) in 181 ms. (86 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1374 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 871 transition count 725
Reduce places removed 472 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 496 rules applied. Total rules applied 970 place count 399 transition count 701
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 983 place count 387 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 984 place count 386 transition count 700
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 984 place count 386 transition count 653
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1078 place count 339 transition count 653
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1094 place count 323 transition count 627
Iterating global reduction 4 with 16 rules applied. Total rules applied 1110 place count 323 transition count 627
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1113 place count 323 transition count 624
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1116 place count 320 transition count 624
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1126 place count 310 transition count 610
Iterating global reduction 6 with 10 rules applied. Total rules applied 1136 place count 310 transition count 610
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1142 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1144 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1146 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 306 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 304 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 304 transition count 592
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 302 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 302 transition count 588
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 300 transition count 584
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 300 transition count 584
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1163 place count 299 transition count 577
Iterating global reduction 7 with 1 rules applied. Total rules applied 1164 place count 299 transition count 577
Performed 137 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 7 with 274 rules applied. Total rules applied 1438 place count 162 transition count 362
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1449 place count 162 transition count 351
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1453 place count 158 transition count 346
Iterating global reduction 8 with 4 rules applied. Total rules applied 1457 place count 158 transition count 346
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1483 place count 145 transition count 330
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1497 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1533 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1552 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1561 place count 118 transition count 313
Iterating global reduction 10 with 9 rules applied. Total rules applied 1570 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1576 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1613 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1614 place count 117 transition count 269
Applied a total of 1614 rules in 74 ms. Remains 117 /1511 variables (removed 1394) and now considering 269/1935 (removed 1666) transitions.
[2024-05-21 05:32:51] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 117 cols
[2024-05-21 05:32:51] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:32:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 05:32:51] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 05:32:51] [INFO ] Invariant cache hit.
[2024-05-21 05:32:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:32:52] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1511 places, 269/1935 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 113 transition count 267
Applied a total of 4 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 05:32:52] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2024-05-21 05:32:52] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 05:32:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 05:32:52] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:32:52] [INFO ] Invariant cache hit.
[2024-05-21 05:32:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:32:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1511 places, 267/1935 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 113/1511 places, 267/1935 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (4288 resets) in 414 ms. (96 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (719 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (759 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (759 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2024-05-21 05:32:52] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:32:52] [INFO ] Invariant cache hit.
[2024-05-21 05:32:52] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/126 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 188/314 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/323 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 0 solved, 3 unsolved in 175 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/126 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 188/314 variables, 96/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/323 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/324 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 168 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 310 steps, including 12 resets, run visited all 3 properties in 2 ms. (steps per millisecond=155 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 8885 reset in 255 ms.
Product exploration explored 100000 steps with 8838 reset in 195 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 05:32:54] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:32:54] [INFO ] Invariant cache hit.
[2024-05-21 05:32:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 05:32:54] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:32:54] [INFO ] Invariant cache hit.
[2024-05-21 05:32:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:32:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 05:32:54] [INFO ] Redundant transitions in 26 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-21 05:32:54] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:32:54] [INFO ] Invariant cache hit.
[2024-05-21 05:32:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10192 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 262/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 379 constraints, problems are : Problem set: 0 solved, 262 unsolved in 15977 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 26322ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 26324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26533 ms. Remains : 113/113 places, 267/267 transitions.
Treatment of property CloudReconfiguration-PT-313-LTLFireability-08 finished in 104878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&G(p1)) U (p2&&F(!p0))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1520 transition count 1945
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1517 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1515 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Applied a total of 62 rules in 605 ms. Remains 1507 /1537 variables (removed 30) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 05:33:21] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 05:33:21] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-21 05:33:21] [INFO ] Invariant cache hit.
[2024-05-21 05:33:22] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:33:22] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30063 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60589ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1537 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62629 ms. Remains : 1507/1537 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) p0), true, (AND p1 (NOT p0)), (NOT p1), p0]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-09
Product exploration explored 100000 steps with 1345 reset in 241 ms.
Product exploration explored 100000 steps with 1404 reset in 240 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p0))), (X p0), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 173 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) p0), true, (AND p1 (NOT p0)), (NOT p1), p0]
RANDOM walk for 40000 steps (285 resets) in 284 ms. (140 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (80 resets) in 141 ms. (281 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
[2024-05-21 05:34:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 692/694 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/694 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1865 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 692/694 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/694 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1946 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3847ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1836 edges and 1507 vertex of which 681 / 1507 are part of one of the 62 SCC in 1 ms
Free SCC test removed 619 places
Drop transitions (Empty/Sink Transition effects.) removed 782 transitions
Reduce isomorphic transitions removed 782 transitions.
Graph (complete) has 1319 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 501 rules applied. Total rules applied 503 place count 879 transition count 642
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 554 rules applied. Total rules applied 1057 place count 385 transition count 582
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1097 place count 346 transition count 581
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1100 place count 345 transition count 579
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1103 place count 344 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1104 place count 343 transition count 577
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 50 Pre rules applied. Total rules applied 1104 place count 343 transition count 527
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1204 place count 293 transition count 527
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1214 place count 283 transition count 513
Iterating global reduction 6 with 10 rules applied. Total rules applied 1224 place count 283 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 1227 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1230 place count 280 transition count 510
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1237 place count 273 transition count 502
Iterating global reduction 8 with 7 rules applied. Total rules applied 1244 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1250 place count 273 transition count 496
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1251 place count 272 transition count 490
Iterating global reduction 9 with 1 rules applied. Total rules applied 1252 place count 272 transition count 490
Performed 144 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 9 with 288 rules applied. Total rules applied 1540 place count 128 transition count 252
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1558 place count 128 transition count 234
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1561 place count 125 transition count 231
Iterating global reduction 10 with 3 rules applied. Total rules applied 1564 place count 125 transition count 231
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1590 place count 112 transition count 215
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1604 place count 112 transition count 201
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 11 with 2 rules applied. Total rules applied 1606 place count 111 transition count 200
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1608 place count 111 transition count 198
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1674 place count 78 transition count 229
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 1721 place count 78 transition count 182
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1744 place count 55 transition count 152
Iterating global reduction 13 with 23 rules applied. Total rules applied 1767 place count 55 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1780 place count 55 transition count 139
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1786 place count 49 transition count 127
Iterating global reduction 14 with 6 rules applied. Total rules applied 1792 place count 49 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1797 place count 49 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 15 with 23 rules applied. Total rules applied 1820 place count 49 transition count 99
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1822 place count 47 transition count 93
Iterating global reduction 15 with 2 rules applied. Total rules applied 1824 place count 47 transition count 93
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1826 place count 45 transition count 91
Iterating global reduction 15 with 2 rules applied. Total rules applied 1828 place count 45 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1830 place count 45 transition count 89
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 16 with 2 rules applied. Total rules applied 1832 place count 44 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1834 place count 44 transition count 86
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1838 place count 44 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1843 place count 40 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1844 place count 40 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1845 place count 40 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1846 place count 39 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1847 place count 39 transition count 78
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1848 place count 39 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1849 place count 38 transition count 77
Applied a total of 1849 rules in 60 ms. Remains 38 /1507 variables (removed 1469) and now considering 77/1929 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 38/1507 places, 77/1929 transitions.
RANDOM walk for 54 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p0))), (X p0), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 228 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-313-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-313-LTLFireability-09 finished in 68221 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((p0&&F((G(F(p1))||(F(p1)&&G((p2||G(p1))))))))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1947
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1519 transition count 1945
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1517 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 1516 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Applied a total of 58 rules in 593 ms. Remains 1509 /1537 variables (removed 28) and now considering 1932/1966 (removed 34) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2024-05-21 05:34:29] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 05:34:29] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 05:34:29] [INFO ] Invariant cache hit.
[2024-05-21 05:34:30] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 05:34:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 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 Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1537 places, 1932/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62305 ms. Remains : 1509/1537 places, 1932/1966 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-12
Product exploration explored 100000 steps with 709 reset in 194 ms.
Product exploration explored 100000 steps with 709 reset in 200 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2109 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (273 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (70 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (78 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 290410 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 3
Probabilistic random walk after 290410 steps, saw 72270 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-21 05:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3420 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 27 (OVERLAPS) 1/3441 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3441/3441 variables, and 1513 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3437 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3420 variables, 1498/1502 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3420 variables, 2/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3420 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3422 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3422 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3424 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3424 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3426 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3426 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3428 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3428 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3430 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3430 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3432 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3434 variables, 1/1511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3436 variables, 1/1512 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3438 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3440 variables, 1/1514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3441 variables, 1/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3441 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3441 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3441/3441 variables, and 1515 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2111 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5557ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 96 ms.
Support contains 1 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1932/1932 transitions.
Graph (trivial) has 1843 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1308 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 870 transition count 635
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 550 rules applied. Total rules applied 1049 place count 380 transition count 575
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1088 place count 341 transition count 575
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1088 place count 341 transition count 525
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1188 place count 291 transition count 525
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1199 place count 280 transition count 509
Iterating global reduction 3 with 11 rules applied. Total rules applied 1210 place count 280 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1213 place count 280 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1216 place count 277 transition count 506
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1224 place count 269 transition count 496
Iterating global reduction 5 with 8 rules applied. Total rules applied 1232 place count 269 transition count 496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1238 place count 269 transition count 490
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1239 place count 268 transition count 484
Iterating global reduction 6 with 1 rules applied. Total rules applied 1240 place count 268 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1241 place count 268 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 267 transition count 483
Performed 140 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1522 place count 127 transition count 247
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1536 place count 127 transition count 233
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1539 place count 124 transition count 230
Iterating global reduction 9 with 3 rules applied. Total rules applied 1542 place count 124 transition count 230
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1568 place count 111 transition count 214
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1582 place count 111 transition count 200
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 10 with 2 rules applied. Total rules applied 1584 place count 110 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1586 place count 110 transition count 197
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 11 with 2 rules applied. Total rules applied 1588 place count 109 transition count 196
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1590 place count 109 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1656 place count 76 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 1703 place count 76 transition count 178
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1726 place count 53 transition count 148
Iterating global reduction 13 with 23 rules applied. Total rules applied 1749 place count 53 transition count 148
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1763 place count 53 transition count 134
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1769 place count 47 transition count 122
Iterating global reduction 14 with 6 rules applied. Total rules applied 1775 place count 47 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1781 place count 47 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1802 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1804 place count 45 transition count 89
Iterating global reduction 15 with 2 rules applied. Total rules applied 1806 place count 45 transition count 89
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1808 place count 43 transition count 87
Iterating global reduction 15 with 2 rules applied. Total rules applied 1810 place count 43 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1812 place count 43 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1814 place count 43 transition count 83
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1818 place count 43 transition count 79
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1823 place count 39 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1824 place count 39 transition count 77
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1825 place count 39 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1826 place count 38 transition count 76
Applied a total of 1826 rules in 59 ms. Remains 38 /1509 variables (removed 1471) and now considering 76/1932 (removed 1856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 38/1509 places, 76/1932 transitions.
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 169 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 1932/1932 transitions.
Graph (trivial) has 1840 edges and 1509 vertex of which 689 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1378 edges and 883 vertex of which 874 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 873 transition count 725
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 501 rules applied. Total rules applied 979 place count 397 transition count 700
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 992 place count 385 transition count 699
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 994 place count 384 transition count 698
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 994 place count 384 transition count 651
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1088 place count 337 transition count 651
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1104 place count 321 transition count 625
Iterating global reduction 4 with 16 rules applied. Total rules applied 1120 place count 321 transition count 625
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1123 place count 321 transition count 622
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1126 place count 318 transition count 622
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1136 place count 308 transition count 608
Iterating global reduction 6 with 10 rules applied. Total rules applied 1146 place count 308 transition count 608
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1152 place count 308 transition count 602
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1153 place count 307 transition count 600
Iterating global reduction 7 with 1 rules applied. Total rules applied 1154 place count 307 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1155 place count 306 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1156 place count 306 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1157 place count 305 transition count 596
Iterating global reduction 7 with 1 rules applied. Total rules applied 1158 place count 305 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1159 place count 304 transition count 594
Iterating global reduction 7 with 1 rules applied. Total rules applied 1160 place count 304 transition count 594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1161 place count 303 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 1162 place count 303 transition count 592
Performed 137 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 7 with 274 rules applied. Total rules applied 1436 place count 166 transition count 377
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1449 place count 166 transition count 364
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1453 place count 162 transition count 359
Iterating global reduction 8 with 4 rules applied. Total rules applied 1457 place count 162 transition count 359
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1483 place count 149 transition count 343
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1497 place count 149 transition count 329
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1498 place count 148 transition count 327
Iterating global reduction 9 with 1 rules applied. Total rules applied 1499 place count 148 transition count 327
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1537 place count 129 transition count 366
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1560 place count 129 transition count 343
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1569 place count 120 transition count 325
Iterating global reduction 10 with 9 rules applied. Total rules applied 1578 place count 120 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1584 place count 120 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 1625 place count 120 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1626 place count 120 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1627 place count 120 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1628 place count 119 transition count 276
Applied a total of 1628 rules in 75 ms. Remains 119 /1509 variables (removed 1390) and now considering 276/1932 (removed 1656) transitions.
[2024-05-21 05:35:41] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
// Phase 1: matrix 219 rows 119 cols
[2024-05-21 05:35:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:35:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 05:35:41] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
[2024-05-21 05:35:41] [INFO ] Invariant cache hit.
[2024-05-21 05:35:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:35:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [15, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 204 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1509 places, 276/1932 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 115 transition count 274
Applied a total of 4 rules in 3 ms. Remains 115 /117 variables (removed 2) and now considering 274/276 (removed 2) transitions.
[2024-05-21 05:35:41] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
// Phase 1: matrix 217 rows 115 cols
[2024-05-21 05:35:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:35:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 05:35:41] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 05:35:42] [INFO ] Invariant cache hit.
[2024-05-21 05:35:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:35:42] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1509 places, 274/1932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 449 ms. Remains : 115/1509 places, 274/1932 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (4300 resets) in 107 ms. (370 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (126 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-21 05:35:42] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 05:35:42] [INFO ] Invariant cache hit.
[2024-05-21 05:35:42] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/106 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/319 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 331/332 variables, and 118 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 3/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 9040 reset in 146 ms.
Product exploration explored 100000 steps with 9027 reset in 153 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2024-05-21 05:35:43] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 05:35:43] [INFO ] Invariant cache hit.
[2024-05-21 05:35:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 05:35:43] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 05:35:43] [INFO ] Invariant cache hit.
[2024-05-21 05:35:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:35:43] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-21 05:35:43] [INFO ] Redundant transitions in 23 ms returned []
Running 269 sub problems to find dead transitions.
[2024-05-21 05:35:43] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 05:35:43] [INFO ] Invariant cache hit.
[2024-05-21 05:35:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 216/330 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 120 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10274 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 216/330 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 269/387 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 1/331 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/332 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 389 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14648 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints]
After SMT, in 25028ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25228 ms. Remains : 115/115 places, 274/274 transitions.
Treatment of property CloudReconfiguration-PT-313-LTLFireability-12 finished in 99870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1&&X((X(F(p2))||G(p1))))))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1526 transition count 1953
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1526 transition count 1952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1519 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1517 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1516 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Applied a total of 44 rules in 230 ms. Remains 1516 /1537 variables (removed 21) and now considering 1940/1966 (removed 26) transitions.
// Phase 1: matrix 1940 rows 1516 cols
[2024-05-21 05:36:09] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 05:36:09] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 05:36:09] [INFO ] Invariant cache hit.
[2024-05-21 05:36:10] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 05:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 Int declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1537 places, 1940/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61926 ms. Remains : 1516/1537 places, 1940/1966 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 243 ms.
Product exploration explored 100000 steps with 20000 reset in 234 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (271 resets) in 420 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (72 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (76 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 263046 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 4
Probabilistic random walk after 263046 steps, saw 65260 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-21 05:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3435 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3453 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3456/3456 variables, and 1520 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4268 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3435 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3435 variables, 4/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3445 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3447 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3447 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3449 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3449 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3451 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3451 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3453 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3453 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3455 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3456 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3456 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3456 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3456/3456 variables, and 1524 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8326ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 189 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1516 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Applied a total of 0 rules in 46 ms. Remains 1516 /1516 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-21 05:37:24] [INFO ] Invariant cache hit.
[2024-05-21 05:37:24] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 05:37:24] [INFO ] Invariant cache hit.
[2024-05-21 05:37:25] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 05:37:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 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 0)
(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 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 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 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 0)
(s267 1)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(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 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(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 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 0)
(s708 0)
(s709 1)
(s710 0)
(s711 0)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 1)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 1)
(s1112 0)
(s1113 1)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 1)
(s1118 1)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 1)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 1)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60536ms
Finished structural reductions in LTL mode , in 1 iterations and 61724 ms. Remains : 1516/1516 places, 1940/1940 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (275 resets) in 353 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (77 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 249671 steps, run timeout after 3006 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 249671 steps, saw 62119 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-21 05:38:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3435 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3453 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3456/3456 variables, and 1520 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4301 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3435 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3435 variables, 4/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3445 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3447 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3447 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3449 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3449 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3451 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3451 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3453 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3453 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3455 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3456 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3456 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3456 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3456/3456 variables, and 1524 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3517 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7837ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2015 steps, including 15 resets, run visited all 4 properties in 8 ms. (steps per millisecond=251 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 8 ms.
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 223 ms.
Product exploration explored 100000 steps with 20000 reset in 223 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Graph (trivial) has 1849 edges and 1516 vertex of which 693 / 1516 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1379 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 480 rules applied. Total rules applied 482 place count 877 transition count 1203
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 494 place count 877 transition count 1191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 494 place count 877 transition count 1203
Deduced a syphon composed of 500 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 514 place count 877 transition count 1203
Discarding 287 places :
Symmetric choice reduction at 2 with 287 rule applications. Total rules 801 place count 590 transition count 906
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 287 rules applied. Total rules applied 1088 place count 590 transition count 906
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1100 place count 578 transition count 890
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1112 place count 578 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1118 place count 578 transition count 884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1130 place count 566 transition count 872
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1142 place count 566 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 564 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 564 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1148 place count 562 transition count 864
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1150 place count 562 transition count 864
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1154 place count 558 transition count 860
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1158 place count 558 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1160 place count 556 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1162 place count 556 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1164 place count 554 transition count 852
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1166 place count 554 transition count 852
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1170 place count 550 transition count 846
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1174 place count 550 transition count 846
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1178 place count 546 transition count 830
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1182 place count 546 transition count 830
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1183 place count 546 transition count 830
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1187 place count 542 transition count 826
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1191 place count 542 transition count 826
Performed 107 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1298 place count 542 transition count 904
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1338 place count 542 transition count 864
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1439 place count 441 transition count 752
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1540 place count 441 transition count 752
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1542 place count 441 transition count 750
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1548 place count 435 transition count 742
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1554 place count 435 transition count 742
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1561 place count 435 transition count 742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1565 place count 435 transition count 738
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1580 place count 420 transition count 719
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1595 place count 420 transition count 719
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1602 place count 420 transition count 712
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1606 place count 416 transition count 708
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1610 place count 416 transition count 708
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1613 place count 416 transition count 708
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1619 place count 416 transition count 702
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1622 place count 413 transition count 699
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1625 place count 413 transition count 699
Performed 69 Post agglomeration using F-continuation condition with reduction of 112 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 9 with 69 rules applied. Total rules applied 1694 place count 413 transition count 1010
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 9 with 114 rules applied. Total rules applied 1808 place count 413 transition count 896
Discarding 123 places :
Symmetric choice reduction at 10 with 123 rule applications. Total rules 1931 place count 290 transition count 569
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 10 with 123 rules applied. Total rules applied 2054 place count 290 transition count 569
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 2067 place count 290 transition count 556
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 2089 place count 268 transition count 513
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 22 rules applied. Total rules applied 2111 place count 268 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2114 place count 268 transition count 565
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2117 place count 265 transition count 536
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2120 place count 265 transition count 536
Deduced a syphon composed of 144 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 11 with 49 rules applied. Total rules applied 2169 place count 265 transition count 487
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2174 place count 260 transition count 482
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2179 place count 260 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2182 place count 260 transition count 542
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2185 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2188 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2188 rules in 183 ms. Remains 257 /1516 variables (removed 1259) and now considering 527/1940 (removed 1413) transitions.
[2024-05-21 05:38:39] [INFO ] Redundant transitions in 9 ms returned []
Running 526 sub problems to find dead transitions.
[2024-05-21 05:38:39] [INFO ] Flow matrix only has 470 transitions (discarded 57 similar events)
// Phase 1: matrix 470 rows 257 cols
[2024-05-21 05:38:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:38:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 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 TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 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 TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 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 TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
At refinement iteration 1 (OVERLAPS) 469/725 variables, 256/256 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/725 variables, 2/258 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/725 variables, 0/258 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 1/726 variables, 1/259 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/259 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 1/727 variables, 1/260 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 0/260 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/727 variables, 0/260 constraints. Problems are: Problem set: 257 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 260 constraints, problems are : Problem set: 257 solved, 269 unsolved in 22254 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 257 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 466/583 variables, 117/117 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/119 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 269/388 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/388 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 143/726 variables, 140/528 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/528 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/727 variables, 1/529 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 0/529 constraints. Problems are: Problem set: 257 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/727 variables, 0/529 constraints. Problems are: Problem set: 257 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 727/727 variables, and 529 constraints, problems are : Problem set: 257 solved, 269 unsolved in 30015 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 269/526 constraints, Known Traps: 0/0 constraints]
After SMT, in 52461ms problems are : Problem set: 257 solved, 269 unsolved
Search for dead transitions found 257 dead transitions in 52467ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1516 places, 270/1940 transitions.
Graph (complete) has 422 edges and 257 vertex of which 118 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.2 ms
Discarding 139 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 118 /257 variables (removed 139) and now considering 270/270 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1516 places, 270/1940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52674 ms. Remains : 118/1516 places, 270/1940 transitions.
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Applied a total of 0 rules in 44 ms. Remains 1516 /1516 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
// Phase 1: matrix 1940 rows 1516 cols
[2024-05-21 05:39:32] [INFO ] Computed 4 invariants in 22 ms
[2024-05-21 05:39:32] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 05:39:32] [INFO ] Invariant cache hit.
[2024-05-21 05:39:33] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 05:39:33] [INFO ] Invariant cache hit.
(s577 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.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 0.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.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 0.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 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 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 0.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.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 0.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 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.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 0.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 0.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 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.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 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0timeout
)
(s578 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 Int declared 1515/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 1516/1516 places, 1940/1940 transitions.
Treatment of property CloudReconfiguration-PT-313-LTLFireability-13 finished in 265104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||X((F(p2)||!p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p0&&G(F(!p1))))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-313-LTLFireability-08
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1872 edges and 1537 vertex of which 695 / 1537 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1406 edges and 905 vertex of which 896 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 895 transition count 737
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 513 rules applied. Total rules applied 1004 place count 406 transition count 713
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1017 place count 394 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1018 place count 393 transition count 712
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1018 place count 393 transition count 667
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1108 place count 348 transition count 667
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1125 place count 331 transition count 639
Iterating global reduction 4 with 17 rules applied. Total rules applied 1142 place count 331 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1144 place count 331 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1146 place count 329 transition count 637
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1157 place count 318 transition count 621
Iterating global reduction 6 with 11 rules applied. Total rules applied 1168 place count 318 transition count 621
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 1174 place count 318 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1175 place count 317 transition count 615
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1178 place count 314 transition count 609
Iterating global reduction 8 with 3 rules applied. Total rules applied 1181 place count 314 transition count 609
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1184 place count 311 transition count 603
Iterating global reduction 8 with 3 rules applied. Total rules applied 1187 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1189 place count 309 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1191 place count 309 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1193 place count 307 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1195 place count 307 transition count 595
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1197 place count 305 transition count 591
Iterating global reduction 8 with 2 rules applied. Total rules applied 1199 place count 305 transition count 591
Performed 140 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1479 place count 165 transition count 372
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1493 place count 165 transition count 358
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1498 place count 160 transition count 352
Iterating global reduction 9 with 5 rules applied. Total rules applied 1503 place count 160 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1504 place count 159 transition count 351
Iterating global reduction 9 with 1 rules applied. Total rules applied 1505 place count 159 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1506 place count 159 transition count 350
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1532 place count 146 transition count 334
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1546 place count 146 transition count 320
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1547 place count 145 transition count 316
Iterating global reduction 11 with 1 rules applied. Total rules applied 1548 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1584 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1603 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1612 place count 118 transition count 313
Iterating global reduction 12 with 9 rules applied. Total rules applied 1621 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1627 place count 118 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1628 place count 117 transition count 306
Applied a total of 1628 rules in 82 ms. Remains 117 /1537 variables (removed 1420) and now considering 306/1966 (removed 1660) transitions.
[2024-05-21 05:40:34] [INFO ] Flow matrix only has 250 transitions (discarded 56 similar events)
// Phase 1: matrix 250 rows 117 cols
[2024-05-21 05:40:34] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:40:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 05:40:34] [INFO ] Flow matrix only has 250 transitions (discarded 56 similar events)
[2024-05-21 05:40:34] [INFO ] Invariant cache hit.
[2024-05-21 05:40:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:40:34] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 115/1537 places, 306/1966 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 113 transition count 304
Applied a total of 4 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 304/306 (removed 2) transitions.
[2024-05-21 05:40:34] [INFO ] Flow matrix only has 248 transitions (discarded 56 similar events)
// Phase 1: matrix 248 rows 113 cols
[2024-05-21 05:40:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:40:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:40:34] [INFO ] Flow matrix only has 248 transitions (discarded 56 similar events)
[2024-05-21 05:40:34] [INFO ] Invariant cache hit.
[2024-05-21 05:40:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:40:34] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 113/1537 places, 304/1966 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 410 ms. Remains : 113/1537 places, 304/1966 transitions.
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-08
Product exploration explored 100000 steps with 8966 reset in 137 ms.
Product exploration explored 100000 steps with 9072 reset in 139 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (4264 resets) in 177 ms. (224 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (735 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (745 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
[2024-05-21 05:40:35] [INFO ] Flow matrix only has 248 transitions (discarded 56 similar events)
[2024-05-21 05:40:35] [INFO ] Invariant cache hit.
[2024-05-21 05:40:35] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 129/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 218/356 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/360 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/361 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/361 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 124 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 129/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 218/356 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/360 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/361 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/361 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 113 transition count 267
Applied a total of 37 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 267/304 (removed 37) transitions.
[2024-05-21 05:40:36] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2024-05-21 05:40:36] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 05:40:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 05:40:36] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:40:36] [INFO ] Invariant cache hit.
[2024-05-21 05:40:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:40:36] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 05:40:36] [INFO ] Redundant transitions in 26 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-21 05:40:36] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:40:36] [INFO ] Invariant cache hit.
[2024-05-21 05:40:36] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9522 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 262/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 379 constraints, problems are : Problem set: 0 solved, 262 unsolved in 14459 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 24105ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 24107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 267/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24313 ms. Remains : 113/113 places, 267/304 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (4242 resets) in 205 ms. (194 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (750 resets) in 43 ms. (909 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (743 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-21 05:41:00] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:41:00] [INFO ] Invariant cache hit.
[2024-05-21 05:41:00] [INFO ] State equation strengthened by 4 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) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/126 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/314 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/323 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 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) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/126 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 188/314 variables, 96/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/323 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/324 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 8858 reset in 148 ms.
Product exploration explored 100000 steps with 8921 reset in 151 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 05:41:01] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:41:01] [INFO ] Invariant cache hit.
[2024-05-21 05:41:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 05:41:01] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:41:01] [INFO ] Invariant cache hit.
[2024-05-21 05:41:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:41:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-21 05:41:01] [INFO ] Redundant transitions in 26 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-21 05:41:01] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:41:01] [INFO ] Invariant cache hit.
[2024-05-21 05:41:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9486 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 210/322 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 262/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 379 constraints, problems are : Problem set: 0 solved, 262 unsolved in 15032 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 24640ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 24644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24847 ms. Remains : 113/113 places, 267/267 transitions.
Treatment of property CloudReconfiguration-PT-313-LTLFireability-08 finished in 52643 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((p0&&F((G(F(p1))||(F(p1)&&G((p2||G(p1))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1&&X((X(F(p2))||G(p1))))))))'
[2024-05-21 05:41:26] [INFO ] Flatten gal took : 64 ms
[2024-05-21 05:41:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 05:41:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1537 places, 1966 transitions and 4105 arcs took 13 ms.
Total runtime 1110534 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-313

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1537
TRANSITIONS: 1966
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.001s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 2085
MODEL NAME: /home/mcc/execution/409/model
1537 places, 1966 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-313-LTLFireability-04 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-313-LTLFireability-08 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-313-LTLFireability-12 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-313-LTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716270666553

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-313"
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 CloudReconfiguration-PT-313, 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 r091-tall-171624187200212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-313.tgz
mv CloudReconfiguration-PT-313 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 ;