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.r356-tall-171683762200971.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 itstools
Input is ShieldRVt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762200971
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 119K 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 ShieldRVt-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717077240068

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 13:54:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:54:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:54:01] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-30 13:54:01] [INFO ] Transformed 503 places.
[2024-05-30 13:54:01] [INFO ] Transformed 503 transitions.
[2024-05-30 13:54:01] [INFO ] Found NUPN structural information;
[2024-05-30 13:54:01] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 403 transition count 403
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 403 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 402 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 402 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 401 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 401 transition count 401
Applied a total of 204 rules in 114 ms. Remains 401 /503 variables (removed 102) and now considering 401/503 (removed 102) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-30 13:54:01] [INFO ] Computed 41 invariants in 26 ms
[2024-05-30 13:54:02] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-30 13:54:02] [INFO ] Invariant cache hit.
[2024-05-30 13:54:02] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-30 13:54:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:07] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 16 ms to minimize.
[2024-05-30 13:54:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:54:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:54:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:54:09] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:54:09] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:54:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:54:10] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:11] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:54:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:15] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:54:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:54:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:20] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 401/802 variables, 401/461 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/802 variables, and 462 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:54:35] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/464 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/864 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:40] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:54:41] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:54:42] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:54:42] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:54:42] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:54:43] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:54:44] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:54:44] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-30 13:54:44] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 20/884 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:46] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-30 13:54:47] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:54:47] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:54:47] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:54:48] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:54:48] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:54:48] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:54:48] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:54:49] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:54:49] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:54:49] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:54:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:54:50] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 20/904 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-30 13:54:54] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:54:54] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:54:55] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:54:55] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:54:55] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:54:55] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:54:56] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:54:56] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:54:56] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:54:56] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:54:57] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:54:57] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:54:57] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:54:57] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:54:58] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:54:58] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:54:58] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:54:58] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:54:59] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 3 ms to minimize.
[2024-05-30 13:54:59] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 20/924 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 924 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 82/82 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 401/503 places, 401/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60882 ms. Remains : 401/503 places, 401/503 transitions.
Support contains 31 out of 401 places after structural reductions.
[2024-05-30 13:55:02] [INFO ] Flatten gal took : 49 ms
[2024-05-30 13:55:02] [INFO ] Flatten gal took : 21 ms
[2024-05-30 13:55:02] [INFO ] Input system was already deterministic with 401 transitions.
RANDOM walk for 34177 steps (8 resets) in 806 ms. (42 steps per ms) remains 0/18 properties
FORMULA ShieldRVt-PT-010B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 123 stabilizing places and 123 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U G((!p1||X(G(!p1)))))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 392 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 392 transition count 392
Applied a total of 18 rules in 11 ms. Remains 392 /401 variables (removed 9) and now considering 392/401 (removed 9) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 13:55:03] [INFO ] Computed 41 invariants in 9 ms
[2024-05-30 13:55:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-30 13:55:03] [INFO ] Invariant cache hit.
[2024-05-30 13:55:03] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 13:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:55:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:55:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:55:09] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:55:09] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:55:09] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:55:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:55:10] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:55:10] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:55:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:55:11] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:12] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 445 constraints, problems are : Problem set: 0 solved, 391 unsolved in 26092 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:33] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
[2024-05-30 13:55:34] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 391/838 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:38] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:55:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:55:38] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:55:38] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:43] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:55:43] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 3 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/878 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:55:50] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 3 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 3 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 20/898 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:58] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:55:58] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:55:58] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:55:58] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 902 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 78/78 constraints]
After SMT, in 56184ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 56189ms
Starting structural reductions in LTL mode, iteration 1 : 392/401 places, 392/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56670 ms. Remains : 392/401 places, 392/401 transitions.
Stuttering acceptance computed with spot in 436 ms :[p1, p1, p1, p1, (AND p1 p0), true, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-01 finished in 57180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((!p0&&X(!p1)))||(!p0&&X((!p1&&F(G(p0)))))))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 392 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 392 transition count 392
Applied a total of 18 rules in 17 ms. Remains 392 /401 variables (removed 9) and now considering 392/401 (removed 9) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 13:56:00] [INFO ] Computed 41 invariants in 4 ms
[2024-05-30 13:56:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 13:56:00] [INFO ] Invariant cache hit.
[2024-05-30 13:56:00] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 13:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:56:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:56:05] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:56:06] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:56:06] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:56:06] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:56:06] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:56:07] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:56:07] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:56:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:56:07] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:56:07] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 445 constraints, problems are : Problem set: 0 solved, 391 unsolved in 23803 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/446 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 391/837 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:32] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 5 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/857 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:38] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:56:38] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:45] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-30 13:56:45] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:56:46] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:56:46] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:56:46] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 3 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 4 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:56:51] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-30 13:56:51] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:56:51] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 20/897 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:56:54] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 898 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 74/74 constraints]
After SMT, in 53871ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 53877ms
Starting structural reductions in LTL mode, iteration 1 : 392/401 places, 392/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54223 ms. Remains : 392/401 places, 392/401 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR p1 p0), p1, (AND (NOT p0) p1), (OR p1 p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-03
Stuttering criterion allowed to conclude after 40503 steps with 0 reset in 195 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-03 finished in 54625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 400 transition count 287
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 287 transition count 287
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 226 place count 287 transition count 216
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 368 place count 216 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 208 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 208 transition count 208
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 384 place count 208 transition count 201
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 398 place count 201 transition count 201
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 562 place count 119 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 119 transition count 118
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 565 place count 118 transition count 117
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 621 place count 90 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 623 place count 88 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 624 place count 87 transition count 141
Applied a total of 624 rules in 100 ms. Remains 87 /401 variables (removed 314) and now considering 141/401 (removed 260) transitions.
// Phase 1: matrix 141 rows 87 cols
[2024-05-30 13:56:55] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:56:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:56:55] [INFO ] Invariant cache hit.
[2024-05-30 13:56:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-30 13:56:55] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-30 13:56:55] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-30 13:56:55] [INFO ] Invariant cache hit.
[2024-05-30 13:56:55] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 2/87 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 140/227 variables, 87/127 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/228 variables, and 141 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 87/87 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 2/87 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 140/227 variables, 87/127 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 135/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 87/87 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 4363ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 4365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/401 places, 141/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4642 ms. Remains : 87/401 places, 141/401 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-04 finished in 4797 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&&((p2 U p3)||p1)))))'
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 400 transition count 292
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 292 transition count 292
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 216 place count 292 transition count 223
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 354 place count 223 transition count 223
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 361 place count 216 transition count 216
Iterating global reduction 2 with 7 rules applied. Total rules applied 368 place count 216 transition count 216
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 368 place count 216 transition count 210
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 380 place count 210 transition count 210
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 556 place count 122 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 122 transition count 121
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 559 place count 121 transition count 120
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 613 place count 94 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 615 place count 92 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 91 transition count 142
Applied a total of 616 rules in 53 ms. Remains 91 /401 variables (removed 310) and now considering 142/401 (removed 259) transitions.
// Phase 1: matrix 142 rows 91 cols
[2024-05-30 13:56:59] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:56:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:56:59] [INFO ] Invariant cache hit.
[2024-05-30 13:57:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 13:57:00] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-30 13:57:00] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-30 13:57:00] [INFO ] Invariant cache hit.
[2024-05-30 13:57:00] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 3/91 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-30 13:57:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-30 13:57:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/232 variables, 91/133 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/233 variables, and 141 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 91/91 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 3/91 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/232 variables, 91/133 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 135/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/233 variables, and 276 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2263 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 91/91 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints]
After SMT, in 4670ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 4672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/401 places, 142/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4887 ms. Remains : 91/401 places, 142/401 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-05
Stuttering criterion allowed to conclude after 2038 steps with 0 reset in 22 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-05 finished in 5039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 400 transition count 287
Reduce places removed 113 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 115 rules applied. Total rules applied 228 place count 287 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 230 place count 285 transition count 285
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 230 place count 285 transition count 214
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 372 place count 214 transition count 214
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 381 place count 205 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 390 place count 205 transition count 205
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 390 place count 205 transition count 197
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 406 place count 197 transition count 197
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 566 place count 117 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 567 place count 117 transition count 116
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 569 place count 116 transition count 115
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 627 place count 87 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 629 place count 85 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 630 place count 84 transition count 141
Applied a total of 630 rules in 39 ms. Remains 84 /401 variables (removed 317) and now considering 141/401 (removed 260) transitions.
// Phase 1: matrix 141 rows 84 cols
[2024-05-30 13:57:04] [INFO ] Computed 40 invariants in 2 ms
[2024-05-30 13:57:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:57:04] [INFO ] Invariant cache hit.
[2024-05-30 13:57:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-30 13:57:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-30 13:57:05] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 13:57:05] [INFO ] Invariant cache hit.
[2024-05-30 13:57:05] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/224 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/225 variables, and 174 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/224 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 136/310 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/225 variables, and 310 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3671 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5955ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5958ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/401 places, 141/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6192 ms. Remains : 84/401 places, 141/401 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-07 finished in 6250 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) U (G(p1)||X(p0))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 394 transition count 394
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 394 transition count 394
Applied a total of 14 rules in 16 ms. Remains 394 /401 variables (removed 7) and now considering 394/401 (removed 7) transitions.
// Phase 1: matrix 394 rows 394 cols
[2024-05-30 13:57:11] [INFO ] Computed 41 invariants in 4 ms
[2024-05-30 13:57:11] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 13:57:11] [INFO ] Invariant cache hit.
[2024-05-30 13:57:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-30 13:57:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:57:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:57:16] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:57:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:57:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:57:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:57:17] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:57:17] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:57:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:57:18] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:57:18] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:23] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
[2024-05-30 13:57:24] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:57:24] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:57:24] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 394/788 variables, 394/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/788 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 451 constraints, problems are : Problem set: 0 solved, 393 unsolved in 28639 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:45] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 394/788 variables, 394/453 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 393/846 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:51] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:57:51] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:57:51] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:57:51] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:57:51] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-30 13:57:52] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:57:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:57:52] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:57:52] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:57:52] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:57:53] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:57:53] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:57:53] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:57:53] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:57:53] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:57:54] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:57:54] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:57:54] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:57:55] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:57:55] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 20/866 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:57:58] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:57:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:57:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:57:58] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:57:59] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:57:59] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:58:00] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:58:00] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:58:00] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:58:01] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:58:01] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:01] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:58:01] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:58:01] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:58:02] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 20/886 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:58:05] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:58:08] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:08] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:08] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:58:08] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:58:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:58:10] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
SMT process timed out in 58702ms, After SMT, problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 58707ms
Starting structural reductions in LTL mode, iteration 1 : 394/401 places, 394/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59036 ms. Remains : 394/401 places, 394/401 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-010B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLCardinality-08 finished in 59691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 391 transition count 391
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 391 transition count 391
Applied a total of 20 rules in 12 ms. Remains 391 /401 variables (removed 10) and now considering 391/401 (removed 10) transitions.
// Phase 1: matrix 391 rows 391 cols
[2024-05-30 13:58:10] [INFO ] Computed 41 invariants in 2 ms
[2024-05-30 13:58:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 13:58:10] [INFO ] Invariant cache hit.
[2024-05-30 13:58:11] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-05-30 13:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:58:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:58:15] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:58:16] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:58:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:58:16] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:58:16] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:58:17] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:58:17] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:58:17] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:58:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:58:17] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 443 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23456 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 390/833 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:58:45] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-05-30 13:58:45] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:58:46] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:58:46] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:58:46] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:58:47] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:58:47] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:47] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:58:47] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:58:47] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:58:52] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:58:52] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:58:52] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:58:53] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:53] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:58:53] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:53] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:58:54] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:58:54] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:58:54] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:54] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:58:55] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:58:55] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:58:55] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:58:55] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:58:56] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:58:56] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:58:56] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:58:56] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:58:56] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:59:03] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:59:03] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 3 ms to minimize.
SMT process timed out in 53571ms, After SMT, problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53577ms
Starting structural reductions in LTL mode, iteration 1 : 391/401 places, 391/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53930 ms. Remains : 391/401 places, 391/401 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-10
Product exploration explored 100000 steps with 953 reset in 174 ms.
Product exploration explored 100000 steps with 953 reset in 224 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/391 stabilizing places and 118/391 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 382 steps (0 resets) in 9 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2024-05-30 13:59:05] [INFO ] Invariant cache hit.
[2024-05-30 13:59:05] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2024-05-30 13:59:06] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-30 13:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:59:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2024-05-30 13:59:06] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-30 13:59:06] [INFO ] Computed and/alt/rep : 390/571/390 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 13:59:08] [INFO ] Added : 385 causal constraints over 77 iterations in 2395 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 391/391 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 390 transition count 282
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 217 place count 282 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 281 transition count 281
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 218 place count 281 transition count 201
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 378 place count 201 transition count 201
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 550 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 115 transition count 114
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 553 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 611 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 613 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 82 transition count 139
Applied a total of 614 rules in 34 ms. Remains 82 /391 variables (removed 309) and now considering 139/391 (removed 252) transitions.
// Phase 1: matrix 139 rows 82 cols
[2024-05-30 13:59:08] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:59:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 13:59:08] [INFO ] Invariant cache hit.
[2024-05-30 13:59:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 13:59:09] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-30 13:59:09] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-30 13:59:09] [INFO ] Invariant cache hit.
[2024-05-30 13:59:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 127 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 134/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 261 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2051 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 4104ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 4106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/391 places, 139/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4310 ms. Remains : 82/391 places, 139/391 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/82 stabilizing places and 2/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-30 13:59:13] [INFO ] Invariant cache hit.
[2024-05-30 13:59:13] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2024-05-30 13:59:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-30 13:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:59:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2024-05-30 13:59:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-30 13:59:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 13:59:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-30 13:59:14] [INFO ] Computed and/alt/rep : 134/451/134 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 13:59:14] [INFO ] Added : 106 causal constraints over 22 iterations in 227 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-10 finished in 63514 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)&&F(p1))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 391 transition count 391
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 391 transition count 391
Applied a total of 20 rules in 14 ms. Remains 391 /401 variables (removed 10) and now considering 391/401 (removed 10) transitions.
// Phase 1: matrix 391 rows 391 cols
[2024-05-30 13:59:14] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:59:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 13:59:14] [INFO ] Invariant cache hit.
[2024-05-30 13:59:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-05-30 13:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:59:20] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:59:20] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:59:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:59:20] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:59:21] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:59:21] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:59:21] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 443 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23220 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 390/833 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:59:43] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:59:43] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:59:43] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:43] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:43] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:59:44] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:59:45] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:59:45] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:59:45] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-30 13:59:45] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:45] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:46] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:59:46] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-30 13:59:46] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:59:46] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:59:48] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-30 13:59:48] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:59:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:59:49] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:59:50] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:59:50] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:59:50] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:50] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:59:50] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:59:51] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:59:51] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-30 13:59:51] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:59:51] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:59:52] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:59:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:59:55] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:59:55] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:56] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:59:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:59:56] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:56] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:57] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:57] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:59:57] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:59:58] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:58] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:59:58] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:59:58] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:59] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:00:03] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:00:04] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:00:04] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:00:05] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:00:05] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:00:05] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:00:06] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:00:06] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:00:06] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:00:07] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/782 variables, and 908 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 86/86 constraints]
After SMT, in 53281ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53285ms
Starting structural reductions in LTL mode, iteration 1 : 391/401 places, 391/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53613 ms. Remains : 391/401 places, 391/401 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1088 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-11 finished in 53772 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 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 393 transition count 393
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 393 transition count 393
Applied a total of 16 rules in 15 ms. Remains 393 /401 variables (removed 8) and now considering 393/401 (removed 8) transitions.
// Phase 1: matrix 393 rows 393 cols
[2024-05-30 14:00:08] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 14:00:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 14:00:08] [INFO ] Invariant cache hit.
[2024-05-30 14:00:08] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-30 14:00:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:00:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:00:13] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:00:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:00:13] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:00:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:00:14] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:00:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:00:14] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:00:15] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:00:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:00:15] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:18] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 393/786 variables, 393/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 447 constraints, problems are : Problem set: 0 solved, 392 unsolved in 25868 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 393/786 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 392/840 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:42] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:00:42] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:00:43] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:00:43] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:00:43] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:00:43] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:00:43] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:00:44] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:00:44] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:00:44] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:00:44] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:00:44] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 4 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:00:45] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:00:46] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:00:46] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 20/860 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:48] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:00:48] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:00:48] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 3 ms to minimize.
[2024-05-30 14:00:49] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:00:50] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:00:50] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:00:50] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:00:50] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 3 ms to minimize.
[2024-05-30 14:00:50] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:00:52] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 20/880 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:00:55] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:00:55] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:00:56] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:00:56] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 20/900 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:03] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 901 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 75/75 constraints]
After SMT, in 55919ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 55922ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 393/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56258 ms. Remains : 393/401 places, 393/401 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 290 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-12 finished in 56383 ms.
All properties solved by simple procedures.
Total runtime 423269 ms.

BK_STOP 1717077664536

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVt-PT-010B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762200971"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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