Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758300220.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 ShieldIIPt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758300220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716926266068

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 19:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 19:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:57:47] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-28 19:57:47] [INFO ] Transformed 213 places.
[2024-05-28 19:57:47] [INFO ] Transformed 198 transitions.
[2024-05-28 19:57:47] [INFO ] Found NUPN structural information;
[2024-05-28 19:57:47] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPt-PT-003B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 170
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 184 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 184 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 183 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 183 transition count 168
Applied a total of 60 rules in 62 ms. Remains 183 /213 variables (removed 30) and now considering 168/198 (removed 30) transitions.
// Phase 1: matrix 168 rows 183 cols
[2024-05-28 19:57:47] [INFO ] Computed 28 invariants in 19 ms
[2024-05-28 19:57:47] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 19:57:47] [INFO ] Invariant cache hit.
[2024-05-28 19:57:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-28 19:57:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 9 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:57:51] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/351 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:57:55] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:57:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:57:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/351 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:57:56] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 246 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11160 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:58:00] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:58:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:58:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:58:01] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/351 variables, 183/251 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 167/418 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:58:02] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 19:58:03] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-28 19:58:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:58:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:58:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:58:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:58:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:58:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/351 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 429 constraints, problems are : Problem set: 0 solved, 167 unsolved in 15628 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 51/51 constraints]
After SMT, in 26859ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 26881ms
Starting structural reductions in LTL mode, iteration 1 : 183/213 places, 168/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27382 ms. Remains : 183/213 places, 168/198 transitions.
Support contains 28 out of 183 places after structural reductions.
[2024-05-28 19:58:15] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:58:15] [INFO ] Flatten gal took : 16 ms
[2024-05-28 19:58:15] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 27 out of 183 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1102 ms. (36 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2024-05-28 19:58:15] [INFO ] Invariant cache hit.
Problem AtomicPropp17 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 91/183 variables, 16/30 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 8 ms to minimize.
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 168/351 variables, 183/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 219 constraints, problems are : Problem set: 2 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 157/183 variables, 26/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 8/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 2/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 168/351 variables, 183/221 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/222 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 223 constraints, problems are : Problem set: 2 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 714ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 168/168 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 183 transition count 136
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 151 transition count 136
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 64 place count 151 transition count 113
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 110 place count 128 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 125 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 125 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 116 place count 125 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 122 transition count 107
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 226 place count 70 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 70 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 69 transition count 53
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 245 place count 61 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 61 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 61 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 60 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 252 place count 58 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 252 place count 58 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 57 transition count 55
Applied a total of 254 rules in 42 ms. Remains 57 /183 variables (removed 126) and now considering 55/168 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 57/183 places, 55/168 transitions.
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1895529 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :0 out of 1
Probabilistic random walk after 1895529 steps, saw 952536 distinct states, run finished after 3005 ms. (steps per millisecond=630 ) properties seen :0
// Phase 1: matrix 55 rows 57 cols
[2024-05-28 19:58:19] [INFO ] Computed 26 invariants in 1 ms
[2024-05-28 19:58:19] [INFO ] State equation strengthened by 3 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/91 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/93 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/93 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/94 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/105 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/105 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/105 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/106 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/106 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/106 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/112 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/112 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/112 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/112 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/91 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/94 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/94 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 11/105 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/105 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/106 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/106 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/106 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/112 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/112 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/112 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/112 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 55/55 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-28 19:58:19] [INFO ] Invariant cache hit.
[2024-05-28 19:58:19] [INFO ] Implicit Places using invariants in 48 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 55/55 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 54
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 19:58:19] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 19:58:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 19:58:19] [INFO ] Invariant cache hit.
[2024-05-28 19:58:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 19:58:19] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/57 places, 54/55 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 155 ms. Remains : 55/57 places, 54/55 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1928668 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :0 out of 1
Probabilistic random walk after 1928668 steps, saw 961864 distinct states, run finished after 3001 ms. (steps per millisecond=642 ) properties seen :0
[2024-05-28 19:58:22] [INFO ] Invariant cache hit.
[2024-05-28 19:58:22] [INFO ] State equation strengthened by 2 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/90 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/102 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/103 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/103 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/103 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 6/109 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/109 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/109 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/109 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/90 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/91 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/102 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/103 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/109 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/109 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 55/55 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-28 19:58:23] [INFO ] Invariant cache hit.
[2024-05-28 19:58:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 19:58:23] [INFO ] Invariant cache hit.
[2024-05-28 19:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 19:58:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-28 19:58:23] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-28 19:58:23] [INFO ] Invariant cache hit.
[2024-05-28 19:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 83 constraints, problems are : Problem set: 0 solved, 53 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 53/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 136 constraints, problems are : Problem set: 0 solved, 53 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1481 ms. Remains : 55/55 places, 54/54 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 55 transition count 54
Applied a total of 6 rules in 7 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 19:58:24] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 19:58:24] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-28 19:58:24] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 19:58:24] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-28 19:58:24] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 19:58:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 19:58:24] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 19:58:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 19:58:24] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 128 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 47 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 163
Applied a total of 10 rules in 3 ms. Remains 178 /183 variables (removed 5) and now considering 163/168 (removed 5) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 19:58:25] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:58:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 19:58:25] [INFO ] Invariant cache hit.
[2024-05-28 19:58:25] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:58:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:58:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:58:28] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9210 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:58:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:58:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:58:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:58:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:39] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:42] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:58:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 19098 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 28324ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 28326ms
Starting structural reductions in LTL mode, iteration 1 : 178/183 places, 163/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28510 ms. Remains : 178/183 places, 163/168 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-01 finished in 28843 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||G(p1)))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 182 transition count 136
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 151 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 150 transition count 135
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 64 place count 150 transition count 113
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 108 place count 128 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 123 transition count 108
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 123 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 118 place count 123 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 128 place count 118 transition count 103
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 222 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 71 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 70 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 239 place count 63 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 61 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 243 place count 59 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 243 place count 59 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 58 transition count 55
Applied a total of 245 rules in 29 ms. Remains 58 /183 variables (removed 125) and now considering 55/168 (removed 113) transitions.
// Phase 1: matrix 55 rows 58 cols
[2024-05-28 19:58:53] [INFO ] Computed 26 invariants in 1 ms
[2024-05-28 19:58:53] [INFO ] Implicit Places using invariants in 40 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/183 places, 55/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 54
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 56 cols
[2024-05-28 19:58:53] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 19:58:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 19:58:53] [INFO ] Invariant cache hit.
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/183 places, 54/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 56/183 places, 54/168 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-02
Product exploration explored 100000 steps with 5497 reset in 264 ms.
Stack based approach found an accepted trace after 28984 steps with 1656 reset with depth 35 and stack size 34 in 59 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-02 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(p2)))))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 181 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 181 transition count 166
Applied a total of 4 rules in 4 ms. Remains 181 /183 variables (removed 2) and now considering 166/168 (removed 2) transitions.
// Phase 1: matrix 166 rows 181 cols
[2024-05-28 19:58:54] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:58:54] [INFO ] Invariant cache hit.
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-28 19:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:58] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 166/347 variables, 181/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:59:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:59:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:59:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
[2024-05-28 19:59:05] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/347 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/347 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 246 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13046 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:08] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:59:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:59:08] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:59:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:59:08] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 166/347 variables, 181/253 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 165/418 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:59:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:59:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:59:11] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:59:11] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:59:12] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 19:59:12] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:15] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 19:59:17] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 430 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20635 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 56/56 constraints]
After SMT, in 33696ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 33699ms
Starting structural reductions in LTL mode, iteration 1 : 181/183 places, 166/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33851 ms. Remains : 181/183 places, 166/168 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-03
Product exploration explored 100000 steps with 390 reset in 152 ms.
Stack based approach found an accepted trace after 299 steps with 4 reset with depth 73 and stack size 73 in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-03 finished in 34187 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((X(G(p0))&&F(p1)))&&F(G(p2))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 182 transition count 135
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 150 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 149 transition count 134
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 66 place count 149 transition count 111
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 112 place count 126 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 122 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 122 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 122 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 118 transition count 103
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 222 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 71 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 241 place count 62 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 60 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 245 place count 58 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 245 place count 58 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 57 transition count 55
Applied a total of 247 rules in 37 ms. Remains 57 /183 variables (removed 126) and now considering 55/168 (removed 113) transitions.
// Phase 1: matrix 55 rows 57 cols
[2024-05-28 19:59:28] [INFO ] Computed 26 invariants in 0 ms
[2024-05-28 19:59:28] [INFO ] Implicit Places using invariants in 48 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/183 places, 55/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 54
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 19:59:28] [INFO ] Computed 25 invariants in 2 ms
[2024-05-28 19:59:28] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 19:59:28] [INFO ] Invariant cache hit.
[2024-05-28 19:59:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 19:59:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/183 places, 54/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 55/183 places, 54/168 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-04 finished in 463 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 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 163
Applied a total of 10 rules in 5 ms. Remains 178 /183 variables (removed 5) and now considering 163/168 (removed 5) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 19:59:29] [INFO ] Computed 28 invariants in 0 ms
[2024-05-28 19:59:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 19:59:29] [INFO ] Invariant cache hit.
[2024-05-28 19:59:29] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:59:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:59:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:59:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:59:32] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:34] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:59:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9062 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:45] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18239 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27317ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27319ms
Starting structural reductions in LTL mode, iteration 1 : 178/183 places, 163/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27499 ms. Remains : 178/183 places, 163/168 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-05 finished in 27612 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)))'
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 163
Applied a total of 10 rules in 5 ms. Remains 178 /183 variables (removed 5) and now considering 163/168 (removed 5) transitions.
[2024-05-28 19:59:56] [INFO ] Invariant cache hit.
[2024-05-28 19:59:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 19:59:56] [INFO ] Invariant cache hit.
[2024-05-28 19:59:56] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:59:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:59:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:59:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:59:57] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:59:59] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:59:59] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:59:59] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:00:00] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:00:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8809 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:06] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:00:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:00:07] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:00:08] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:00:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:00:08] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:00:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:00:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:00:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:00:11] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:00:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:12] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18164 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 26986ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 26987ms
Starting structural reductions in LTL mode, iteration 1 : 178/183 places, 163/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27151 ms. Remains : 178/183 places, 163/168 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-07 finished in 27298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&G(F(p1)))))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 163
Applied a total of 10 rules in 2 ms. Remains 178 /183 variables (removed 5) and now considering 163/168 (removed 5) transitions.
[2024-05-28 20:00:24] [INFO ] Invariant cache hit.
[2024-05-28 20:00:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 20:00:24] [INFO ] Invariant cache hit.
[2024-05-28 20:00:24] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 20:00:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 2 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:29] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:00:30] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8941 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 5 ms to minimize.
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18032 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 26989ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 26991ms
Starting structural reductions in LTL mode, iteration 1 : 178/183 places, 163/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27154 ms. Remains : 178/183 places, 163/168 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-08
Product exploration explored 100000 steps with 6 reset in 154 ms.
Stack based approach found an accepted trace after 131 steps with 0 reset with depth 132 and stack size 132 in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-08 finished in 27604 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 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 182 transition count 136
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 151 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 150 transition count 135
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 64 place count 150 transition count 111
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 112 place count 126 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 122 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 122 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 122 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 118 transition count 103
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 226 place count 69 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 69 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 68 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 245 place count 60 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 59 transition count 56
Applied a total of 246 rules in 27 ms. Remains 59 /183 variables (removed 124) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-05-28 20:00:51] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants in 45 ms returned [50, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/183 places, 56/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 55
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 20:00:51] [INFO ] Computed 26 invariants in 2 ms
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants in 39 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/183 places, 55/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 54
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 54 cols
[2024-05-28 20:00:51] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 20:00:51] [INFO ] Invariant cache hit.
[2024-05-28 20:00:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/183 places, 54/168 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 213 ms. Remains : 54/183 places, 54/168 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-09 finished in 260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 182 transition count 136
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 151 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 150 transition count 135
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 64 place count 150 transition count 111
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 112 place count 126 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 122 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 122 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 122 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 118 transition count 103
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 226 place count 69 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 69 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 68 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 245 place count 60 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 59 transition count 56
Applied a total of 246 rules in 16 ms. Remains 59 /183 variables (removed 124) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-05-28 20:00:51] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants in 45 ms returned [50, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/183 places, 56/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 55
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 20:00:51] [INFO ] Computed 26 invariants in 0 ms
[2024-05-28 20:00:51] [INFO ] Implicit Places using invariants in 41 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/183 places, 55/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 54
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 54 cols
[2024-05-28 20:00:51] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 20:00:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 20:00:52] [INFO ] Invariant cache hit.
[2024-05-28 20:00:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 20:00:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/183 places, 54/168 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 201 ms. Remains : 54/183 places, 54/168 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/54 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-003B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-003B-LTLFireability-12 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((p1 U p2))))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 163
Applied a total of 10 rules in 4 ms. Remains 178 /183 variables (removed 5) and now considering 163/168 (removed 5) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 20:00:52] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:00:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 20:00:52] [INFO ] Invariant cache hit.
[2024-05-28 20:00:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 20:00:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:58] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:00:58] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8887 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:06] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:01:06] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:01:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 20:01:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:08] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18263 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27164ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27165ms
Starting structural reductions in LTL mode, iteration 1 : 178/183 places, 163/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27374 ms. Remains : 178/183 places, 163/168 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-13
Product exploration explored 100000 steps with 2439 reset in 175 ms.
Product exploration explored 100000 steps with 2449 reset in 169 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 166 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
RANDOM walk for 3558 steps (0 resets) in 15 ms. (222 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p1)]
Knowledge based reduction with 12 factoid took 648 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
[2024-05-28 20:01:21] [INFO ] Invariant cache hit.
[2024-05-28 20:01:21] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2024-05-28 20:01:21] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-28 20:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:01:21] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2024-05-28 20:01:21] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 20:01:21] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 20:01:22] [INFO ] Computed and/alt/rep : 162/244/162 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 20:01:22] [INFO ] Added : 160 causal constraints over 32 iterations in 497 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-28 20:01:22] [INFO ] Invariant cache hit.
[2024-05-28 20:01:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 20:01:22] [INFO ] Invariant cache hit.
[2024-05-28 20:01:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 20:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8915 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:36] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:01:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:01:37] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:01:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:01:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18037 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 26965ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 26967ms
Finished structural reductions in LTL mode , in 1 iterations and 27116 ms. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 174 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
RANDOM walk for 2708 steps (0 resets) in 13 ms. (193 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p1)]
Knowledge based reduction with 12 factoid took 588 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
[2024-05-28 20:01:50] [INFO ] Invariant cache hit.
[2024-05-28 20:01:50] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2024-05-28 20:01:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 20:01:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:01:51] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2024-05-28 20:01:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 20:01:51] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-28 20:01:51] [INFO ] Computed and/alt/rep : 162/244/162 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 20:01:51] [INFO ] Added : 160 causal constraints over 32 iterations in 458 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 658 reset in 169 ms.
Stack based approach found an accepted trace after 8345 steps with 43 reset with depth 6559 and stack size 6559 in 20 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-13 finished in 59608 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 !X((p1 U (F(p0)&&p2)))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 168/168 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 179 transition count 164
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 179 transition count 164
Applied a total of 8 rules in 3 ms. Remains 179 /183 variables (removed 4) and now considering 164/168 (removed 4) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-28 20:01:52] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:01:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-28 20:01:52] [INFO ] Invariant cache hit.
[2024-05-28 20:01:52] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-28 20:01:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/230 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:01:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 233 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8418 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:01] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/234 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 163/397 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:02] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:02:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:02:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/343 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/343 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 417 constraints, problems are : Problem set: 0 solved, 163 unsolved in 24158 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 47/47 constraints]
After SMT, in 32591ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 32592ms
Starting structural reductions in LTL mode, iteration 1 : 179/183 places, 164/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32754 ms. Remains : 179/183 places, 164/168 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLFireability-14 finished in 32901 ms.
All properties solved by simple procedures.
Total runtime 277761 ms.
ITS solved all properties within timeout

BK_STOP 1716926545011

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-003B"
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 ShieldIIPt-PT-003B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758300220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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