Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820800380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820800380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.9K Apr 29 19:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 19:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:34 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 LamportFastMutEx-COL-7-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652781074704

Running Version 202205111006
[2022-05-17 09:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 09:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:51:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 09:51:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 09:51:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2022-05-17 09:51:16] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 09:51:16] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2022-05-17 09:51:16] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-7-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 15) seen :14
Finished Best-First random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
[2022-05-17 09:51:16] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:51:16] [INFO ] Flatten gal took : 3 ms
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 09:51:16] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 35 ms.
[2022-05-17 09:51:16] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 74 transitions.
Support contains 149 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 18 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:51:17] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:51:17] [INFO ] Computed 65 place invariants in 9 ms
[2022-05-17 09:51:17] [INFO ] Implicit Places using invariants in 271 ms returned []
[2022-05-17 09:51:17] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:51:17] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:51:17] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:51:17] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2022-05-17 09:51:17] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:51:17] [INFO ] Computed 65 place invariants in 11 ms
[2022-05-17 09:51:18] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Support contains 149 out of 219 places after structural reductions.
[2022-05-17 09:51:18] [INFO ] Flatten gal took : 47 ms
[2022-05-17 09:51:18] [INFO ] Flatten gal took : 44 ms
[2022-05-17 09:51:18] [INFO ] Input system was already deterministic with 462 transitions.
Finished random walk after 1382 steps, including 0 resets, run visited all 18 properties in 41 ms. (steps per millisecond=33 )
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 49 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2022-05-17 09:51:18] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2022-05-17 09:51:18] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:51:19] [INFO ] Implicit Places using invariants in 159 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 162 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 27 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2022-05-17 09:51:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:19] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:51:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-17 09:51:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:19] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:51:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:51:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions, in 2 iterations. Remains : 198/219 places, 448/462 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s15 1) (LT s178 1)) (OR (LT s15 1) (LT s179 1)) (OR (LT s15 1) (LT s177 1)) (OR (LT s15 1) (LT s182 1)) (OR (LT s15 1) (LT s183 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1607 reset in 449 ms.
Product exploration explored 100000 steps with 1602 reset in 319 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 17 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:51:21] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:21] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:51:21] [INFO ] Implicit Places using invariants in 137 ms returned []
[2022-05-17 09:51:21] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:21] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:51:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:51:21] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2022-05-17 09:51:21] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-17 09:51:21] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:21] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:51:21] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1599 reset in 306 ms.
Product exploration explored 100000 steps with 1617 reset in 308 ms.
Built C files in :
/tmp/ltsmin6398959734192714674
[2022-05-17 09:51:22] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2022-05-17 09:51:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:22] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2022-05-17 09:51:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:22] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2022-05-17 09:51:22] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:22] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6398959734192714674
Running compilation step : cd /tmp/ltsmin6398959734192714674;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1066 ms.
Running link step : cd /tmp/ltsmin6398959734192714674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6398959734192714674;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16955976867256246100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:51:37] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:37] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 09:51:38] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 09:51:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:38] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:51:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:51:38] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2022-05-17 09:51:38] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 09:51:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:51:38] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 09:51:38] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Built C files in :
/tmp/ltsmin10553512618812885180
[2022-05-17 09:51:38] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2022-05-17 09:51:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:38] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2022-05-17 09:51:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:38] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2022-05-17 09:51:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:51:38] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10553512618812885180
Running compilation step : cd /tmp/ltsmin10553512618812885180;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 974 ms.
Running link step : cd /tmp/ltsmin10553512618812885180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10553512618812885180;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16973464465894553612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:51:53] [INFO ] Flatten gal took : 27 ms
[2022-05-17 09:51:53] [INFO ] Flatten gal took : 28 ms
[2022-05-17 09:51:53] [INFO ] Time to serialize gal into /tmp/LTL12277061179296459995.gal : 7 ms
[2022-05-17 09:51:53] [INFO ] Time to serialize properties into /tmp/LTL12494659188849375899.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12277061179296459995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12494659188849375899.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1227706...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((y_0<1)||(P_awaity_2<1))&&((y_0<1)||(P_awaity_3<1)))&&(((y_0<1)||(P_awaity_1<1))&&((y_0<1)||(P_awaity_6<1))))&&((((y_0<1)|...233
Formula 0 simplified : !GF"(((((y_0<1)||(P_awaity_2<1))&&((y_0<1)||(P_awaity_3<1)))&&(((y_0<1)||(P_awaity_1<1))&&((y_0<1)||(P_awaity_6<1))))&&((((y_0<1)||(...227
Detected timeout of ITS tools.
[2022-05-17 09:52:08] [INFO ] Flatten gal took : 26 ms
[2022-05-17 09:52:08] [INFO ] Applying decomposition
[2022-05-17 09:52:08] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12729829354463843212.txt' '-o' '/tmp/graph12729829354463843212.bin' '-w' '/tmp/graph12729829354463843212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12729829354463843212.bin' '-l' '-1' '-v' '-w' '/tmp/graph12729829354463843212.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:52:09] [INFO ] Decomposing Gal with order
[2022-05-17 09:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:52:09] [INFO ] Removed a total of 663 redundant transitions.
[2022-05-17 09:52:09] [INFO ] Flatten gal took : 64 ms
[2022-05-17 09:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 13 ms.
[2022-05-17 09:52:09] [INFO ] Time to serialize gal into /tmp/LTL12801358223815108095.gal : 5 ms
[2022-05-17 09:52:09] [INFO ] Time to serialize properties into /tmp/LTL14169405327761000947.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12801358223815108095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14169405327761000947.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1280135...247
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i10.u24.y_0<1)||(i5.u15.P_awaity_2<1))&&((i10.u24.y_0<1)||(i8.u16.P_awaity_3<1)))&&(((i10.u24.y_0<1)||(i4.u14.P_awaity_1<...339
Formula 0 simplified : !GF"(((((i10.u24.y_0<1)||(i5.u15.P_awaity_2<1))&&((i10.u24.y_0<1)||(i8.u16.P_awaity_3<1)))&&(((i10.u24.y_0<1)||(i4.u14.P_awaity_1<1)...333
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9460514842268354837
[2022-05-17 09:52:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9460514842268354837
Running compilation step : cd /tmp/ltsmin9460514842268354837;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 699 ms.
Running link step : cd /tmp/ltsmin9460514842268354837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9460514842268354837;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-02 finished in 80516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!X((p0 U p1)))) U p2))'
Support contains 50 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:52:39] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:39] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:52:39] [INFO ] Implicit Places using invariants in 151 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 152 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (OR (NOT p2) p1), p1, p1, true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (AND (GEQ s8 1) (GEQ s68 1)) (AND (GEQ s13 1) (GEQ s69 1)) (AND (GEQ s8 1) (GEQ s70 1)) (AND (GEQ s13 1) (GEQ s67 1)) (AND (GEQ s8 1) (GEQ s66...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 5 reset in 3 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-04 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)||X(F(G(X(((!p0 U p2)||p1)))))))))'
Support contains 85 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 15 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:52:39] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:39] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:52:39] [INFO ] Implicit Places using invariants in 114 ms returned []
[2022-05-17 09:52:39] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:39] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:52:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:52:40] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2022-05-17 09:52:40] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 09:52:40] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:40] [INFO ] Computed 65 place invariants in 4 ms
[2022-05-17 09:52:40] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s57 1)) (AND (GEQ s15 1) (GEQ s56 1)) (AND (GEQ s15 1) (GEQ s55 1)) (AND (GEQ s15 1) (GEQ s54 1)) (AND (GEQ s15 1) (GEQ s53 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14811 reset in 627 ms.
Product exploration explored 100000 steps with 14830 reset in 652 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 65 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2022-05-17 09:52:42] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:42] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:52:43] [INFO ] [Real]Absence check using 65 positive place invariants in 26 ms returned sat
[2022-05-17 09:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:43] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-17 09:52:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2022-05-17 09:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:44] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-17 09:52:44] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:52:44] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 380 ms
[2022-05-17 09:52:44] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 28 ms.
[2022-05-17 09:52:45] [INFO ] Added : 161 causal constraints over 33 iterations in 1195 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 85 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:52:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:45] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:52:46] [INFO ] Implicit Places using invariants in 105 ms returned []
[2022-05-17 09:52:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:46] [INFO ] Computed 65 place invariants in 3 ms
[2022-05-17 09:52:46] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:52:46] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2022-05-17 09:52:46] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 09:52:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:46] [INFO ] Computed 65 place invariants in 3 ms
[2022-05-17 09:52:46] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 65 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2022-05-17 09:52:47] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:47] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:52:47] [INFO ] [Real]Absence check using 65 positive place invariants in 28 ms returned sat
[2022-05-17 09:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:48] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-17 09:52:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2022-05-17 09:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:48] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-17 09:52:48] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:52:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-17 09:52:49] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-05-17 09:52:49] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-17 09:52:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2022-05-17 09:52:49] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2022-05-17 09:52:50] [INFO ] Added : 161 causal constraints over 33 iterations in 1126 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14760 reset in 650 ms.
Product exploration explored 100000 steps with 14811 reset in 659 ms.
Built C files in :
/tmp/ltsmin10098276274548899604
[2022-05-17 09:52:51] [INFO ] Computing symmetric may disable matrix : 462 transitions.
[2022-05-17 09:52:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:52:51] [INFO ] Computing symmetric may enable matrix : 462 transitions.
[2022-05-17 09:52:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:52:51] [INFO ] Computing Do-Not-Accords matrix : 462 transitions.
[2022-05-17 09:52:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:52:51] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10098276274548899604
Running compilation step : cd /tmp/ltsmin10098276274548899604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1030 ms.
Running link step : cd /tmp/ltsmin10098276274548899604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10098276274548899604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15384115442747606438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 85 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:53:06] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:53:06] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:53:06] [INFO ] Implicit Places using invariants in 138 ms returned []
[2022-05-17 09:53:06] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:53:06] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:53:07] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:53:07] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2022-05-17 09:53:07] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 09:53:07] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:53:07] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:53:07] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin5968392527401293812
[2022-05-17 09:53:07] [INFO ] Computing symmetric may disable matrix : 462 transitions.
[2022-05-17 09:53:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:53:07] [INFO ] Computing symmetric may enable matrix : 462 transitions.
[2022-05-17 09:53:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:53:07] [INFO ] Computing Do-Not-Accords matrix : 462 transitions.
[2022-05-17 09:53:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:53:07] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5968392527401293812
Running compilation step : cd /tmp/ltsmin5968392527401293812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 995 ms.
Running link step : cd /tmp/ltsmin5968392527401293812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5968392527401293812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3357664869143852447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:53:22] [INFO ] Flatten gal took : 22 ms
[2022-05-17 09:53:22] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:53:22] [INFO ] Time to serialize gal into /tmp/LTL1797530596315227974.gal : 3 ms
[2022-05-17 09:53:22] [INFO ] Time to serialize properties into /tmp/LTL15724429374753707080.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1797530596315227974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15724429374753707080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1797530...267
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(((((y_0>=1)&&(P_ify0_4_7>=1))||((y_0>=1)&&(P_ify0_4_6>=1)))||(((y_0>=1)&&(P_ify0_4_5>=1))||((y_0>=1)&&(P_ify0_4_4>=1))))||...3618
Formula 0 simplified : !GF(X"(((((y_0>=1)&&(P_ify0_4_7>=1))||((y_0>=1)&&(P_ify0_4_6>=1)))||(((y_0>=1)&&(P_ify0_4_5>=1))||((y_0>=1)&&(P_ify0_4_4>=1))))||(((...3589
Detected timeout of ITS tools.
[2022-05-17 09:53:37] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:53:37] [INFO ] Applying decomposition
[2022-05-17 09:53:37] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3112963758010858571.txt' '-o' '/tmp/graph3112963758010858571.bin' '-w' '/tmp/graph3112963758010858571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3112963758010858571.bin' '-l' '-1' '-v' '-w' '/tmp/graph3112963758010858571.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:53:37] [INFO ] Decomposing Gal with order
[2022-05-17 09:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:53:37] [INFO ] Removed a total of 721 redundant transitions.
[2022-05-17 09:53:37] [INFO ] Flatten gal took : 42 ms
[2022-05-17 09:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 14 ms.
[2022-05-17 09:53:37] [INFO ] Time to serialize gal into /tmp/LTL18412761085905165505.gal : 4 ms
[2022-05-17 09:53:37] [INFO ] Time to serialize properties into /tmp/LTL13870335530930866710.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18412761085905165505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13870335530930866710.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1841276...247
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(((((i8.u82.y_0>=1)&&(i7.i0.u10.P_ify0_4_7>=1))||((i8.u82.y_0>=1)&&(i2.i0.u13.P_ify0_4_6>=1)))||(((i8.u82.y_0>=1)&&(i6.i0.u...5444
Formula 0 simplified : !GF(X"(((((i8.u82.y_0>=1)&&(i7.i0.u10.P_ify0_4_7>=1))||((i8.u82.y_0>=1)&&(i2.i0.u13.P_ify0_4_6>=1)))||(((i8.u82.y_0>=1)&&(i6.i0.u12....5415
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9878780011148285691
[2022-05-17 09:53:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9878780011148285691
Running compilation step : cd /tmp/ltsmin9878780011148285691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin9878780011148285691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9878780011148285691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))||X(<>([](X(((!(LTLAPp0==true) U (LTLAPp2==true))||(LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-05 finished in 88258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(((p1 U G(p2))||p0)))))'
Support contains 37 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 12 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2022-05-17 09:54:08] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2022-05-17 09:54:08] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:54:08] [INFO ] Implicit Places using invariants in 128 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 129 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 11 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2022-05-17 09:54:08] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:08] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:08] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-17 09:54:08] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:08] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:08] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions, in 2 iterations. Remains : 198/219 places, 448/462 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s15 1) (GEQ s57 1)) (AND (GEQ s15 1) (GEQ s56 1)) (AND (GEQ s15 1) (GEQ s55 1)) (AND (GEQ s15 1) (GEQ s54 1)) (AND (GEQ s15 1) (GEQ s53 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 65 reset in 470 ms.
Product exploration explored 100000 steps with 71 reset in 584 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:10] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:10] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:10] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:54:10] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2022-05-17 09:54:10] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:10] [INFO ] After 162ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:11] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-17 09:54:11] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 829867 steps, run timeout after 3004 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 829867 steps, saw 364226 distinct states, run finished after 3005 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:14] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:14] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:14] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:54:14] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:14] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2022-05-17 09:54:14] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:15] [INFO ] After 157ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:15] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-05-17 09:54:15] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:54:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:15] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:15] [INFO ] Implicit Places using invariants in 129 ms returned []
[2022-05-17 09:54:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:15] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:15] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2022-05-17 09:54:15] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 09:54:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:15] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:16] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 198 transition count 322
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 198 transition count 273
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 107 transition count 273
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 100 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 93 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 93 transition count 252
Applied a total of 294 rules in 14 ms. Remains 93 /198 variables (removed 105) and now considering 252/448 (removed 196) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 252 rows 93 cols
[2022-05-17 09:54:16] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 09:54:16] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:16] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:16] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:16] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-17 09:54:16] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:16] [INFO ] Flatten gal took : 11 ms
[2022-05-17 09:54:16] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:54:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16620413606538375269.gal : 2 ms
[2022-05-17 09:54:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2369412698229711069.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13944974060208008562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16620413606538375269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2369412698229711069.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2369412698229711069.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 464
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :464 after 864
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,19188,0.082142,5488,2,559,12,6312,6,0,626,2916,0
Total reachable state count : 19188

Verifying 1 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,48,0.133425,5716,2,207,12,6312,7,0,782,2916,0
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:54:17] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:17] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:17] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-17 09:54:17] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:17] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:54:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:17] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2022-05-17 09:54:17] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 09:54:17] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:17] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:18] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:18] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:18] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:18] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:54:18] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:54:19] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:19] [INFO ] After 169ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:19] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2022-05-17 09:54:19] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 883442 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 883442 steps, saw 385149 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:22] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:22] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:54:22] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2022-05-17 09:54:23] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:23] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2022-05-17 09:54:23] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:23] [INFO ] After 161ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:23] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2022-05-17 09:54:23] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:54:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:23] [INFO ] Computed 58 place invariants in 9 ms
[2022-05-17 09:54:24] [INFO ] Implicit Places using invariants in 193 ms returned []
[2022-05-17 09:54:24] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:24] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:24] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2022-05-17 09:54:24] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:54:24] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:24] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:54:24] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 198 transition count 322
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 198 transition count 273
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 107 transition count 273
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 100 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 93 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 93 transition count 252
Applied a total of 294 rules in 52 ms. Remains 93 /198 variables (removed 105) and now considering 252/448 (removed 196) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 252 rows 93 cols
[2022-05-17 09:54:24] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 09:54:24] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:24] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:25] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:25] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-05-17 09:54:25] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:25] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:54:25] [INFO ] Flatten gal took : 13 ms
[2022-05-17 09:54:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15718371754452451115.gal : 13 ms
[2022-05-17 09:54:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13433270779291298331.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14352983160193790758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15718371754452451115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13433270779291298331.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13433270779291298331.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 464
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :464 after 864
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,19188,0.135571,5644,2,559,12,6363,6,0,626,2920,0
Total reachable state count : 19188

Verifying 1 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,48,0.218906,5860,2,207,12,6363,7,0,782,2920,0
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 69 reset in 501 ms.
Product exploration explored 100000 steps with 70 reset in 485 ms.
Built C files in :
/tmp/ltsmin15185614274359126799
[2022-05-17 09:54:27] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2022-05-17 09:54:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:27] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2022-05-17 09:54:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:27] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2022-05-17 09:54:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:27] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15185614274359126799
Running compilation step : cd /tmp/ltsmin15185614274359126799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1022 ms.
Running link step : cd /tmp/ltsmin15185614274359126799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15185614274359126799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3561061721215218855.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:54:42] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:42] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 09:54:42] [INFO ] Implicit Places using invariants in 215 ms returned []
[2022-05-17 09:54:42] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:42] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:54:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:54:42] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-17 09:54:42] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:54:42] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:54:42] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:54:43] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Built C files in :
/tmp/ltsmin8327431907112858119
[2022-05-17 09:54:43] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2022-05-17 09:54:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:43] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2022-05-17 09:54:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:43] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2022-05-17 09:54:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:54:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8327431907112858119
Running compilation step : cd /tmp/ltsmin8327431907112858119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 991 ms.
Running link step : cd /tmp/ltsmin8327431907112858119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8327431907112858119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1453128960836036730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:54:58] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:54:58] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:54:58] [INFO ] Time to serialize gal into /tmp/LTL10463353530160087690.gal : 2 ms
[2022-05-17 09:54:58] [INFO ] Time to serialize properties into /tmp/LTL6145213557102217413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10463353530160087690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6145213557102217413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1046335...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F(((("((((((((x_1>=1)&&(P_ifxi_10_4>=1))||((x_6>=1)&&(P_ifxi_10_5>=1)))||(((x_1>=1)&&(P_ifxi_10_6>=1))||((x_6>=1)&&(P_ifxi_10_3...4870
Formula 0 simplified : !GXF("((((((((x_1<1)||(P_ifxi_10_4<1))&&((x_6<1)||(P_ifxi_10_5<1)))&&(((x_1<1)||(P_ifxi_10_6<1))&&((x_6<1)||(P_ifxi_10_3<1))))&&((((...4856
Detected timeout of ITS tools.
[2022-05-17 09:55:13] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:55:13] [INFO ] Applying decomposition
[2022-05-17 09:55:13] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12897894967486560696.txt' '-o' '/tmp/graph12897894967486560696.bin' '-w' '/tmp/graph12897894967486560696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12897894967486560696.bin' '-l' '-1' '-v' '-w' '/tmp/graph12897894967486560696.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:55:13] [INFO ] Decomposing Gal with order
[2022-05-17 09:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:55:13] [INFO ] Removed a total of 675 redundant transitions.
[2022-05-17 09:55:13] [INFO ] Flatten gal took : 29 ms
[2022-05-17 09:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 6 ms.
[2022-05-17 09:55:13] [INFO ] Time to serialize gal into /tmp/LTL459099363577635269.gal : 16 ms
[2022-05-17 09:55:13] [INFO ] Time to serialize properties into /tmp/LTL1033824678782233232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL459099363577635269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1033824678782233232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4590993...244
Read 1 LTL properties
Checking formula 0 : !((G(X(F(((("((((((((i1.u5.x_1>=1)&&(i11.u13.P_ifxi_10_4>=1))||((i7.u4.x_6>=1)&&(u9.P_ifxi_10_5>=1)))||(((i1.u5.x_1>=1)&&(u14.P_ifxi_1...6839
Formula 0 simplified : !GXF("((((((((i1.u5.x_1<1)||(i11.u13.P_ifxi_10_4<1))&&((i7.u4.x_6<1)||(u9.P_ifxi_10_5<1)))&&(((i1.u5.x_1<1)||(u14.P_ifxi_10_6<1))&&(...6825
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5615451388591170419
[2022-05-17 09:55:28] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5615451388591170419
Running compilation step : cd /tmp/ltsmin5615451388591170419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 735 ms.
Running link step : cd /tmp/ltsmin5615451388591170419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5615451388591170419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((((LTLAPp1==true) U []((LTLAPp2==true)))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-07 finished in 95565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((X(p2)||p1))) U X((X(p3)&&p3))))'
Support contains 29 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:43] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:43] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:55:43] [INFO ] Implicit Places using invariants in 134 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 136 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 567 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(NOT p3), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=2 dest: 9}, { cond=(AND p0 p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 10}, { cond=p3, acceptance={0} source=3 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 12}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 13}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(NOT p3), acceptance={} source=10 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(NOT p3), acceptance={0} source=11 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=12 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 7}, { cond=(NOT p0), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=13 dest: 12}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=0, aps=[p1:(OR (AND (GEQ s16 1) (GEQ s184 1)) (AND (GEQ s19 1) (GEQ s187 1)) (AND (GEQ s20 1) (GEQ s188 1)) (AND (GEQ s17 1) (GEQ s185 1)) (AND (GEQ s18 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-08 finished in 762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0)) U G(X(G(!p2)))))'
Support contains 85 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:44] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:55:44] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-17 09:55:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:44] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:55:44] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:55:44] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-05-17 09:55:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:44] [INFO ] Computed 65 place invariants in 3 ms
[2022-05-17 09:55:44] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 186 ms :[p2, p2, true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p2, (AND p2 (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND p0 p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s33 1) (GEQ s98 1) (GEQ s136 1)) (AND (GEQ s35 1) (GEQ s106 1) (GEQ s137 1)) (AND (GEQ s29 1) (GEQ s103 1) (GEQ s137 1)) (AND (GEQ s23 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-09 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(p0)&&p1))))'
Support contains 35 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:45] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:55:45] [INFO ] Implicit Places using invariants in 150 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s56 1)) (AND (GEQ s21 1) (GEQ s51 1)) (AND (GEQ s16 1) (GEQ s54 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s16 1) (GEQ s56 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-10 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:45] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:55:45] [INFO ] Implicit Places using invariants in 132 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 133 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s79 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (AND (GEQ s15 1) (GEQ s186 1)) (AND (GEQ s20 1) (GEQ s187 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-11 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 15 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:45] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:55:45] [INFO ] Implicit Places using invariants in 135 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s22 1) (GEQ s60 1)) (AND (GEQ s22 1) (GEQ s58 1)) (AND (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s17 1) (GEQ s61 1)) (AND (GEQ s22 1) (GEQ s62 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11177 reset in 346 ms.
Product exploration explored 100000 steps with 11178 reset in 380 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2022-05-17 09:55:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:46] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:47] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2022-05-17 09:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:55:47] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-17 09:55:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:55:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2022-05-17 09:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:55:47] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-17 09:55:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:55:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2022-05-17 09:55:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 09:55:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 09:55:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-17 09:55:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-17 09:55:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 217 ms
[2022-05-17 09:55:47] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 24 ms.
[2022-05-17 09:55:49] [INFO ] Added : 201 causal constraints over 41 iterations in 1350 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 15 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:49] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:49] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:49] [INFO ] Implicit Places using invariants in 115 ms returned []
[2022-05-17 09:55:49] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:49] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:55:49] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-17 09:55:49] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:49] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:49] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2022-05-17 09:55:50] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:50] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:55:50] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2022-05-17 09:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:55:50] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-17 09:55:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:55:51] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2022-05-17 09:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:55:51] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-05-17 09:55:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:55:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2022-05-17 09:55:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-17 09:55:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-17 09:55:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-17 09:55:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-17 09:55:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2022-05-17 09:55:51] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 21 ms.
[2022-05-17 09:55:52] [INFO ] Added : 201 causal constraints over 41 iterations in 1435 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11108 reset in 347 ms.
Product exploration explored 100000 steps with 11183 reset in 367 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 15 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 22 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:53] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:55:53] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2022-05-17 09:55:53] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:54] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/212 places, 462/462 transitions.
Product exploration explored 100000 steps with 11205 reset in 608 ms.
Product exploration explored 100000 steps with 11195 reset in 633 ms.
Built C files in :
/tmp/ltsmin2092759949498116321
[2022-05-17 09:55:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2092759949498116321
Running compilation step : cd /tmp/ltsmin2092759949498116321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 706 ms.
Running link step : cd /tmp/ltsmin2092759949498116321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2092759949498116321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14587994765000044106.hoa' '--buchi-type=spotba'
LTSmin run took 900 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-12 finished in 11508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U X(p0))&&(!p1 U p2)))'
Support contains 92 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:55:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:57] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-17 09:55:57] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-17 09:55:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:57] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:55:57] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:55:57] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2022-05-17 09:55:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:55:57] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:55:57] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s24 1) (GEQ s212 1)) (AND (GEQ s34 1) (GEQ s217 1)) (AND (GEQ s26 1) (GEQ s213 1)) (AND (GEQ s32 1) (GEQ s216 1)) (AND (GEQ s28 1) (GEQ s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-13 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 9 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2022-05-17 09:55:57] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2022-05-17 09:55:57] [INFO ] Computed 65 place invariants in 2 ms
[2022-05-17 09:55:57] [INFO ] Implicit Places using invariants in 132 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 133 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 205/219 places, 455/462 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s16 1) (LT s177 1)) (OR (LT s19 1) (LT s180 1)) (OR (LT s20 1) (LT s181 1)) (OR (LT s17 1) (LT s178 1)) (OR (LT s18 1) (LT s179 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1076 reset in 241 ms.
Product exploration explored 100000 steps with 1076 reset in 276 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2022-05-17 09:55:58] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:55:58] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2022-05-17 09:55:58] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:55:58] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:55:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:55:59] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2022-05-17 09:55:59] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 09:55:59] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:55:59] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:55:59] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1087 reset in 268 ms.
Product exploration explored 100000 steps with 1099 reset in 261 ms.
Built C files in :
/tmp/ltsmin15233892113339030773
[2022-05-17 09:56:00] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2022-05-17 09:56:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:00] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2022-05-17 09:56:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:00] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2022-05-17 09:56:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15233892113339030773
Running compilation step : cd /tmp/ltsmin15233892113339030773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 960 ms.
Running link step : cd /tmp/ltsmin15233892113339030773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15233892113339030773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13197155442427157483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2022-05-17 09:56:15] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:56:15] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:56:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-17 09:56:15] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:56:15] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 09:56:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:56:16] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2022-05-17 09:56:16] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 09:56:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2022-05-17 09:56:16] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:56:16] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Built C files in :
/tmp/ltsmin6911226049642520706
[2022-05-17 09:56:16] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2022-05-17 09:56:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:16] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2022-05-17 09:56:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:16] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2022-05-17 09:56:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:56:16] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6911226049642520706
Running compilation step : cd /tmp/ltsmin6911226049642520706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 965 ms.
Running link step : cd /tmp/ltsmin6911226049642520706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6911226049642520706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5083260181188594680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:56:31] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:56:31] [INFO ] Flatten gal took : 13 ms
[2022-05-17 09:56:31] [INFO ] Time to serialize gal into /tmp/LTL896289824202799521.gal : 3 ms
[2022-05-17 09:56:31] [INFO ] Time to serialize properties into /tmp/LTL11049714034541155132.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL896289824202799521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11049714034541155132.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8962898...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(((((y_1<1)||(P_ifyi_15_1<1))&&((y_4<1)||(P_ifyi_15_4<1)))&&(((y_5<1)||(P_ifyi_15_5<1))&&((y_2<1)||(P_ifyi_15_2<1))))&&((((y...243
Formula 0 simplified : !XGF"(((((y_1<1)||(P_ifyi_15_1<1))&&((y_4<1)||(P_ifyi_15_4<1)))&&(((y_5<1)||(P_ifyi_15_5<1))&&((y_2<1)||(P_ifyi_15_2<1))))&&((((y_3<...235
Detected timeout of ITS tools.
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 23 ms
[2022-05-17 09:56:46] [INFO ] Applying decomposition
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14078790660061979492.txt' '-o' '/tmp/graph14078790660061979492.bin' '-w' '/tmp/graph14078790660061979492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14078790660061979492.bin' '-l' '-1' '-v' '-w' '/tmp/graph14078790660061979492.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:56:46] [INFO ] Decomposing Gal with order
[2022-05-17 09:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:56:46] [INFO ] Removed a total of 755 redundant transitions.
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 48 ms
[2022-05-17 09:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 23 ms.
[2022-05-17 09:56:46] [INFO ] Time to serialize gal into /tmp/LTL5472740742285087646.gal : 3 ms
[2022-05-17 09:56:46] [INFO ] Time to serialize properties into /tmp/LTL4944863993146671175.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5472740742285087646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4944863993146671175.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5472740...245
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(((((i11.u15.y_1<1)||(i0.u70.P_ifyi_15_1<1))&&((u17.y_4<1)||(i3.u74.P_ifyi_15_4<1)))&&(((i11.u18.y_5<1)||(i4.u75.P_ifyi_15_5...328
Formula 0 simplified : !XGF"(((((i11.u15.y_1<1)||(i0.u70.P_ifyi_15_1<1))&&((u17.y_4<1)||(i3.u74.P_ifyi_15_4<1)))&&(((i11.u18.y_5<1)||(i4.u75.P_ifyi_15_5<1)...320
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15733277515017915776
[2022-05-17 09:57:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15733277515017915776
Running compilation step : cd /tmp/ltsmin15733277515017915776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 670 ms.
Running link step : cd /tmp/ltsmin15733277515017915776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15733277515017915776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-14 finished in 79109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(p0)))))'
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2022-05-17 09:57:16] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:57:16] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-17 09:57:16] [INFO ] Implicit Places using invariants in 180 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 181 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s79 1) (LT s81 1) (LT s80 1) (LT s83 1) (LT s82 1) (LT s85 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-15 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)||X(F(G(X(((!p0 U p2)||p1)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(((p1 U G(p2))||p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
[2022-05-17 09:57:17] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7197410533129172361
[2022-05-17 09:57:17] [INFO ] Computing symmetric may disable matrix : 462 transitions.
[2022-05-17 09:57:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:57:17] [INFO ] Computing symmetric may enable matrix : 462 transitions.
[2022-05-17 09:57:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:57:17] [INFO ] Applying decomposition
[2022-05-17 09:57:17] [INFO ] Computing Do-Not-Accords matrix : 462 transitions.
[2022-05-17 09:57:17] [INFO ] Flatten gal took : 31 ms
[2022-05-17 09:57:17] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:57:17] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7197410533129172361
Running compilation step : cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15602307935237742267.txt' '-o' '/tmp/graph15602307935237742267.bin' '-w' '/tmp/graph15602307935237742267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15602307935237742267.bin' '-l' '-1' '-v' '-w' '/tmp/graph15602307935237742267.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:57:17] [INFO ] Decomposing Gal with order
[2022-05-17 09:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:57:17] [INFO ] Removed a total of 721 redundant transitions.
[2022-05-17 09:57:17] [INFO ] Flatten gal took : 58 ms
[2022-05-17 09:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2022-05-17 09:57:17] [INFO ] Time to serialize gal into /tmp/LTLFireability7119562459707430169.gal : 23 ms
[2022-05-17 09:57:17] [INFO ] Time to serialize properties into /tmp/LTLFireability3084472062983057497.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7119562459707430169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3084472062983057497.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G(F("(((((i7.u78.y_0<1)||(i0.u71.P_awaity_2<1))&&((i7.u78.y_0<1)||(i2.i0.u72.P_awaity_3<1)))&&(((i7.u78.y_0<1)||(i5.i0.u70.P_awaity...349
Formula 0 simplified : !GF"(((((i7.u78.y_0<1)||(i0.u71.P_awaity_2<1))&&((i7.u78.y_0<1)||(i2.i0.u72.P_awaity_3<1)))&&(((i7.u78.y_0<1)||(i5.i0.u70.P_awaity_1...343
Compilation finished in 1204 ms.
Running link step : cd /tmp/ltsmin7197410533129172361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp1==true))||X(<>([](X(((!(LTLAPp1==true) U (LTLAPp3==true))||(LTLAPp2==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 10:19:19] [INFO ] Applying decomposition
[2022-05-17 10:19:19] [INFO ] Flatten gal took : 48 ms
[2022-05-17 10:19:19] [INFO ] Decomposing Gal with order
[2022-05-17 10:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:19:19] [INFO ] Removed a total of 723 redundant transitions.
[2022-05-17 10:19:19] [INFO ] Flatten gal took : 119 ms
[2022-05-17 10:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 19 ms.
[2022-05-17 10:19:19] [INFO ] Time to serialize gal into /tmp/LTLFireability346515828074057726.gal : 2 ms
[2022-05-17 10:19:19] [INFO ] Time to serialize properties into /tmp/LTLFireability6268333214931362730.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability346515828074057726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6268333214931362730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 4 LTL properties
Checking formula 0 : !((G(F("(((((pid0.y_0<1)||(pid2.P_awaity_2<1))&&((pid0.y_0<1)||(pid3.P_awaity_3<1)))&&(((pid0.y_0<1)||(pid1.P_awaity_1<1))&&((pid0.y_0...303
Formula 0 simplified : !GF"(((((pid0.y_0<1)||(pid2.P_awaity_2<1))&&((pid0.y_0<1)||(pid3.P_awaity_3<1)))&&(((pid0.y_0<1)||(pid1.P_awaity_1<1))&&((pid0.y_0<1...297
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp1==true))||X(<>([](X(((!(LTLAPp1==true) U (LTLAPp3==true))||(LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((((LTLAPp5==true) U []((LTLAPp1==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: LTL layer: formula: [](X(<>((((LTLAPp5==true) U []((LTLAPp1==true)))||(LTLAPp4==true)))))
pins2lts-mc-linux64( 0/ 8), 0.008: "[](X(<>((((LTLAPp5==true) U []((LTLAPp1==true)))||(LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 3 states
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: There are 470 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.073: State length is 220, there are 468 groups
pins2lts-mc-linux64( 0/ 8), 0.073: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.073: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.073: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.073: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.230: [Blue] ~120 levels ~960 states ~5504 transitions
pins2lts-mc-linux64( 6/ 8), 0.269: [Blue] ~141 levels ~1920 states ~8000 transitions
pins2lts-mc-linux64( 6/ 8), 0.377: [Blue] ~240 levels ~3840 states ~16288 transitions
pins2lts-mc-linux64( 6/ 8), 0.544: [Blue] ~360 levels ~7680 states ~27784 transitions
pins2lts-mc-linux64( 4/ 8), 1.003: [Blue] ~177 levels ~15360 states ~31464 transitions
pins2lts-mc-linux64( 4/ 8), 2.488: [Blue] ~573 levels ~30720 states ~74768 transitions
pins2lts-mc-linux64( 5/ 8), 4.273: [Blue] ~1296 levels ~61440 states ~281400 transitions
pins2lts-mc-linux64( 5/ 8), 5.948: [Blue] ~1337 levels ~122880 states ~573976 transitions
pins2lts-mc-linux64( 3/ 8), 10.662: [Blue] ~4892 levels ~245760 states ~1247984 transitions
pins2lts-mc-linux64( 5/ 8), 17.809: [Blue] ~4343 levels ~491520 states ~2394232 transitions
pins2lts-mc-linux64( 5/ 8), 32.039: [Blue] ~6870 levels ~983040 states ~4795488 transitions
pins2lts-mc-linux64( 5/ 8), 43.136: [Blue] ~15008 levels ~1966080 states ~10025768 transitions
pins2lts-mc-linux64( 5/ 8), 60.177: [Blue] ~21093 levels ~3932160 states ~18253568 transitions
pins2lts-mc-linux64( 5/ 8), 94.636: [Blue] ~33164 levels ~7864320 states ~32721360 transitions
pins2lts-mc-linux64( 4/ 8), 182.550: [Blue] ~121473 levels ~15728640 states ~51409160 transitions
pins2lts-mc-linux64( 5/ 8), 405.345: [Blue] ~162155 levels ~31457280 states ~153992744 transitions
pins2lts-mc-linux64( 6/ 8), 501.605: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 501.661:
pins2lts-mc-linux64( 0/ 8), 501.661: Explored 40506362 states 160924443 transitions, fanout: 3.973
pins2lts-mc-linux64( 0/ 8), 501.661: Total exploration time 501.570 sec (501.500 sec minimum, 501.529 sec on average)
pins2lts-mc-linux64( 0/ 8), 501.661: States per second: 80759, Transitions per second: 320841
pins2lts-mc-linux64( 0/ 8), 501.661:
pins2lts-mc-linux64( 0/ 8), 501.661: State space has 42941928 states, 32517556 are accepting
pins2lts-mc-linux64( 0/ 8), 501.661: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 501.661: blue states: 40506362 (94.33%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 501.661: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 501.661: all-red states: 32517556 (75.72%), bogus 372 (0.00%)
pins2lts-mc-linux64( 0/ 8), 501.661:
pins2lts-mc-linux64( 0/ 8), 501.661: Total memory used for local state coloring: 11.9MB
pins2lts-mc-linux64( 0/ 8), 501.661:
pins2lts-mc-linux64( 0/ 8), 501.661: Queue width: 8B, total height: 778893, memory: 5.94MB
pins2lts-mc-linux64( 0/ 8), 501.661: Tree memory: 583.6MB, 14.3 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 501.661: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 501.661: Stored 464 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 501.661: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 501.661: Est. total memory use: 589.6MB (~1029.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((((LTLAPp5==true) U []((LTLAPp1==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7197410533129172361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((((LTLAPp5==true) U []((LTLAPp1==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 10:41:20] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:41:20] [INFO ] Input system was already deterministic with 462 transitions.
[2022-05-17 10:41:20] [INFO ] Transformed 219 places.
[2022-05-17 10:41:20] [INFO ] Transformed 462 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 10:41:20] [INFO ] Time to serialize gal into /tmp/LTLFireability15825701921219588879.gal : 2 ms
[2022-05-17 10:41:20] [INFO ] Time to serialize properties into /tmp/LTLFireability3155345191402544108.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15825701921219588879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3155345191402544108.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((y_0<1)||(P_awaity_2<1))&&((y_0<1)||(P_awaity_3<1)))&&(((y_0<1)||(P_awaity_1<1))&&((y_0<1)||(P_awaity_6<1))))&&((((y_0<1)|...233
Formula 0 simplified : !GF"(((((y_0<1)||(P_awaity_2<1))&&((y_0<1)||(P_awaity_3<1)))&&(((y_0<1)||(P_awaity_1<1))&&((y_0<1)||(P_awaity_6<1))))&&((((y_0<1)||(...227

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LamportFastMutEx-COL-7"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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