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-165271821300764.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 MultiCrashLeafsetExtension-PT-S24C09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 16K Apr 29 16:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 29 16:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 9 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 16M 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 MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652856620858

Running Version 202205111006
[2022-05-18 06:50:21] [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-18 06:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 06:50:22] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2022-05-18 06:50:22] [INFO ] Transformed 16538 places.
[2022-05-18 06:50:23] [INFO ] Transformed 24169 transitions.
[2022-05-18 06:50:23] [INFO ] Parsed PT model containing 16538 places and 24169 transitions in 1011 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 16538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16538/16538 places, 24169/24169 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 16492 transition count 24169
Applied a total of 46 rules in 649 ms. Remains 16492 /16538 variables (removed 46) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:50:24] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:50:26] [INFO ] Computed 1145 place invariants in 2135 ms
[2022-05-18 06:50:27] [INFO ] Implicit Places using invariants in 3602 ms returned []
Implicit Place search using SMT only with invariants took 3634 ms to find 0 implicit places.
[2022-05-18 06:50:27] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:50:29] [INFO ] Computed 1145 place invariants in 1921 ms
[2022-05-18 06:50:31] [INFO ] Dead Transitions using invariants and state equation in 3351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16492/16538 places, 24169/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16538 places, 24169/24169 transitions.
Support contains 44 out of 16492 places after structural reductions.
[2022-05-18 06:50:32] [INFO ] Flatten gal took : 967 ms
[2022-05-18 06:50:33] [INFO ] Flatten gal took : 773 ms
[2022-05-18 06:50:34] [INFO ] Input system was already deterministic with 24169 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2022-05-18 06:50:36] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:50:38] [INFO ] Computed 1145 place invariants in 1918 ms
[2022-05-18 06:50:44] [INFO ] [Real]Absence check using 47 positive place invariants in 516 ms returned sat
[2022-05-18 06:50:45] [INFO ] [Real]Absence check using 47 positive and 1098 generalized place invariants in 588 ms returned sat
[2022-05-18 06:51:03] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5350 transitions
Trivial Post-agglo rules discarded 5350 transitions
Performed 5350 trivial Post agglomeration. Transition count delta: 5350
Iterating post reduction 0 with 5350 rules applied. Total rules applied 5350 place count 16492 transition count 18819
Reduce places removed 5350 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 5398 rules applied. Total rules applied 10748 place count 11142 transition count 18771
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 10796 place count 11094 transition count 18771
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 10796 place count 11094 transition count 18325
Deduced a syphon composed of 446 places in 16 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 11688 place count 10648 transition count 18325
Discarding 4944 places :
Symmetric choice reduction at 3 with 4944 rule applications. Total rules 16632 place count 5704 transition count 13381
Iterating global reduction 3 with 4944 rules applied. Total rules applied 21576 place count 5704 transition count 13381
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 21576 place count 5704 transition count 13368
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 21602 place count 5691 transition count 13368
Discarding 539 places :
Symmetric choice reduction at 3 with 539 rule applications. Total rules 22141 place count 5152 transition count 8517
Iterating global reduction 3 with 539 rules applied. Total rules applied 22680 place count 5152 transition count 8517
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 22726 place count 5129 transition count 8494
Free-agglomeration rule (complex) applied 323 times.
Iterating global reduction 3 with 323 rules applied. Total rules applied 23049 place count 5129 transition count 12395
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 3 with 323 rules applied. Total rules applied 23372 place count 4806 transition count 12395
Partial Free-agglomeration rule applied 121 times.
Drop transitions removed 121 transitions
Iterating global reduction 4 with 121 rules applied. Total rules applied 23493 place count 4806 transition count 12395
Applied a total of 23493 rules in 5286 ms. Remains 4806 /16492 variables (removed 11686) and now considering 12395/24169 (removed 11774) transitions.
Finished structural reductions, in 1 iterations. Remains : 4806/16492 places, 12395/24169 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2022-05-18 06:51:09] [INFO ] Flow matrix only has 11527 transitions (discarded 868 similar events)
// Phase 1: matrix 11527 rows 4806 cols
[2022-05-18 06:51:09] [INFO ] Computed 1145 place invariants in 294 ms
[2022-05-18 06:51:11] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 06:51:11] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 259 ms returned sat
[2022-05-18 06:51:26] [INFO ] After 13279ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:14
[2022-05-18 06:51:26] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 06:51:28] [INFO ] After 2420ms SMT Verify possible using 7314 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-18 06:51:28] [INFO ] After 18872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-18 06:51:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2022-05-18 06:51:30] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 281 ms returned sat
[2022-05-18 06:51:45] [INFO ] After 13436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-18 06:51:53] [INFO ] After 8495ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-18 06:51:53] [INFO ] After 8497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 06:51:53] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 244 ms.
Support contains 30 out of 4806 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4806/4806 places, 12395/12395 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4806 transition count 12394
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4805 transition count 12394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4804 transition count 12393
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4804 transition count 12393
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4804 transition count 12392
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4803 transition count 12392
Applied a total of 6 rules in 1032 ms. Remains 4803 /4806 variables (removed 3) and now considering 12392/12395 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4806 places, 12392/12395 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 726 ms. (steps per millisecond=13 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 21468 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{8=1, 13=1}
Probabilistic random walk after 21468 steps, saw 9971 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :2
Running SMT prover for 15 properties.
[2022-05-18 06:51:58] [INFO ] Flow matrix only has 11524 transitions (discarded 868 similar events)
// Phase 1: matrix 11524 rows 4803 cols
[2022-05-18 06:51:59] [INFO ] Computed 1145 place invariants in 280 ms
[2022-05-18 06:52:00] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2022-05-18 06:52:00] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 314 ms returned sat
[2022-05-18 06:52:11] [INFO ] After 9453ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2022-05-18 06:52:11] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 06:52:13] [INFO ] After 2282ms SMT Verify possible using 7314 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-18 06:52:13] [INFO ] After 14795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-18 06:52:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2022-05-18 06:52:15] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 290 ms returned sat
[2022-05-18 06:52:28] [INFO ] After 12130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-18 06:52:38] [INFO ] After 10069ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-18 06:52:38] [INFO ] After 10072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 06:52:39] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 62 ms.
Support contains 27 out of 4803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 12392/12392 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4803 transition count 12391
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4802 transition count 12391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4801 transition count 12390
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4801 transition count 12390
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 4801 transition count 12389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 4800 transition count 12389
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 4800 transition count 12389
Applied a total of 7 rules in 2278 ms. Remains 4800 /4803 variables (removed 3) and now considering 12389/12392 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4800/4803 places, 12389/12392 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p1)&&p0))))'
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 360 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:52:41] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:52:43] [INFO ] Computed 1145 place invariants in 1882 ms
[2022-05-18 06:52:45] [INFO ] Implicit Places using invariants in 3332 ms returned []
Implicit Place search using SMT only with invariants took 3336 ms to find 0 implicit places.
[2022-05-18 06:52:45] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:52:47] [INFO ] Computed 1145 place invariants in 1795 ms
[2022-05-18 06:52:48] [INFO ] Dead Transitions using invariants and state equation in 3246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2794 1) (GEQ s2975 1)), p1:(AND (GEQ s2794 1) (GEQ s2975 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 13 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-00 finished in 7342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(!p0) U p1))||(G(p0) U p2)))))'
Support contains 6 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 418 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:52:49] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:52:51] [INFO ] Computed 1145 place invariants in 1742 ms
[2022-05-18 06:52:52] [INFO ] Implicit Places using invariants in 3223 ms returned []
Implicit Place search using SMT only with invariants took 3225 ms to find 0 implicit places.
[2022-05-18 06:52:52] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:52:54] [INFO ] Computed 1145 place invariants in 1769 ms
[2022-05-18 06:52:55] [INFO ] Dead Transitions using invariants and state equation in 3108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (GEQ s812 1) (GEQ s12989 1)), p1:(AND (GEQ s8964 1) (GEQ s9356 1)), p0:(AND (GEQ s3972 1) (GEQ s6624 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-01 finished in 7069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 390 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:52:56] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:52:58] [INFO ] Computed 1145 place invariants in 1795 ms
[2022-05-18 06:52:59] [INFO ] Implicit Places using invariants in 3323 ms returned []
Implicit Place search using SMT only with invariants took 3325 ms to find 0 implicit places.
[2022-05-18 06:52:59] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:01] [INFO ] Computed 1145 place invariants in 1922 ms
[2022-05-18 06:53:02] [INFO ] Dead Transitions using invariants and state equation in 3276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s524 1) (LT s16392 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 49830 steps with 539 reset in 1220 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-02 finished in 8408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||F(G(p1))))))'
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 399 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:53:04] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:06] [INFO ] Computed 1145 place invariants in 1793 ms
[2022-05-18 06:53:08] [INFO ] Implicit Places using invariants in 3293 ms returned []
Implicit Place search using SMT only with invariants took 3295 ms to find 0 implicit places.
[2022-05-18 06:53:08] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:10] [INFO ] Computed 1145 place invariants in 1878 ms
[2022-05-18 06:53:11] [INFO ] Dead Transitions using invariants and state equation in 3219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s9172 1) (LT s9346 1)), p1:(LT s11774 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1083 reset in 2355 ms.
Product exploration explored 100000 steps with 1081 reset in 2345 ms.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Detected a total of 13868/16492 stabilizing places and 18968/24169 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 107 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:53:17] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:19] [INFO ] Computed 1145 place invariants in 1876 ms
[2022-05-18 06:53:20] [INFO ] [Real]Absence check using 47 positive place invariants in 155 ms returned sat
[2022-05-18 06:53:21] [INFO ] [Real]Absence check using 47 positive and 1098 generalized place invariants in 698 ms returned sat
[2022-05-18 06:53:21] [INFO ] After 2845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:53:23] [INFO ] [Nat]Absence check using 47 positive place invariants in 150 ms returned sat
[2022-05-18 06:53:24] [INFO ] [Nat]Absence check using 47 positive and 1098 generalized place invariants in 698 ms returned sat
[2022-05-18 06:53:46] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5399 transitions
Trivial Post-agglo rules discarded 5399 transitions
Performed 5399 trivial Post agglomeration. Transition count delta: 5399
Iterating post reduction 0 with 5399 rules applied. Total rules applied 5399 place count 16492 transition count 18770
Reduce places removed 5399 places and 0 transitions.
Iterating post reduction 1 with 5399 rules applied. Total rules applied 10798 place count 11093 transition count 18770
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10798 place count 11093 transition count 18320
Deduced a syphon composed of 450 places in 14 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11698 place count 10643 transition count 18320
Discarding 4949 places :
Symmetric choice reduction at 2 with 4949 rule applications. Total rules 16647 place count 5694 transition count 13371
Iterating global reduction 2 with 4949 rules applied. Total rules applied 21596 place count 5694 transition count 13371
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 21596 place count 5694 transition count 13354
Deduced a syphon composed of 17 places in 10 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 21630 place count 5677 transition count 13354
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 22179 place count 5128 transition count 8413
Iterating global reduction 2 with 549 rules applied. Total rules applied 22728 place count 5128 transition count 8413
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 22778 place count 5103 transition count 8388
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 23115 place count 5103 transition count 12443
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 23452 place count 4766 transition count 12443
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 23477 place count 4766 transition count 12443
Applied a total of 23477 rules in 4037 ms. Remains 4766 /16492 variables (removed 11726) and now considering 12443/24169 (removed 11726) transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/16492 places, 12443/24169 transitions.
Finished random walk after 6466 steps, including 116 resets, run visited all 1 properties in 328 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 365 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:53:52] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:53] [INFO ] Computed 1145 place invariants in 1783 ms
[2022-05-18 06:53:55] [INFO ] Implicit Places using invariants in 3139 ms returned []
Implicit Place search using SMT only with invariants took 3141 ms to find 0 implicit places.
[2022-05-18 06:53:55] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:53:57] [INFO ] Computed 1145 place invariants in 1791 ms
[2022-05-18 06:53:58] [INFO ] Dead Transitions using invariants and state equation in 3138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Detected a total of 13868/16492 stabilizing places and 18968/24169 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 10698 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10698 steps, saw 5380 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 06:54:02] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:54:04] [INFO ] Computed 1145 place invariants in 1799 ms
[2022-05-18 06:54:06] [INFO ] [Real]Absence check using 47 positive place invariants in 175 ms returned sat
[2022-05-18 06:54:06] [INFO ] [Real]Absence check using 47 positive and 1098 generalized place invariants in 610 ms returned sat
[2022-05-18 06:54:07] [INFO ] After 3181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 06:54:09] [INFO ] [Nat]Absence check using 47 positive place invariants in 176 ms returned sat
[2022-05-18 06:54:10] [INFO ] [Nat]Absence check using 47 positive and 1098 generalized place invariants in 648 ms returned sat
[2022-05-18 06:54:32] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5387 transitions
Trivial Post-agglo rules discarded 5387 transitions
Performed 5387 trivial Post agglomeration. Transition count delta: 5387
Iterating post reduction 0 with 5387 rules applied. Total rules applied 5387 place count 16492 transition count 18782
Reduce places removed 5387 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 5399 rules applied. Total rules applied 10786 place count 11105 transition count 18770
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 10798 place count 11093 transition count 18770
Performed 449 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 449 Pre rules applied. Total rules applied 10798 place count 11093 transition count 18321
Deduced a syphon composed of 449 places in 14 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 3 with 898 rules applied. Total rules applied 11696 place count 10644 transition count 18321
Discarding 4948 places :
Symmetric choice reduction at 3 with 4948 rule applications. Total rules 16644 place count 5696 transition count 13373
Iterating global reduction 3 with 4948 rules applied. Total rules applied 21592 place count 5696 transition count 13373
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 21592 place count 5696 transition count 13357
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 21624 place count 5680 transition count 13357
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 22172 place count 5132 transition count 8425
Iterating global reduction 3 with 548 rules applied. Total rules applied 22720 place count 5132 transition count 8425
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 22770 place count 5107 transition count 8400
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 23108 place count 5107 transition count 12446
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 23446 place count 4769 transition count 12446
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 23495 place count 4769 transition count 12446
Applied a total of 23495 rules in 4006 ms. Remains 4769 /16492 variables (removed 11723) and now considering 12446/24169 (removed 11723) transitions.
Finished structural reductions, in 1 iterations. Remains : 4769/16492 places, 12446/24169 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:54:37] [INFO ] Flow matrix only has 11560 transitions (discarded 886 similar events)
// Phase 1: matrix 11560 rows 4769 cols
[2022-05-18 06:54:37] [INFO ] Computed 1145 place invariants in 282 ms
[2022-05-18 06:54:37] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 06:54:38] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 296 ms returned sat
[2022-05-18 06:54:43] [INFO ] After 5433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:54:43] [INFO ] State equation strengthened by 7402 read => feed constraints.
[2022-05-18 06:54:44] [INFO ] After 1073ms SMT Verify possible using 7402 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:54:44] [INFO ] After 7499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:54:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 06:54:45] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 301 ms returned sat
[2022-05-18 06:54:51] [INFO ] After 6184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:54:54] [INFO ] After 2557ms SMT Verify possible using 7402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:55:01] [INFO ] Deduced a trap composed of 468 places in 6734 ms of which 10 ms to minimize.
[2022-05-18 06:55:10] [INFO ] Deduced a trap composed of 396 places in 6683 ms of which 6 ms to minimize.
[2022-05-18 06:55:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:55:10] [INFO ] After 25675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 4769 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4769/4769 places, 12446/12446 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4769 transition count 12445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4768 transition count 12445
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4768 transition count 12444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4767 transition count 12444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4766 transition count 12443
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4766 transition count 12443
Applied a total of 6 rules in 1601 ms. Remains 4766 /4769 variables (removed 3) and now considering 12443/12446 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/4769 places, 12443/12446 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21908 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21908 steps, saw 10155 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:55:15] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 06:55:16] [INFO ] Computed 1145 place invariants in 285 ms
[2022-05-18 06:55:16] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 06:55:16] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 299 ms returned sat
[2022-05-18 06:55:23] [INFO ] After 6186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:55:23] [INFO ] State equation strengthened by 7402 read => feed constraints.
[2022-05-18 06:55:25] [INFO ] After 1950ms SMT Verify possible using 7402 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:55:25] [INFO ] After 9098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:55:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 06:55:25] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 294 ms returned sat
[2022-05-18 06:55:31] [INFO ] After 5509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:55:34] [INFO ] After 2730ms SMT Verify possible using 7402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:55:41] [INFO ] Deduced a trap composed of 499 places in 6824 ms of which 5 ms to minimize.
[2022-05-18 06:55:50] [INFO ] Deduced a trap composed of 358 places in 6751 ms of which 6 ms to minimize.
[2022-05-18 06:55:50] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 15795 ms
[2022-05-18 06:55:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:55:50] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 4766 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4766/4766 places, 12443/12443 transitions.
Applied a total of 0 rules in 656 ms. Remains 4766 /4766 variables (removed 0) and now considering 12443/12443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/4766 places, 12443/12443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4766/4766 places, 12443/12443 transitions.
Applied a total of 0 rules in 649 ms. Remains 4766 /4766 variables (removed 0) and now considering 12443/12443 (removed 0) transitions.
[2022-05-18 06:55:51] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 06:55:51] [INFO ] Computed 1145 place invariants in 278 ms
[2022-05-18 06:55:55] [INFO ] Implicit Places using invariants in 4431 ms returned []
Implicit Place search using SMT only with invariants took 4432 ms to find 0 implicit places.
[2022-05-18 06:55:55] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 06:55:56] [INFO ] Computed 1145 place invariants in 277 ms
[2022-05-18 06:56:02] [INFO ] Dead Transitions using invariants and state equation in 6743 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/4766 places, 12443/12443 transitions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1081 reset in 1575 ms.
Product exploration explored 100000 steps with 1082 reset in 1598 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Performed 5399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5399 rules applied. Total rules applied 5399 place count 16492 transition count 24169
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5873 places in 13 ms
Iterating global reduction 1 with 474 rules applied. Total rules applied 5873 place count 16492 transition count 24169
Deduced a syphon composed of 5873 places in 13 ms
Applied a total of 5873 rules in 3603 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:56:10] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:56:12] [INFO ] Computed 1145 place invariants in 1916 ms
[2022-05-18 06:56:13] [INFO ] Dead Transitions using invariants and state equation in 3251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16492/16492 places, 24169/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Product exploration explored 100000 steps with 1351 reset in 3547 ms.
Product exploration explored 100000 steps with 1351 reset in 3539 ms.
Built C files in :
/tmp/ltsmin9997963708707815460
[2022-05-18 06:56:20] [INFO ] Built C files in 286ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9997963708707815460
Running compilation step : cd /tmp/ltsmin9997963708707815460;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9997963708707815460;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9997963708707815460;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 372 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:56:24] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:56:26] [INFO ] Computed 1145 place invariants in 1815 ms
[2022-05-18 06:56:27] [INFO ] Implicit Places using invariants in 3196 ms returned []
Implicit Place search using SMT only with invariants took 3205 ms to find 0 implicit places.
[2022-05-18 06:56:27] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:56:29] [INFO ] Computed 1145 place invariants in 1798 ms
[2022-05-18 06:56:30] [INFO ] Dead Transitions using invariants and state equation in 3126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Built C files in :
/tmp/ltsmin5544941041282986679
[2022-05-18 06:56:31] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5544941041282986679
Running compilation step : cd /tmp/ltsmin5544941041282986679;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5544941041282986679;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5544941041282986679;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:56:36] [INFO ] Flatten gal took : 714 ms
[2022-05-18 06:56:36] [INFO ] Flatten gal took : 739 ms
[2022-05-18 06:56:37] [INFO ] Time to serialize gal into /tmp/LTL3681353195938052152.gal : 145 ms
[2022-05-18 06:56:37] [INFO ] Time to serialize properties into /tmp/LTL1872741307587073809.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/LTL3681353195938052152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1872741307587073809.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/LTL3681353...266
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(Node19HasTheLeafSetOfLx2ToRep...175
Formula 0 simplified : !XG(X"((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))" | FG"(Node19HasTheLeafSetOfLx2ToReplaceNod...162
Detected timeout of ITS tools.
[2022-05-18 06:56:52] [INFO ] Flatten gal took : 818 ms
[2022-05-18 06:56:52] [INFO ] Applying decomposition
[2022-05-18 06:56:53] [INFO ] Flatten gal took : 697 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/graph17858760838203771624.txt' '-o' '/tmp/graph17858760838203771624.bin' '-w' '/tmp/graph17858760838203771624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17858760838203771624.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858760838203771624.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:56:56] [INFO ] Decomposing Gal with order
[2022-05-18 06:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:57:03] [INFO ] Removed a total of 15413 redundant transitions.
[2022-05-18 06:57:03] [INFO ] Flatten gal took : 4109 ms
[2022-05-18 06:57:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1714 labels/synchronizations in 516 ms.
[2022-05-18 06:57:06] [INFO ] Time to serialize gal into /tmp/LTL11541388517413167185.gal : 1292 ms
[2022-05-18 06:57:06] [INFO ] Time to serialize properties into /tmp/LTL2256248351249591241.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/LTL11541388517413167185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2256248351249591241.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/LTL1154138...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i15.u385.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i15.u385.LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(i4.u375.Nod...201
Formula 0 simplified : !XG(X"((i15.u385.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i15.u385.LeafSetOfRx3IsSentToNode14<1))" | FG"(i4.u375.Node19HasT...188
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7276861180443950520
[2022-05-18 06:57:21] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7276861180443950520
Running compilation step : cd /tmp/ltsmin7276861180443950520;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7276861180443950520;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7276861180443950520;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04 finished in 260130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(X((F(p1) U p2)))&&F(p3)))))'
Support contains 7 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 495 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:57:25] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:57:26] [INFO ] Computed 1145 place invariants in 1814 ms
[2022-05-18 06:57:28] [INFO ] Implicit Places using invariants in 3065 ms returned []
Implicit Place search using SMT only with invariants took 3066 ms to find 0 implicit places.
[2022-05-18 06:57:28] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:57:30] [INFO ] Computed 1145 place invariants in 2673 ms
[2022-05-18 06:57:32] [INFO ] Dead Transitions using invariants and state equation in 3993 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 935 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 11}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(NOT p1), acceptance={} source=10 dest: 10}, { cond=(NOT p1), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 14}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=12 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=13 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=15 dest: 14}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 15}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=16 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=16 dest: 11}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=16 dest: 12}]], initial=0, aps=[p0:(OR (GEQ s11635 1) (AND (GEQ s10631 1) (GEQ s11084 1))), p3:(AND (GEQ s10502 1) (GEQ s12546 1)), p2:(AND (GEQ s10631 1) (GEQ s11084 1)), p1:(AND (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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-05 finished in 8645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U !p1))||G(X(p2))))'
Support contains 6 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 453 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:57:33] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:57:35] [INFO ] Computed 1145 place invariants in 1831 ms
[2022-05-18 06:57:36] [INFO ] Implicit Places using invariants in 3077 ms returned []
Implicit Place search using SMT only with invariants took 3078 ms to find 0 implicit places.
[2022-05-18 06:57:36] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:57:38] [INFO ] Computed 1145 place invariants in 1827 ms
[2022-05-18 06:57:39] [INFO ] Dead Transitions using invariants and state equation in 3140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, p1, (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s5491 1) (GEQ s14696 1)), p0:(AND (GEQ s2105 1) (GEQ s2303 1)), p2:(OR (LT s6064 1) (LT s13389 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, null, null][false, false, false, false, false]]
Product exploration timeout after 97730 steps with 48865 reset in 10034 ms.
Product exploration explored 100000 steps with 50000 reset in 9078 ms.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Detected a total of 13868/16492 stabilizing places and 18968/24169 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) p2)
Knowledge based reduction with 14 factoid took 434 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-06 finished in 26576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U !p0)))'
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 400 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:58:00] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:58:01] [INFO ] Computed 1145 place invariants in 1794 ms
[2022-05-18 06:58:03] [INFO ] Implicit Places using invariants in 3007 ms returned []
Implicit Place search using SMT only with invariants took 3007 ms to find 0 implicit places.
[2022-05-18 06:58:03] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:58:05] [INFO ] Computed 1145 place invariants in 1839 ms
[2022-05-18 06:58:06] [INFO ] Dead Transitions using invariants and state equation in 3045 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0, true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s9373 1) (GEQ s12989 1) (GEQ s12992 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9011 ms.
Product exploration explored 100000 steps with 50000 reset in 9009 ms.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-08 finished in 24729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||G(!p0)||p1)))'
Support contains 4 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 382 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 06:58:24] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:58:26] [INFO ] Computed 1145 place invariants in 1830 ms
[2022-05-18 06:58:27] [INFO ] Implicit Places using invariants in 3069 ms returned []
Implicit Place search using SMT only with invariants took 3070 ms to find 0 implicit places.
[2022-05-18 06:58:27] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:58:29] [INFO ] Computed 1145 place invariants in 1839 ms
[2022-05-18 06:58:30] [INFO ] Dead Transitions using invariants and state equation in 3053 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09 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=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s4719 1) (LT s11092 1)), p1:(AND (GEQ s10883 1) (GEQ s16419 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1083 reset in 1935 ms.
Product exploration explored 100000 steps with 1081 reset in 1893 ms.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Detected a total of 13868/16492 stabilizing places and 18968/24169 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 313 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9845 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9845 steps, saw 4816 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:58:38] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 06:58:40] [INFO ] Computed 1145 place invariants in 1920 ms
[2022-05-18 06:58:42] [INFO ] [Real]Absence check using 47 positive place invariants in 185 ms returned sat
[2022-05-18 06:58:43] [INFO ] [Real]Absence check using 47 positive and 1098 generalized place invariants in 755 ms returned sat
[2022-05-18 06:58:43] [INFO ] After 2801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:58:45] [INFO ] [Nat]Absence check using 47 positive place invariants in 183 ms returned sat
[2022-05-18 06:58:46] [INFO ] [Nat]Absence check using 47 positive and 1098 generalized place invariants in 797 ms returned sat
[2022-05-18 06:59:08] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5400 transitions
Trivial Post-agglo rules discarded 5400 transitions
Performed 5400 trivial Post agglomeration. Transition count delta: 5400
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 18769
Reduce places removed 5400 places and 0 transitions.
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10800 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 23 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11700 place count 10642 transition count 18319
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16650 place count 5692 transition count 13369
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21600 place count 5692 transition count 13369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21600 place count 5692 transition count 13351
Deduced a syphon composed of 18 places in 10 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 21636 place count 5674 transition count 13351
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 22186 place count 5124 transition count 8401
Iterating global reduction 2 with 550 rules applied. Total rules applied 22736 place count 5124 transition count 8401
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 22784 place count 5100 transition count 8377
Free-agglomeration rule (complex) applied 323 times.
Iterating global reduction 2 with 323 rules applied. Total rules applied 23107 place count 5100 transition count 12366
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 2 with 323 rules applied. Total rules applied 23430 place count 4777 transition count 12366
Applied a total of 23430 rules in 3754 ms. Remains 4777 /16492 variables (removed 11715) and now considering 12366/24169 (removed 11803) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/16492 places, 12366/24169 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20931 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20931 steps, saw 9730 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:59:16] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 06:59:16] [INFO ] Computed 1145 place invariants in 316 ms
[2022-05-18 06:59:16] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2022-05-18 06:59:17] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 283 ms returned sat
[2022-05-18 06:59:25] [INFO ] After 9382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:59:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-18 06:59:26] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 281 ms returned sat
[2022-05-18 06:59:35] [INFO ] After 8606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:59:35] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 06:59:44] [INFO ] After 9552ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 06:59:44] [INFO ] After 19066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 735 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 702 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
[2022-05-18 06:59:46] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 06:59:46] [INFO ] Computed 1145 place invariants in 280 ms
[2022-05-18 06:59:50] [INFO ] Implicit Places using invariants in 4380 ms returned []
Implicit Place search using SMT only with invariants took 4381 ms to find 0 implicit places.
[2022-05-18 06:59:50] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 06:59:50] [INFO ] Computed 1145 place invariants in 271 ms
[2022-05-18 06:59:56] [INFO ] Dead Transitions using invariants and state equation in 6244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Graph (trivial) has 3463 edges and 4777 vertex of which 24 / 4777 are part of one of the 1 SCC in 16 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 43329 edges and 4754 vertex of which 4732 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.18 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t10114.t12025 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 4348 transition count 10691
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 4126 transition count 10272
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3916 transition count 9910
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3720 transition count 9606
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3567 transition count 9352
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 3429 transition count 9148
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 6 with 265 rules applied. Total rules applied 2952 place count 3326 transition count 8986
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 3238 transition count 8866
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 3177 transition count 8780
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 3131 transition count 8727
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 3104 transition count 8701
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 3091 transition count 8689
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 3079 transition count 8689
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 450 Pre rules applied. Total rules applied 3496 place count 3079 transition count 8239
Deduced a syphon composed of 450 places in 3 ms
Ensure Unique test removed 450 places
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 13 with 1350 rules applied. Total rules applied 4846 place count 2179 transition count 8239
Discarding 456 places :
Symmetric choice reduction at 13 with 456 rule applications. Total rules 5302 place count 1723 transition count 7783
Iterating global reduction 13 with 456 rules applied. Total rules applied 5758 place count 1723 transition count 7783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5758 place count 1723 transition count 7782
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5760 place count 1722 transition count 7782
Discarding 388 places :
Symmetric choice reduction at 13 with 388 rule applications. Total rules 6148 place count 1334 transition count 4290
Iterating global reduction 13 with 388 rules applied. Total rules applied 6536 place count 1334 transition count 4290
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 13 with 388 rules applied. Total rules applied 6924 place count 1334 transition count 3902
Performed 859 Post agglomeration using F-continuation condition.Transition count delta: 859
Deduced a syphon composed of 859 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 860 places and 0 transitions.
Iterating global reduction 14 with 1719 rules applied. Total rules applied 8643 place count 474 transition count 3043
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 9478 place count 474 transition count 2208
Drop transitions removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 15 with 153 rules applied. Total rules applied 9631 place count 474 transition count 2055
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9784 place count 321 transition count 2055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9784 place count 321 transition count 2054
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9786 place count 320 transition count 2054
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9938 place count 168 transition count 686
Iterating global reduction 16 with 152 rules applied. Total rules applied 10090 place count 168 transition count 686
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 16 with 152 rules applied. Total rules applied 10242 place count 168 transition count 534
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 17 with 18 rules applied. Total rules applied 10260 place count 168 transition count 516
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 17 with 18 rules applied. Total rules applied 10278 place count 150 transition count 516
Discarding 22 places :
Symmetric choice reduction at 18 with 22 rule applications. Total rules 10300 place count 128 transition count 318
Ensure Unique test removed 11 places
Iterating global reduction 18 with 33 rules applied. Total rules applied 10333 place count 117 transition count 318
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 18 with 22 rules applied. Total rules applied 10355 place count 117 transition count 296
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10366 place count 106 transition count 197
Iterating global reduction 19 with 11 rules applied. Total rules applied 10377 place count 106 transition count 197
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10388 place count 95 transition count 186
Iterating global reduction 19 with 11 rules applied. Total rules applied 10399 place count 95 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10400 place count 95 transition count 186
Applied a total of 10400 rules in 13080 ms. Remains 95 /4777 variables (removed 4682) and now considering 186/12366 (removed 12180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 95 cols
[2022-05-18 07:00:09] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-18 07:00:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 07:00:10] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 4 ms returned sat
[2022-05-18 07:00:10] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:00:10] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-18 07:00:10] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-18 07:00:10] [INFO ] Flatten gal took : 11 ms
[2022-05-18 07:00:10] [INFO ] Flatten gal took : 23 ms
[2022-05-18 07:00:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17446939942337685907.gal : 3 ms
[2022-05-18 07:00:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11227250024941808862.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3811851533750054730;'/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/ReachabilityCardinality17446939942337685907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11227250024941808862.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/ReachabilityCardinality11227250024941808862.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 123
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :123 after 145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145 after 458
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :458 after 1037
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1037 after 1857
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1857 after 3577
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3577 after 27600
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :27600 after 226514
Detected timeout of ITS tools.
[2022-05-18 07:00:25] [INFO ] Flatten gal took : 14 ms
[2022-05-18 07:00:25] [INFO ] Applying decomposition
[2022-05-18 07:00:25] [INFO ] Flatten gal took : 11 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/graph8178249361189947798.txt' '-o' '/tmp/graph8178249361189947798.bin' '-w' '/tmp/graph8178249361189947798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8178249361189947798.bin' '-l' '-1' '-v' '-w' '/tmp/graph8178249361189947798.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:00:25] [INFO ] Decomposing Gal with order
[2022-05-18 07:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:00:25] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-18 07:00:25] [INFO ] Flatten gal took : 63 ms
[2022-05-18 07:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 2 ms.
[2022-05-18 07:00:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3424740840989556166.gal : 1 ms
[2022-05-18 07:00:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16466246979941643030.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3811851533750054730;'/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/ReachabilityCardinality3424740840989556166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16466246979941643030.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality16466246979941643030.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2230
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2230 after 5707
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5707 after 14870
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\_mod\_flat,1.15226e+06,1.89853,55264,4079,9625,45017,42429,396,121860,230,543611,0
Total reachable state count : 1152256

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,1.90151,55264,18,67,45017,42429,397,121860,233,543611,2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 351 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 16492 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 1335 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 07:00:29] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:00:31] [INFO ] Computed 1145 place invariants in 1897 ms
[2022-05-18 07:00:32] [INFO ] Implicit Places using invariants in 3089 ms returned []
Implicit Place search using SMT only with invariants took 3090 ms to find 0 implicit places.
[2022-05-18 07:00:32] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:00:34] [INFO ] Computed 1145 place invariants in 1834 ms
[2022-05-18 07:00:35] [INFO ] Dead Transitions using invariants and state equation in 3037 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Computed a total of 13868 stabilizing places and 18968 stable transitions
Computed a total of 13868 stabilizing places and 18968 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10917 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10917 steps, saw 5482 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:00:39] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:00:40] [INFO ] Computed 1145 place invariants in 1835 ms
[2022-05-18 07:00:42] [INFO ] [Real]Absence check using 47 positive place invariants in 178 ms returned sat
[2022-05-18 07:00:43] [INFO ] [Real]Absence check using 47 positive and 1098 generalized place invariants in 710 ms returned sat
[2022-05-18 07:00:43] [INFO ] After 2724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:00:45] [INFO ] [Nat]Absence check using 47 positive place invariants in 190 ms returned sat
[2022-05-18 07:00:46] [INFO ] [Nat]Absence check using 47 positive and 1098 generalized place invariants in 853 ms returned sat
[2022-05-18 07:01:08] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5400 transitions
Trivial Post-agglo rules discarded 5400 transitions
Performed 5400 trivial Post agglomeration. Transition count delta: 5400
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 18769
Reduce places removed 5400 places and 0 transitions.
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10800 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 18 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11700 place count 10642 transition count 18319
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16650 place count 5692 transition count 13369
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21600 place count 5692 transition count 13369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21600 place count 5692 transition count 13351
Deduced a syphon composed of 18 places in 11 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 21636 place count 5674 transition count 13351
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 22186 place count 5124 transition count 8401
Iterating global reduction 2 with 550 rules applied. Total rules applied 22736 place count 5124 transition count 8401
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 22784 place count 5100 transition count 8377
Free-agglomeration rule (complex) applied 323 times.
Iterating global reduction 2 with 323 rules applied. Total rules applied 23107 place count 5100 transition count 12366
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 2 with 323 rules applied. Total rules applied 23430 place count 4777 transition count 12366
Applied a total of 23430 rules in 3974 ms. Remains 4777 /16492 variables (removed 11715) and now considering 12366/24169 (removed 11803) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/16492 places, 12366/24169 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20425 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20425 steps, saw 9501 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:01:16] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:01:16] [INFO ] Computed 1145 place invariants in 271 ms
[2022-05-18 07:01:17] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 07:01:17] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 258 ms returned sat
[2022-05-18 07:01:23] [INFO ] After 7427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:01:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 07:01:24] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 261 ms returned sat
[2022-05-18 07:01:31] [INFO ] After 6566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:01:31] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 07:01:40] [INFO ] After 9539ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 07:01:40] [INFO ] After 16995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 775 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 754 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
[2022-05-18 07:01:42] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:01:42] [INFO ] Computed 1145 place invariants in 296 ms
[2022-05-18 07:01:46] [INFO ] Implicit Places using invariants in 4207 ms returned []
Implicit Place search using SMT only with invariants took 4211 ms to find 0 implicit places.
[2022-05-18 07:01:46] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:01:47] [INFO ] Computed 1145 place invariants in 271 ms
[2022-05-18 07:01:53] [INFO ] Dead Transitions using invariants and state equation in 6512 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Graph (trivial) has 3463 edges and 4777 vertex of which 24 / 4777 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 43329 edges and 4754 vertex of which 4732 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t10114.t12025 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 4348 transition count 10691
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 4126 transition count 10272
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3916 transition count 9910
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3720 transition count 9606
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3567 transition count 9352
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 3429 transition count 9148
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 6 with 265 rules applied. Total rules applied 2952 place count 3326 transition count 8986
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 3238 transition count 8866
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 3177 transition count 8780
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 3131 transition count 8727
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 3104 transition count 8701
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 3091 transition count 8689
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 3079 transition count 8689
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 450 Pre rules applied. Total rules applied 3496 place count 3079 transition count 8239
Deduced a syphon composed of 450 places in 2 ms
Ensure Unique test removed 450 places
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 13 with 1350 rules applied. Total rules applied 4846 place count 2179 transition count 8239
Discarding 456 places :
Symmetric choice reduction at 13 with 456 rule applications. Total rules 5302 place count 1723 transition count 7783
Iterating global reduction 13 with 456 rules applied. Total rules applied 5758 place count 1723 transition count 7783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5758 place count 1723 transition count 7782
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5760 place count 1722 transition count 7782
Discarding 388 places :
Symmetric choice reduction at 13 with 388 rule applications. Total rules 6148 place count 1334 transition count 4290
Iterating global reduction 13 with 388 rules applied. Total rules applied 6536 place count 1334 transition count 4290
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 13 with 388 rules applied. Total rules applied 6924 place count 1334 transition count 3902
Performed 859 Post agglomeration using F-continuation condition.Transition count delta: 859
Deduced a syphon composed of 859 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 860 places and 0 transitions.
Iterating global reduction 14 with 1719 rules applied. Total rules applied 8643 place count 474 transition count 3043
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 9478 place count 474 transition count 2208
Drop transitions removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 15 with 153 rules applied. Total rules applied 9631 place count 474 transition count 2055
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9784 place count 321 transition count 2055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9784 place count 321 transition count 2054
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9786 place count 320 transition count 2054
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9938 place count 168 transition count 686
Iterating global reduction 16 with 152 rules applied. Total rules applied 10090 place count 168 transition count 686
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 16 with 152 rules applied. Total rules applied 10242 place count 168 transition count 534
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 17 with 18 rules applied. Total rules applied 10260 place count 168 transition count 516
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 17 with 18 rules applied. Total rules applied 10278 place count 150 transition count 516
Discarding 22 places :
Symmetric choice reduction at 18 with 22 rule applications. Total rules 10300 place count 128 transition count 318
Ensure Unique test removed 11 places
Iterating global reduction 18 with 33 rules applied. Total rules applied 10333 place count 117 transition count 318
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 18 with 22 rules applied. Total rules applied 10355 place count 117 transition count 296
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10366 place count 106 transition count 197
Iterating global reduction 19 with 11 rules applied. Total rules applied 10377 place count 106 transition count 197
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10388 place count 95 transition count 186
Iterating global reduction 19 with 11 rules applied. Total rules applied 10399 place count 95 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10400 place count 95 transition count 186
Applied a total of 10400 rules in 12778 ms. Remains 95 /4777 variables (removed 4682) and now considering 186/12366 (removed 12180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 95 cols
[2022-05-18 07:02:06] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-18 07:02:06] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-18 07:02:06] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 4 ms returned sat
[2022-05-18 07:02:06] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:02:06] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-18 07:02:06] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-18 07:02:06] [INFO ] Flatten gal took : 10 ms
[2022-05-18 07:02:06] [INFO ] Flatten gal took : 10 ms
[2022-05-18 07:02:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16933883972204375855.gal : 3 ms
[2022-05-18 07:02:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality827299296746591432.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3828688816905204340;'/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/ReachabilityCardinality16933883972204375855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality827299296746591432.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...319
Loading property file /tmp/ReachabilityCardinality827299296746591432.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 123
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :123 after 145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145 after 458
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :458 after 1037
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1037 after 1857
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1857 after 3577
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3577 after 27600
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :27600 after 226514
Detected timeout of ITS tools.
[2022-05-18 07:02:21] [INFO ] Flatten gal took : 10 ms
[2022-05-18 07:02:21] [INFO ] Applying decomposition
[2022-05-18 07:02:21] [INFO ] Flatten gal took : 9 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/graph8786765184021743147.txt' '-o' '/tmp/graph8786765184021743147.bin' '-w' '/tmp/graph8786765184021743147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8786765184021743147.bin' '-l' '-1' '-v' '-w' '/tmp/graph8786765184021743147.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:02:21] [INFO ] Decomposing Gal with order
[2022-05-18 07:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:02:21] [INFO ] Removed a total of 381 redundant transitions.
[2022-05-18 07:02:21] [INFO ] Flatten gal took : 16 ms
[2022-05-18 07:02:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 2 ms.
[2022-05-18 07:02:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1296167568220909282.gal : 1 ms
[2022-05-18 07:02:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5435593607014374510.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3828688816905204340;'/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/ReachabilityCardinality1296167568220909282.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5435593607014374510.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality5435593607014374510.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :26 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 268
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :268 after 622
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :622 after 2554
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2554 after 13350
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13350 after 26118
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :26118 after 39054
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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\_mod\_flat,85918,0.738625,24260,567,4038,3831,40542,211,20265,250,262168,0
Total reachable state count : 85918

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,0.739689,24524,23,71,3831,40542,217,20265,253,262168,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1082 reset in 1679 ms.
Product exploration explored 100000 steps with 1084 reset in 1677 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Performed 5400 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 24169
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5874 places in 16 ms
Iterating global reduction 1 with 474 rules applied. Total rules applied 5874 place count 16492 transition count 24169
Deduced a syphon composed of 5874 places in 16 ms
Applied a total of 5874 rules in 3719 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 07:02:29] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:02:31] [INFO ] Computed 1145 place invariants in 1872 ms
[2022-05-18 07:02:32] [INFO ] Dead Transitions using invariants and state equation in 3109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16492/16492 places, 24169/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Product exploration explored 100000 steps with 1352 reset in 3732 ms.
Product exploration explored 100000 steps with 1352 reset in 3763 ms.
Built C files in :
/tmp/ltsmin7764696993761553777
[2022-05-18 07:02:40] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7764696993761553777
Running compilation step : cd /tmp/ltsmin7764696993761553777;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7764696993761553777;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7764696993761553777;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 16492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Applied a total of 0 rules in 613 ms. Remains 16492 /16492 variables (removed 0) and now considering 24169/24169 (removed 0) transitions.
[2022-05-18 07:02:44] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:02:48] [INFO ] Computed 1145 place invariants in 4027 ms
[2022-05-18 07:02:49] [INFO ] Implicit Places using invariants in 5322 ms returned []
Implicit Place search using SMT only with invariants took 5322 ms to find 0 implicit places.
[2022-05-18 07:02:49] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16492 cols
[2022-05-18 07:02:51] [INFO ] Computed 1145 place invariants in 1864 ms
[2022-05-18 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 3210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16492/16492 places, 24169/24169 transitions.
Built C files in :
/tmp/ltsmin5265143359070613540
[2022-05-18 07:02:52] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5265143359070613540
Running compilation step : cd /tmp/ltsmin5265143359070613540;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5265143359070613540;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5265143359070613540;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 07:02:57] [INFO ] Flatten gal took : 680 ms
[2022-05-18 07:02:57] [INFO ] Flatten gal took : 791 ms
[2022-05-18 07:02:58] [INFO ] Time to serialize gal into /tmp/LTL2104063680937646184.gal : 122 ms
[2022-05-18 07:02:58] [INFO ] Time to serialize properties into /tmp/LTL16233078346892679666.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/LTL2104063680937646184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16233078346892679666.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/LTL2104063...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("((Node6HasDetectedCrashOfNode18<1)||(Node18IsTheNodeMaster<1))")))||(G("((Node6HasDetectedCrashOfNode18>=1)&&(Node18IsTheN...260
Formula 0 simplified : !G("((Node17ManageTheCrashOfNode16>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1))" | XG"((Node6HasDetectedCrashOfNode18<1)||(Node18...246
Detected timeout of ITS tools.
[2022-05-18 07:03:14] [INFO ] Flatten gal took : 691 ms
[2022-05-18 07:03:14] [INFO ] Applying decomposition
[2022-05-18 07:03:14] [INFO ] Flatten gal took : 745 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/graph8425370715307814360.txt' '-o' '/tmp/graph8425370715307814360.bin' '-w' '/tmp/graph8425370715307814360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8425370715307814360.bin' '-l' '-1' '-v' '-w' '/tmp/graph8425370715307814360.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:03:16] [INFO ] Decomposing Gal with order
[2022-05-18 07:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:03:22] [INFO ] Removed a total of 15556 redundant transitions.
[2022-05-18 07:03:22] [INFO ] Flatten gal took : 3344 ms
[2022-05-18 07:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1541 labels/synchronizations in 566 ms.
[2022-05-18 07:03:24] [INFO ] Time to serialize gal into /tmp/LTL1904082670603742958.gal : 1135 ms
[2022-05-18 07:03:24] [INFO ] Time to serialize properties into /tmp/LTL9963910031139584788.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/LTL1904082670603742958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9963910031139584788.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/LTL1904082...245
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("((i1.u149.Node6HasDetectedCrashOfNode18<1)||(i0.u0.Node18IsTheNodeMaster<1))")))||(G("((i1.u149.Node6HasDetectedCrashOfNod...304
Formula 0 simplified : !G("((i0.u225.Node17ManageTheCrashOfNode16>=1)&&(i9.u399.Rx6IsAtTheRightExtremityOfTheLeafSet>=1))" | XG"((i1.u149.Node6HasDetectedC...290
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12798288595071021068
[2022-05-18 07:03:40] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12798288595071021068
Running compilation step : cd /tmp/ltsmin12798288595071021068;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12798288595071021068;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12798288595071021068;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09 finished in 318702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5400 transitions
Trivial Post-agglo rules discarded 5400 transitions
Performed 5400 trivial Post agglomeration. Transition count delta: 5400
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 18769
Reduce places removed 5400 places and 0 transitions.
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10800 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 15 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11700 place count 10642 transition count 18319
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16650 place count 5692 transition count 13369
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21600 place count 5692 transition count 13369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21600 place count 5692 transition count 13351
Deduced a syphon composed of 18 places in 10 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 21636 place count 5674 transition count 13351
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 22186 place count 5124 transition count 8401
Iterating global reduction 2 with 550 rules applied. Total rules applied 22736 place count 5124 transition count 8401
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 22786 place count 5099 transition count 8376
Applied a total of 22786 rules in 3179 ms. Remains 5099 /16492 variables (removed 11393) and now considering 8376/24169 (removed 15793) transitions.
[2022-05-18 07:03:46] [INFO ] Flow matrix only has 7776 transitions (discarded 600 similar events)
// Phase 1: matrix 7776 rows 5099 cols
[2022-05-18 07:03:46] [INFO ] Computed 1145 place invariants in 238 ms
[2022-05-18 07:03:50] [INFO ] Implicit Places using invariants in 3756 ms returned []
[2022-05-18 07:03:50] [INFO ] Flow matrix only has 7776 transitions (discarded 600 similar events)
// Phase 1: matrix 7776 rows 5099 cols
[2022-05-18 07:03:50] [INFO ] Computed 1145 place invariants in 226 ms
[2022-05-18 07:03:53] [INFO ] Implicit Places using invariants and state equation in 3567 ms returned []
Implicit Place search using SMT with State Equation took 7325 ms to find 0 implicit places.
[2022-05-18 07:03:54] [INFO ] Redundant transitions in 1042 ms returned []
[2022-05-18 07:03:54] [INFO ] Flow matrix only has 7776 transitions (discarded 600 similar events)
// Phase 1: matrix 7776 rows 5099 cols
[2022-05-18 07:03:54] [INFO ] Computed 1145 place invariants in 228 ms
[2022-05-18 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 4805 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5099/16492 places, 8376/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 5099/16492 places, 8376/24169 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s1213 1) (GEQ s1214 1) (GEQ s1849 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-10 finished in 16435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(X((F(p1)&&p0)))||F(p2))))))'
Support contains 4 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5400 transitions
Trivial Post-agglo rules discarded 5400 transitions
Performed 5400 trivial Post agglomeration. Transition count delta: 5400
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 18769
Reduce places removed 5400 places and 0 transitions.
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10800 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 20 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11700 place count 10642 transition count 18319
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16650 place count 5692 transition count 13369
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21600 place count 5692 transition count 13369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21600 place count 5692 transition count 13351
Deduced a syphon composed of 18 places in 11 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 21636 place count 5674 transition count 13351
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 22184 place count 5126 transition count 8419
Iterating global reduction 2 with 548 rules applied. Total rules applied 22732 place count 5126 transition count 8419
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 22782 place count 5101 transition count 8394
Applied a total of 22782 rules in 3318 ms. Remains 5101 /16492 variables (removed 11391) and now considering 8394/24169 (removed 15775) transitions.
[2022-05-18 07:04:02] [INFO ] Flow matrix only has 7794 transitions (discarded 600 similar events)
// Phase 1: matrix 7794 rows 5101 cols
[2022-05-18 07:04:03] [INFO ] Computed 1145 place invariants in 224 ms
[2022-05-18 07:04:06] [INFO ] Implicit Places using invariants in 3919 ms returned []
[2022-05-18 07:04:06] [INFO ] Flow matrix only has 7794 transitions (discarded 600 similar events)
// Phase 1: matrix 7794 rows 5101 cols
[2022-05-18 07:04:07] [INFO ] Computed 1145 place invariants in 210 ms
[2022-05-18 07:04:10] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 7484 ms to find 0 implicit places.
[2022-05-18 07:04:11] [INFO ] Redundant transitions in 1084 ms returned []
[2022-05-18 07:04:11] [INFO ] Flow matrix only has 7794 transitions (discarded 600 similar events)
// Phase 1: matrix 7794 rows 5101 cols
[2022-05-18 07:04:11] [INFO ] Computed 1145 place invariants in 206 ms
[2022-05-18 07:04:15] [INFO ] Dead Transitions using invariants and state equation in 4402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5101/16492 places, 8394/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 5101/16492 places, 8394/24169 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2140 1) (GEQ s5046 1)), p0:(AND (GEQ s3459 1) (GEQ s4830 1)), p1:(OR (LT s3459 1) (LT s4830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-13 finished in 16427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((X(p1)||p0))))))'
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5399 transitions
Trivial Post-agglo rules discarded 5399 transitions
Performed 5399 trivial Post agglomeration. Transition count delta: 5399
Iterating post reduction 0 with 5399 rules applied. Total rules applied 5399 place count 16492 transition count 18770
Reduce places removed 5399 places and 0 transitions.
Iterating post reduction 1 with 5399 rules applied. Total rules applied 10798 place count 11093 transition count 18770
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10798 place count 11093 transition count 18320
Deduced a syphon composed of 450 places in 16 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11698 place count 10643 transition count 18320
Discarding 4949 places :
Symmetric choice reduction at 2 with 4949 rule applications. Total rules 16647 place count 5694 transition count 13371
Iterating global reduction 2 with 4949 rules applied. Total rules applied 21596 place count 5694 transition count 13371
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 21596 place count 5694 transition count 13354
Deduced a syphon composed of 17 places in 9 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 21630 place count 5677 transition count 13354
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 22179 place count 5128 transition count 8413
Iterating global reduction 2 with 549 rules applied. Total rules applied 22728 place count 5128 transition count 8413
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 22778 place count 5103 transition count 8388
Applied a total of 22778 rules in 2961 ms. Remains 5103 /16492 variables (removed 11389) and now considering 8388/24169 (removed 15781) transitions.
[2022-05-18 07:04:19] [INFO ] Flow matrix only has 7788 transitions (discarded 600 similar events)
// Phase 1: matrix 7788 rows 5103 cols
[2022-05-18 07:04:19] [INFO ] Computed 1145 place invariants in 206 ms
[2022-05-18 07:04:22] [INFO ] Implicit Places using invariants in 3623 ms returned []
[2022-05-18 07:04:22] [INFO ] Flow matrix only has 7788 transitions (discarded 600 similar events)
// Phase 1: matrix 7788 rows 5103 cols
[2022-05-18 07:04:22] [INFO ] Computed 1145 place invariants in 207 ms
[2022-05-18 07:04:26] [INFO ] Implicit Places using invariants and state equation in 3565 ms returned []
Implicit Place search using SMT with State Equation took 7188 ms to find 0 implicit places.
[2022-05-18 07:04:26] [INFO ] Redundant transitions in 712 ms returned []
[2022-05-18 07:04:26] [INFO ] Flow matrix only has 7788 transitions (discarded 600 similar events)
// Phase 1: matrix 7788 rows 5103 cols
[2022-05-18 07:04:27] [INFO ] Computed 1145 place invariants in 205 ms
[2022-05-18 07:04:31] [INFO ] Dead Transitions using invariants and state equation in 4391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5103/16492 places, 8388/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 5103/16492 places, 8388/24169 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s693 1) (AND (GEQ s1834 1) (GEQ s4859 1))), p1:(AND (GEQ s1834 1) (GEQ s4859 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-14 finished in 15347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||F(G(p1))))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5387 transitions
Trivial Post-agglo rules discarded 5387 transitions
Performed 5387 trivial Post agglomeration. Transition count delta: 5387
Iterating post reduction 0 with 5387 rules applied. Total rules applied 5387 place count 16492 transition count 18782
Reduce places removed 5387 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 5399 rules applied. Total rules applied 10786 place count 11105 transition count 18770
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 10798 place count 11093 transition count 18770
Performed 449 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 449 Pre rules applied. Total rules applied 10798 place count 11093 transition count 18321
Deduced a syphon composed of 449 places in 18 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 3 with 898 rules applied. Total rules applied 11696 place count 10644 transition count 18321
Discarding 4948 places :
Symmetric choice reduction at 3 with 4948 rule applications. Total rules 16644 place count 5696 transition count 13373
Iterating global reduction 3 with 4948 rules applied. Total rules applied 21592 place count 5696 transition count 13373
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 21592 place count 5696 transition count 13357
Deduced a syphon composed of 16 places in 10 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 21624 place count 5680 transition count 13357
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 22172 place count 5132 transition count 8425
Iterating global reduction 3 with 548 rules applied. Total rules applied 22720 place count 5132 transition count 8425
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 22770 place count 5107 transition count 8400
Applied a total of 22770 rules in 2872 ms. Remains 5107 /16492 variables (removed 11385) and now considering 8400/24169 (removed 15769) transitions.
[2022-05-18 07:04:34] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:04:34] [INFO ] Computed 1145 place invariants in 207 ms
[2022-05-18 07:04:38] [INFO ] Implicit Places using invariants in 3634 ms returned []
[2022-05-18 07:04:38] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:04:38] [INFO ] Computed 1145 place invariants in 273 ms
[2022-05-18 07:04:41] [INFO ] Implicit Places using invariants and state equation in 3702 ms returned []
Implicit Place search using SMT with State Equation took 7338 ms to find 0 implicit places.
[2022-05-18 07:04:41] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:04:42] [INFO ] Computed 1145 place invariants in 235 ms
[2022-05-18 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 4444 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 5107/16492 places, 8400/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 5107/16492 places, 8400/24169 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s2511 1) (LT s2534 1)), p1:(LT s3080 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1500 reset in 1320 ms.
Product exploration explored 100000 steps with 1498 reset in 1296 ms.
Computed a total of 2508 stabilizing places and 3224 stable transitions
Computed a total of 2508 stabilizing places and 3224 stable transitions
Detected a total of 2508/5107 stabilizing places and 3224/8400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:04:49] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:04:49] [INFO ] Computed 1145 place invariants in 216 ms
[2022-05-18 07:04:50] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2022-05-18 07:04:50] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 299 ms returned sat
[2022-05-18 07:04:56] [INFO ] After 5536ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:04:56] [INFO ] State equation strengthened by 3018 read => feed constraints.
[2022-05-18 07:04:56] [INFO ] After 525ms SMT Verify possible using 3018 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:04:56] [INFO ] After 7016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:04:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 93 ms returned sat
[2022-05-18 07:04:57] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 316 ms returned sat
[2022-05-18 07:05:03] [INFO ] After 5926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:05:04] [INFO ] After 790ms SMT Verify possible using 3018 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 07:05:10] [INFO ] Deduced a trap composed of 364 places in 5538 ms of which 6 ms to minimize.
[2022-05-18 07:05:16] [INFO ] Deduced a trap composed of 392 places in 5253 ms of which 5 ms to minimize.
[2022-05-18 07:05:23] [INFO ] Deduced a trap composed of 397 places in 5329 ms of which 5 ms to minimize.
[2022-05-18 07:05:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 07:05:23] [INFO ] After 26778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5107/5107 places, 8400/8400 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5107 transition count 8399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5106 transition count 8399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 5105 transition count 8398
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 5105 transition count 8398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5105 transition count 8397
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5104 transition count 8397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 5103 transition count 8388
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 5103 transition count 8388
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 345 place count 5103 transition count 12443
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 682 place count 4766 transition count 12443
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 706 place count 4766 transition count 12443
Applied a total of 706 rules in 2946 ms. Remains 4766 /5107 variables (removed 341) and now considering 12443/8400 (removed -4043) transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/5107 places, 12443/8400 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19541 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19541 steps, saw 9101 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:05:29] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 07:05:30] [INFO ] Computed 1145 place invariants in 291 ms
[2022-05-18 07:05:30] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 07:05:31] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 295 ms returned sat
[2022-05-18 07:05:37] [INFO ] After 6554ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:05:37] [INFO ] State equation strengthened by 7402 read => feed constraints.
[2022-05-18 07:05:39] [INFO ] After 1691ms SMT Verify possible using 7402 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:05:39] [INFO ] After 9246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:05:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 07:05:40] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 296 ms returned sat
[2022-05-18 07:05:47] [INFO ] After 6808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:05:49] [INFO ] After 2649ms SMT Verify possible using 7402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 07:05:56] [INFO ] Deduced a trap composed of 499 places in 6766 ms of which 5 ms to minimize.
[2022-05-18 07:06:06] [INFO ] Deduced a trap composed of 337 places in 6784 ms of which 6 ms to minimize.
[2022-05-18 07:06:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 07:06:06] [INFO ] After 26540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 4766 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4766/4766 places, 12443/12443 transitions.
Applied a total of 0 rules in 728 ms. Remains 4766 /4766 variables (removed 0) and now considering 12443/12443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/4766 places, 12443/12443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4766/4766 places, 12443/12443 transitions.
Applied a total of 0 rules in 731 ms. Remains 4766 /4766 variables (removed 0) and now considering 12443/12443 (removed 0) transitions.
[2022-05-18 07:06:07] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 07:06:07] [INFO ] Computed 1145 place invariants in 291 ms
[2022-05-18 07:06:11] [INFO ] Implicit Places using invariants in 4253 ms returned []
Implicit Place search using SMT only with invariants took 4257 ms to find 0 implicit places.
[2022-05-18 07:06:11] [INFO ] Flow matrix only has 11557 transitions (discarded 886 similar events)
// Phase 1: matrix 11557 rows 4766 cols
[2022-05-18 07:06:12] [INFO ] Computed 1145 place invariants in 289 ms
[2022-05-18 07:06:23] [INFO ] Dead Transitions using invariants and state equation in 11810 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4766/4766 places, 12443/12443 transitions.
Graph (trivial) has 3479 edges and 4766 vertex of which 25 / 4766 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 43882 edges and 4742 vertex of which 4720 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t10114.t12025 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4334 transition count 10714
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4092 transition count 10233
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3851 transition count 9793
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3611 transition count 9395
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3411 transition count 9035
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3213 transition count 8713
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3051 transition count 8425
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2891 transition count 8171
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2763 transition count 7947
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2637 transition count 7753
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2539 transition count 7585
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2443 transition count 7443
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2371 transition count 7323
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2301 transition count 7225
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2251 transition count 7145
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2203 transition count 7083
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2171 transition count 7035
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2141 transition count 7001
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2123 transition count 6977
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2107 transition count 6963
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2099 transition count 6955
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2092 transition count 6953
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2090 transition count 6953
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 450 Pre rules applied. Total rules applied 6250 place count 2090 transition count 6503
Deduced a syphon composed of 450 places in 2 ms
Ensure Unique test removed 449 places
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 23 with 1349 rules applied. Total rules applied 7599 place count 1191 transition count 6503
Discarding 455 places :
Symmetric choice reduction at 23 with 455 rule applications. Total rules 8054 place count 736 transition count 6048
Iterating global reduction 23 with 455 rules applied. Total rules applied 8509 place count 736 transition count 6048
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8509 place count 736 transition count 6047
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8511 place count 735 transition count 6047
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9051 place count 195 transition count 1187
Iterating global reduction 23 with 540 rules applied. Total rules applied 9591 place count 195 transition count 1187
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10131 place count 195 transition count 647
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10182 place count 169 transition count 622
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 24 with 18 rules applied. Total rules applied 10200 place count 169 transition count 604
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 24 with 18 rules applied. Total rules applied 10218 place count 151 transition count 604
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10240 place count 129 transition count 406
Ensure Unique test removed 12 places
Iterating global reduction 25 with 34 rules applied. Total rules applied 10274 place count 117 transition count 406
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10296 place count 117 transition count 384
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10307 place count 106 transition count 285
Iterating global reduction 26 with 11 rules applied. Total rules applied 10318 place count 106 transition count 285
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10329 place count 95 transition count 274
Iterating global reduction 26 with 11 rules applied. Total rules applied 10340 place count 95 transition count 274
Applied a total of 10340 rules in 8410 ms. Remains 95 /4766 variables (removed 4671) and now considering 274/12443 (removed 12169) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 274 rows 95 cols
[2022-05-18 07:06:32] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-18 07:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 07:06:32] [INFO ] [Real]Absence check using 3 positive and 30 generalized place invariants in 4 ms returned sat
[2022-05-18 07:06:32] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:06:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 07:06:32] [INFO ] [Nat]Absence check using 3 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-18 07:06:32] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:06:32] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 07:06:32] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 07:06:32] [INFO ] Flatten gal took : 23 ms
[2022-05-18 07:06:32] [INFO ] Flatten gal took : 15 ms
[2022-05-18 07:06:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10991127638226833903.gal : 3 ms
[2022-05-18 07:06:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8900117058648600418.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3032111348309767297;'/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/ReachabilityCardinality10991127638226833903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8900117058648600418.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/ReachabilityCardinality8900117058648600418.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,16,0.071555,8292,2,515,6,1420,6,0,624,419,0
Total reachable state count : 16

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,0.072353,8732,2,96,6,1420,7,0,628,419,0
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 5107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5107/5107 places, 8400/8400 transitions.
Applied a total of 0 rules in 502 ms. Remains 5107 /5107 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
[2022-05-18 07:06:33] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:06:33] [INFO ] Computed 1145 place invariants in 221 ms
[2022-05-18 07:06:36] [INFO ] Implicit Places using invariants in 3643 ms returned []
[2022-05-18 07:06:36] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:06:37] [INFO ] Computed 1145 place invariants in 219 ms
[2022-05-18 07:06:40] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 7292 ms to find 0 implicit places.
[2022-05-18 07:06:40] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:06:40] [INFO ] Computed 1145 place invariants in 220 ms
[2022-05-18 07:06:45] [INFO ] Dead Transitions using invariants and state equation in 4517 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5107/5107 places, 8400/8400 transitions.
Computed a total of 2508 stabilizing places and 3224 stable transitions
Computed a total of 2508 stabilizing places and 3224 stable transitions
Detected a total of 2508/5107 stabilizing places and 3224/8400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 149 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :1
Finished Best-First random walk after 8632 steps, including 19 resets, run visited all 1 properties in 48 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1499 reset in 1369 ms.
Product exploration explored 100000 steps with 1498 reset in 1417 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 5107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5107/5107 places, 8400/8400 transitions.
Applied a total of 0 rules in 527 ms. Remains 5107 /5107 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
[2022-05-18 07:06:50] [INFO ] Redundant transitions in 705 ms returned []
[2022-05-18 07:06:50] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:06:50] [INFO ] Computed 1145 place invariants in 220 ms
[2022-05-18 07:06:55] [INFO ] Dead Transitions using invariants and state equation in 4486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5107/5107 places, 8400/8400 transitions.
Product exploration explored 100000 steps with 1498 reset in 2195 ms.
Product exploration explored 100000 steps with 1501 reset in 2281 ms.
Built C files in :
/tmp/ltsmin16390055538355805280
[2022-05-18 07:06:59] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16390055538355805280
Running compilation step : cd /tmp/ltsmin16390055538355805280;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16390055538355805280;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16390055538355805280;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 5107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5107/5107 places, 8400/8400 transitions.
Applied a total of 0 rules in 578 ms. Remains 5107 /5107 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
[2022-05-18 07:07:03] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:07:03] [INFO ] Computed 1145 place invariants in 265 ms
[2022-05-18 07:07:07] [INFO ] Implicit Places using invariants in 4575 ms returned []
[2022-05-18 07:07:07] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:07:08] [INFO ] Computed 1145 place invariants in 212 ms
[2022-05-18 07:07:12] [INFO ] Implicit Places using invariants and state equation in 4479 ms returned []
Implicit Place search using SMT with State Equation took 9057 ms to find 0 implicit places.
[2022-05-18 07:07:12] [INFO ] Flow matrix only has 7800 transitions (discarded 600 similar events)
// Phase 1: matrix 7800 rows 5107 cols
[2022-05-18 07:07:12] [INFO ] Computed 1145 place invariants in 207 ms
[2022-05-18 07:07:23] [INFO ] Dead Transitions using invariants and state equation in 11543 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5107/5107 places, 8400/8400 transitions.
Built C files in :
/tmp/ltsmin3275404551482158290
[2022-05-18 07:07:23] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3275404551482158290
Running compilation step : cd /tmp/ltsmin3275404551482158290;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3275404551482158290;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3275404551482158290;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 07:07:28] [INFO ] Flatten gal took : 448 ms
[2022-05-18 07:07:28] [INFO ] Flatten gal took : 475 ms
[2022-05-18 07:07:28] [INFO ] Time to serialize gal into /tmp/LTL13182369499718025569.gal : 59 ms
[2022-05-18 07:07:28] [INFO ] Time to serialize properties into /tmp/LTL11223867811709727798.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/LTL13182369499718025569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11223867811709727798.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/LTL1318236...268
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(Node19HasTheLeafSetOfLx2ToRep...175
Formula 0 simplified : !XG(X"((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))" | FG"(Node19HasTheLeafSetOfLx2ToReplaceNod...162
Detected timeout of ITS tools.
[2022-05-18 07:07:44] [INFO ] Flatten gal took : 423 ms
[2022-05-18 07:07:44] [INFO ] Applying decomposition
[2022-05-18 07:07:44] [INFO ] Flatten gal took : 428 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/graph7381732831359274049.txt' '-o' '/tmp/graph7381732831359274049.bin' '-w' '/tmp/graph7381732831359274049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7381732831359274049.bin' '-l' '-1' '-v' '-w' '/tmp/graph7381732831359274049.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:07:45] [INFO ] Decomposing Gal with order
[2022-05-18 07:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:07:48] [INFO ] Removed a total of 7069 redundant transitions.
[2022-05-18 07:07:48] [INFO ] Flatten gal took : 2309 ms
[2022-05-18 07:07:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4240 labels/synchronizations in 547 ms.
[2022-05-18 07:07:49] [INFO ] Time to serialize gal into /tmp/LTL7552783616368299763.gal : 89 ms
[2022-05-18 07:07:49] [INFO ] Time to serialize properties into /tmp/LTL12254870857148282290.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/LTL7552783616368299763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12254870857148282290.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/LTL7552783...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i27.i1.u407.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i27.i1.u398.LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(i26.u...208
Formula 0 simplified : !XG(X"((i27.i1.u407.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i27.i1.u398.LeafSetOfRx3IsSentToNode14<1))" | FG"(i26.u406.Nod...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8190968781951064982
[2022-05-18 07:08:04] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8190968781951064982
Running compilation step : cd /tmp/ltsmin8190968781951064982;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8190968781951064982;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8190968781951064982;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-04 finished in 216489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||G(!p0)||p1)))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), false, false, p0]
Support contains 4 out of 16492 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 16492/16492 places, 24169/24169 transitions.
Drop transitions removed 5400 transitions
Trivial Post-agglo rules discarded 5400 transitions
Performed 5400 trivial Post agglomeration. Transition count delta: 5400
Iterating post reduction 0 with 5400 rules applied. Total rules applied 5400 place count 16492 transition count 18769
Reduce places removed 5400 places and 0 transitions.
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 10800 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 14 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 11700 place count 10642 transition count 18319
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16650 place count 5692 transition count 13369
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21600 place count 5692 transition count 13369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21600 place count 5692 transition count 13351
Deduced a syphon composed of 18 places in 9 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 21636 place count 5674 transition count 13351
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 22185 place count 5125 transition count 8410
Iterating global reduction 2 with 549 rules applied. Total rules applied 22734 place count 5125 transition count 8410
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 7 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 22782 place count 5101 transition count 8386
Applied a total of 22782 rules in 4280 ms. Remains 5101 /16492 variables (removed 11391) and now considering 8386/24169 (removed 15783) transitions.
[2022-05-18 07:08:12] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:08:12] [INFO ] Computed 1145 place invariants in 273 ms
[2022-05-18 07:08:13] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2022-05-18 07:08:13] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:08:14] [INFO ] Computed 1145 place invariants in 296 ms
[2022-05-18 07:08:14] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
[2022-05-18 07:08:14] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:08:15] [INFO ] Computed 1145 place invariants in 294 ms
[2022-05-18 07:08:15] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 5101/16492 places, 8386/24169 transitions.
Finished structural reductions, in 1 iterations. Remains : 5101/16492 places, 8386/24169 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09 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=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1684 1) (LT s2903 1)), p1:(AND (GEQ s2863 1) (GEQ s5046 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1539 reset in 1860 ms.
Product exploration explored 100000 steps with 1540 reset in 2355 ms.
Computed a total of 2501 stabilizing places and 3209 stable transitions
Computed a total of 2501 stabilizing places and 3209 stable transitions
Detected a total of 2501/5101 stabilizing places and 3209/8386 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 665 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 153 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 16496 steps, run timeout after 3006 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 16496 steps, saw 7897 distinct states, run finished after 3007 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:08:24] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:08:24] [INFO ] Computed 1145 place invariants in 296 ms
[2022-05-18 07:08:25] [INFO ] [Real]Absence check using 49 positive place invariants in 163 ms returned sat
[2022-05-18 07:08:26] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 534 ms returned sat
[2022-05-18 07:08:26] [INFO ] After 1662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:08:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 150 ms returned sat
[2022-05-18 07:08:27] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 538 ms returned sat
[2022-05-18 07:08:36] [INFO ] After 8535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:08:36] [INFO ] State equation strengthened by 3010 read => feed constraints.
[2022-05-18 07:08:43] [INFO ] After 6863ms SMT Verify possible using 3010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 07:08:49] [INFO ] Deduced a trap composed of 940 places in 6117 ms of which 5 ms to minimize.
[2022-05-18 07:08:56] [INFO ] Deduced a trap composed of 699 places in 6319 ms of which 5 ms to minimize.
[2022-05-18 07:08:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 07:08:56] [INFO ] After 30285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5101/5101 places, 8386/8386 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5100 transition count 8377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5100 transition count 8377
Free-agglomeration rule (complex) applied 323 times.
Iterating global reduction 0 with 323 rules applied. Total rules applied 325 place count 5100 transition count 12366
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 0 with 323 rules applied. Total rules applied 648 place count 4777 transition count 12366
Applied a total of 648 rules in 2170 ms. Remains 4777 /5101 variables (removed 324) and now considering 12366/8386 (removed -3980) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/5101 places, 12366/8386 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 17155 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17155 steps, saw 8049 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:09:02] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:09:02] [INFO ] Computed 1145 place invariants in 344 ms
[2022-05-18 07:09:03] [INFO ] [Real]Absence check using 49 positive place invariants in 149 ms returned sat
[2022-05-18 07:09:03] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 314 ms returned sat
[2022-05-18 07:09:11] [INFO ] After 8666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:09:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 07:09:12] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 262 ms returned sat
[2022-05-18 07:09:19] [INFO ] After 6852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:09:19] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 07:09:28] [INFO ] After 9558ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 07:09:28] [INFO ] After 17299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 720 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 747 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
[2022-05-18 07:09:30] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:09:30] [INFO ] Computed 1145 place invariants in 271 ms
[2022-05-18 07:09:34] [INFO ] Implicit Places using invariants in 4171 ms returned []
Implicit Place search using SMT only with invariants took 4172 ms to find 0 implicit places.
[2022-05-18 07:09:34] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:09:34] [INFO ] Computed 1145 place invariants in 275 ms
[2022-05-18 07:09:40] [INFO ] Dead Transitions using invariants and state equation in 6402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Graph (trivial) has 3463 edges and 4777 vertex of which 24 / 4777 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 43329 edges and 4754 vertex of which 4732 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t10114.t12025 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 4348 transition count 10691
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 4126 transition count 10272
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3916 transition count 9910
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3720 transition count 9606
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3567 transition count 9352
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 3429 transition count 9148
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 6 with 265 rules applied. Total rules applied 2952 place count 3326 transition count 8986
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 3238 transition count 8866
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 3177 transition count 8780
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 3131 transition count 8727
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 3104 transition count 8701
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 3091 transition count 8689
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 3079 transition count 8689
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 450 Pre rules applied. Total rules applied 3496 place count 3079 transition count 8239
Deduced a syphon composed of 450 places in 2 ms
Ensure Unique test removed 450 places
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 13 with 1350 rules applied. Total rules applied 4846 place count 2179 transition count 8239
Discarding 456 places :
Symmetric choice reduction at 13 with 456 rule applications. Total rules 5302 place count 1723 transition count 7783
Iterating global reduction 13 with 456 rules applied. Total rules applied 5758 place count 1723 transition count 7783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5758 place count 1723 transition count 7782
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5760 place count 1722 transition count 7782
Discarding 388 places :
Symmetric choice reduction at 13 with 388 rule applications. Total rules 6148 place count 1334 transition count 4290
Iterating global reduction 13 with 388 rules applied. Total rules applied 6536 place count 1334 transition count 4290
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 13 with 388 rules applied. Total rules applied 6924 place count 1334 transition count 3902
Performed 859 Post agglomeration using F-continuation condition.Transition count delta: 859
Deduced a syphon composed of 859 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 860 places and 0 transitions.
Iterating global reduction 14 with 1719 rules applied. Total rules applied 8643 place count 474 transition count 3043
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 9478 place count 474 transition count 2208
Drop transitions removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 15 with 153 rules applied. Total rules applied 9631 place count 474 transition count 2055
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9784 place count 321 transition count 2055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9784 place count 321 transition count 2054
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9786 place count 320 transition count 2054
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9938 place count 168 transition count 686
Iterating global reduction 16 with 152 rules applied. Total rules applied 10090 place count 168 transition count 686
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 16 with 152 rules applied. Total rules applied 10242 place count 168 transition count 534
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 17 with 18 rules applied. Total rules applied 10260 place count 168 transition count 516
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 17 with 18 rules applied. Total rules applied 10278 place count 150 transition count 516
Discarding 22 places :
Symmetric choice reduction at 18 with 22 rule applications. Total rules 10300 place count 128 transition count 318
Ensure Unique test removed 11 places
Iterating global reduction 18 with 33 rules applied. Total rules applied 10333 place count 117 transition count 318
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 18 with 22 rules applied. Total rules applied 10355 place count 117 transition count 296
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10366 place count 106 transition count 197
Iterating global reduction 19 with 11 rules applied. Total rules applied 10377 place count 106 transition count 197
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10388 place count 95 transition count 186
Iterating global reduction 19 with 11 rules applied. Total rules applied 10399 place count 95 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10400 place count 95 transition count 186
Applied a total of 10400 rules in 11927 ms. Remains 95 /4777 variables (removed 4682) and now considering 186/12366 (removed 12180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 95 cols
[2022-05-18 07:09:52] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-18 07:09:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 07:09:52] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 4 ms returned sat
[2022-05-18 07:09:52] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:09:52] [INFO ] After 54ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 07:09:52] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-18 07:09:52] [INFO ] Flatten gal took : 11 ms
[2022-05-18 07:09:52] [INFO ] Flatten gal took : 9 ms
[2022-05-18 07:09:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17763118012431656504.gal : 2 ms
[2022-05-18 07:09:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13411098614832094206.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3558794288885665020;'/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/ReachabilityCardinality17763118012431656504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13411098614832094206.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/ReachabilityCardinality13411098614832094206.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 123
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :123 after 145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145 after 458
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :458 after 1037
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1037 after 1857
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1857 after 3577
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3577 after 27600
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :27600 after 226514
Detected timeout of ITS tools.
[2022-05-18 07:10:07] [INFO ] Flatten gal took : 15 ms
[2022-05-18 07:10:07] [INFO ] Applying decomposition
[2022-05-18 07:10:07] [INFO ] Flatten gal took : 9 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/graph8233512150856467735.txt' '-o' '/tmp/graph8233512150856467735.bin' '-w' '/tmp/graph8233512150856467735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8233512150856467735.bin' '-l' '-1' '-v' '-w' '/tmp/graph8233512150856467735.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:10:08] [INFO ] Decomposing Gal with order
[2022-05-18 07:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:10:08] [INFO ] Removed a total of 451 redundant transitions.
[2022-05-18 07:10:08] [INFO ] Flatten gal took : 16 ms
[2022-05-18 07:10:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 2 ms.
[2022-05-18 07:10:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1324364068353577530.gal : 1 ms
[2022-05-18 07:10:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3511120056241167659.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3558794288885665020;'/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/ReachabilityCardinality1324364068353577530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3511120056241167659.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality3511120056241167659.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 112
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :112 after 236
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :236 after 484
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\_mod\_flat,1.15226e+06,1.47704,43392,3620,8279,36937,23980,403,96214,226,423529,0
Total reachable state count : 1152256

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,2,1.47997,43656,22,92,36937,23980,404,96214,229,423529,2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 406 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 5101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5101/5101 places, 8386/8386 transitions.
Applied a total of 0 rules in 398 ms. Remains 5101 /5101 variables (removed 0) and now considering 8386/8386 (removed 0) transitions.
[2022-05-18 07:10:10] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:10:10] [INFO ] Computed 1145 place invariants in 212 ms
[2022-05-18 07:10:16] [INFO ] Implicit Places using invariants in 5516 ms returned []
[2022-05-18 07:10:16] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:10:16] [INFO ] Computed 1145 place invariants in 210 ms
[2022-05-18 07:10:21] [INFO ] Implicit Places using invariants and state equation in 5459 ms returned []
Implicit Place search using SMT with State Equation took 10976 ms to find 0 implicit places.
[2022-05-18 07:10:21] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:10:21] [INFO ] Computed 1145 place invariants in 235 ms
[2022-05-18 07:10:26] [INFO ] Dead Transitions using invariants and state equation in 5335 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5101/5101 places, 8386/8386 transitions.
Computed a total of 2501 stabilizing places and 3209 stable transitions
Computed a total of 2501 stabilizing places and 3209 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 154 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25060 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25060 steps, saw 11793 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:10:30] [INFO ] Flow matrix only has 7786 transitions (discarded 600 similar events)
// Phase 1: matrix 7786 rows 5101 cols
[2022-05-18 07:10:30] [INFO ] Computed 1145 place invariants in 206 ms
[2022-05-18 07:10:31] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2022-05-18 07:10:31] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 339 ms returned sat
[2022-05-18 07:10:31] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:10:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2022-05-18 07:10:32] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 336 ms returned sat
[2022-05-18 07:10:36] [INFO ] After 4344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:10:36] [INFO ] State equation strengthened by 3010 read => feed constraints.
[2022-05-18 07:10:41] [INFO ] After 4785ms SMT Verify possible using 3010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 07:10:47] [INFO ] Deduced a trap composed of 940 places in 5413 ms of which 5 ms to minimize.
[2022-05-18 07:10:52] [INFO ] Deduced a trap composed of 699 places in 5204 ms of which 4 ms to minimize.
[2022-05-18 07:10:58] [INFO ] Deduced a trap composed of 548 places in 5367 ms of which 5 ms to minimize.
[2022-05-18 07:10:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 07:10:58] [INFO ] After 27483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5101/5101 places, 8386/8386 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5100 transition count 8377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5100 transition count 8377
Free-agglomeration rule (complex) applied 323 times.
Iterating global reduction 0 with 323 rules applied. Total rules applied 325 place count 5100 transition count 12366
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 0 with 323 rules applied. Total rules applied 648 place count 4777 transition count 12366
Applied a total of 648 rules in 1693 ms. Remains 4777 /5101 variables (removed 324) and now considering 12366/8386 (removed -3980) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/5101 places, 12366/8386 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21806 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21806 steps, saw 10114 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 07:11:04] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:11:04] [INFO ] Computed 1145 place invariants in 272 ms
[2022-05-18 07:11:05] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2022-05-18 07:11:05] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 294 ms returned sat
[2022-05-18 07:11:12] [INFO ] After 7603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 07:11:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 07:11:12] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 298 ms returned sat
[2022-05-18 07:11:19] [INFO ] After 6772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 07:11:19] [INFO ] State equation strengthened by 7314 read => feed constraints.
[2022-05-18 07:11:29] [INFO ] After 9578ms SMT Verify possible using 7314 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 07:11:29] [INFO ] After 17342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 673 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4777/4777 places, 12366/12366 transitions.
Applied a total of 0 rules in 682 ms. Remains 4777 /4777 variables (removed 0) and now considering 12366/12366 (removed 0) transitions.
[2022-05-18 07:11:30] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:11:31] [INFO ] Computed 1145 place invariants in 278 ms
[2022-05-18 07:11:35] [INFO ] Implicit Places using invariants in 4687 ms returned []
Implicit Place search using SMT only with invariants took 4688 ms to find 0 implicit places.
[2022-05-18 07:11:35] [INFO ] Flow matrix only has 11492 transitions (discarded 874 similar events)
// Phase 1: matrix 11492 rows 4777 cols
[2022-05-18 07:11:35] [INFO ] Computed 1145 place invariants in 275 ms
[2022-05-18 07:11:42] [INFO ] Dead Transitions using invariants and state equation in 6946 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4777/4777 places, 12366/12366 transitions.
Graph (trivial) has 3463 edges and 4777 vertex of which 24 / 4777 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 591 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1452 transitions.
Graph (complete) has 43329 edges and 4754 vertex of which 4732 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t10114.t12025 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 4348 transition count 10691
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 1 with 641 rules applied. Total rules applied 866 place count 4126 transition count 10272
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 2 with 572 rules applied. Total rules applied 1438 place count 3916 transition count 9910
Ensure Unique test removed 32 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 3 with 500 rules applied. Total rules applied 1938 place count 3720 transition count 9606
Ensure Unique test removed 2 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 4 with 407 rules applied. Total rules applied 2345 place count 3567 transition count 9352
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 342 rules applied. Total rules applied 2687 place count 3429 transition count 9148
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 6 with 265 rules applied. Total rules applied 2952 place count 3326 transition count 8986
Ensure Unique test removed 16 places
Reduce places removed 88 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 7 with 208 rules applied. Total rules applied 3160 place count 3238 transition count 8866
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 8 with 147 rules applied. Total rules applied 3307 place count 3177 transition count 8780
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 9 with 99 rules applied. Total rules applied 3406 place count 3131 transition count 8727
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 10 with 53 rules applied. Total rules applied 3459 place count 3104 transition count 8701
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 25 rules applied. Total rules applied 3484 place count 3091 transition count 8689
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 3496 place count 3079 transition count 8689
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 450 Pre rules applied. Total rules applied 3496 place count 3079 transition count 8239
Deduced a syphon composed of 450 places in 3 ms
Ensure Unique test removed 450 places
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 13 with 1350 rules applied. Total rules applied 4846 place count 2179 transition count 8239
Discarding 456 places :
Symmetric choice reduction at 13 with 456 rule applications. Total rules 5302 place count 1723 transition count 7783
Iterating global reduction 13 with 456 rules applied. Total rules applied 5758 place count 1723 transition count 7783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5758 place count 1723 transition count 7782
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5760 place count 1722 transition count 7782
Discarding 388 places :
Symmetric choice reduction at 13 with 388 rule applications. Total rules 6148 place count 1334 transition count 4290
Iterating global reduction 13 with 388 rules applied. Total rules applied 6536 place count 1334 transition count 4290
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 13 with 388 rules applied. Total rules applied 6924 place count 1334 transition count 3902
Performed 859 Post agglomeration using F-continuation condition.Transition count delta: 859
Deduced a syphon composed of 859 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 860 places and 0 transitions.
Iterating global reduction 14 with 1719 rules applied. Total rules applied 8643 place count 474 transition count 3043
Drop transitions removed 835 transitions
Reduce isomorphic transitions removed 835 transitions.
Iterating post reduction 14 with 835 rules applied. Total rules applied 9478 place count 474 transition count 2208
Drop transitions removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 15 with 153 rules applied. Total rules applied 9631 place count 474 transition count 2055
Ensure Unique test removed 153 places
Iterating post reduction 15 with 153 rules applied. Total rules applied 9784 place count 321 transition count 2055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 9784 place count 321 transition count 2054
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9786 place count 320 transition count 2054
Discarding 152 places :
Symmetric choice reduction at 16 with 152 rule applications. Total rules 9938 place count 168 transition count 686
Iterating global reduction 16 with 152 rules applied. Total rules applied 10090 place count 168 transition count 686
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 16 with 152 rules applied. Total rules applied 10242 place count 168 transition count 534
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 17 with 18 rules applied. Total rules applied 10260 place count 168 transition count 516
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 17 with 18 rules applied. Total rules applied 10278 place count 150 transition count 516
Discarding 22 places :
Symmetric choice reduction at 18 with 22 rule applications. Total rules 10300 place count 128 transition count 318
Ensure Unique test removed 11 places
Iterating global reduction 18 with 33 rules applied. Total rules applied 10333 place count 117 transition count 318
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 18 with 22 rules applied. Total rules applied 10355 place count 117 transition count 296
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10366 place count 106 transition count 197
Iterating global reduction 19 with 11 rules applied. Total rules applied 10377 place count 106 transition count 197
Discarding 11 places :
Symmetric choice reduction at 19 with 11 rule applications. Total rules 10388 place count 95 transition count 186
Iterating global reduction 19 with 11 rules applied. Total rules applied 10399 place count 95 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10400 place count 95 transition count 186
Applied a total of 10400 rules in 11605 ms. Remains 95 /4777 variables (removed 4682) and now considering 186/12366 (removed 12180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 95 cols
[2022-05-18 07:11:54] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-18 07:11:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-18 07:11:54] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-18 07:11:54] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 07:11:54] [INFO ] After 49ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 07:11:54] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-18 07:11:54] [INFO ] Flatten gal took : 11 ms
[2022-05-18 07:11:54] [INFO ] Flatten gal took : 16 ms
[2022-05-18 07:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3667510343941154683.gal : 2 ms
[2022-05-18 07:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17881015392927819495.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7262842093790012006;'/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/ReachabilityCardinality3667510343941154683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17881015392927819495.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/ReachabilityCardinality17881015392927819495.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 123
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :123 after 145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145 after 458
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :458 after 1037
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1037 after 1857
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1857 after 3577
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3577 after 27600
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :27600 after 226514
Detected timeout of ITS tools.
[2022-05-18 07:12:09] [INFO ] Flatten gal took : 10 ms
[2022-05-18 07:12:09] [INFO ] Applying decomposition
[2022-05-18 07:12:09] [INFO ] Flatten gal took : 10 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/graph4811861523857152790.txt' '-o' '/tmp/graph4811861523857152790.bin' '-w' '/tmp/graph4811861523857152790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4811861523857152790.bin' '-l' '-1' '-v' '-w' '/tmp/graph4811861523857152790.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:12:09] [INFO ] Decomposing Gal with order
[2022-05-18 07:12:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:12:09] [INFO ] Removed a total of 432 redundant transitions.
[2022-05-18 07:12:09] [INFO ] Flatten gal took : 17 ms
[2022-05-18 07:12:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 1 ms.
[2022-05-18 07:12:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16568322306203838833.gal : 1 ms
[2022-05-18 07:12:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15078433349034127001.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7262842093790012006;'/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/ReachabilityCardinality16568322306203838833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15078433349034127001.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality15078433349034127001.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 187
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :187 after 305
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :305 after 3642
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3642 after 4447
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4447 after 18620
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18620 after 24460
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :24460 after 24903
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :24903 after 49296
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :49296 after 151775
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13520629802411000565
[2022-05-18 07:12:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13520629802411000565
Running compilation step : cd /tmp/ltsmin13520629802411000565;'/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 362 ms.
Running link step : cd /tmp/ltsmin13520629802411000565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13520629802411000565;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 92 ms.
Found Violation
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1538 reset in 1396 ms.
Product exploration explored 100000 steps with 1540 reset in 1415 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 5101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5101/5101 places, 8386/8386 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5100 transition count 8377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5100 transition count 8377
Applied a total of 2 rules in 904 ms. Remains 5100 /5101 variables (removed 1) and now considering 8377/8386 (removed 9) transitions.
[2022-05-18 07:12:29] [INFO ] Redundant transitions in 707 ms returned []
[2022-05-18 07:12:29] [INFO ] Flow matrix only has 7777 transitions (discarded 600 similar events)
// Phase 1: matrix 7777 rows 5100 cols
[2022-05-18 07:12:30] [INFO ] Computed 1145 place invariants in 210 ms
[2022-05-18 07:12:35] [INFO ] Dead Transitions using invariants and state equation in 5437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5100/5101 places, 8377/8386 transitions.
Finished structural reductions, in 1 iterations. Remains : 5100/5101 places, 8377/8386 transitions.
Product exploration explored 100000 steps with 1540 reset in 2209 ms.
Product exploration explored 100000 steps with 1540 reset in 1956 ms.
Built C files in :
/tmp/ltsmin8653495421059380970
[2022-05-18 07:12:39] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8653495421059380970
Running compilation step : cd /tmp/ltsmin8653495421059380970;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8653495421059380970;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8653495421059380970;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5101/5101 places, 8386/8386 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5100 transition count 8377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5100 transition count 8377
Applied a total of 2 rules in 743 ms. Remains 5100 /5101 variables (removed 1) and now considering 8377/8386 (removed 9) transitions.
[2022-05-18 07:12:43] [INFO ] Flow matrix only has 7777 transitions (discarded 600 similar events)
// Phase 1: matrix 7777 rows 5100 cols
[2022-05-18 07:12:43] [INFO ] Computed 1145 place invariants in 207 ms
[2022-05-18 07:12:47] [INFO ] Implicit Places using invariants in 4268 ms returned []
[2022-05-18 07:12:47] [INFO ] Flow matrix only has 7777 transitions (discarded 600 similar events)
// Phase 1: matrix 7777 rows 5100 cols
[2022-05-18 07:12:47] [INFO ] Computed 1145 place invariants in 208 ms
[2022-05-18 07:12:51] [INFO ] Implicit Places using invariants and state equation in 4273 ms returned []
Implicit Place search using SMT with State Equation took 8543 ms to find 0 implicit places.
[2022-05-18 07:12:51] [INFO ] Flow matrix only has 7777 transitions (discarded 600 similar events)
// Phase 1: matrix 7777 rows 5100 cols
[2022-05-18 07:12:52] [INFO ] Computed 1145 place invariants in 212 ms
[2022-05-18 07:12:57] [INFO ] Dead Transitions using invariants and state equation in 5291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5100/5101 places, 8377/8386 transitions.
Finished structural reductions, in 1 iterations. Remains : 5100/5101 places, 8377/8386 transitions.
Built C files in :
/tmp/ltsmin1566327237634261065
[2022-05-18 07:12:57] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1566327237634261065
Running compilation step : cd /tmp/ltsmin1566327237634261065;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1566327237634261065;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1566327237634261065;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 07:13:00] [INFO ] Flatten gal took : 258 ms
[2022-05-18 07:13:01] [INFO ] Flatten gal took : 284 ms
[2022-05-18 07:13:01] [INFO ] Time to serialize gal into /tmp/LTL14660259552334297704.gal : 34 ms
[2022-05-18 07:13:01] [INFO ] Time to serialize properties into /tmp/LTL7288166358054616199.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/LTL14660259552334297704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7288166358054616199.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/LTL1466025...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("((Node6HasDetectedCrashOfNode18<1)||(Node18IsTheNodeMaster<1))")))||(G("((Node6HasDetectedCrashOfNode18>=1)&&(Node18IsTheN...260
Formula 0 simplified : !G("((Node17ManageTheCrashOfNode16>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1))" | XG"((Node6HasDetectedCrashOfNode18<1)||(Node18...246
Detected timeout of ITS tools.
[2022-05-18 07:13:16] [INFO ] Flatten gal took : 240 ms
[2022-05-18 07:13:16] [INFO ] Applying decomposition
[2022-05-18 07:13:16] [INFO ] Flatten gal took : 305 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/graph6302352321268818642.txt' '-o' '/tmp/graph6302352321268818642.bin' '-w' '/tmp/graph6302352321268818642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6302352321268818642.bin' '-l' '-1' '-v' '-w' '/tmp/graph6302352321268818642.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:13:17] [INFO ] Decomposing Gal with order
[2022-05-18 07:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:13:18] [INFO ] Removed a total of 7043 redundant transitions.
[2022-05-18 07:13:19] [INFO ] Flatten gal took : 1339 ms
[2022-05-18 07:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4976 labels/synchronizations in 372 ms.
[2022-05-18 07:13:19] [INFO ] Time to serialize gal into /tmp/LTL5610584326099842517.gal : 62 ms
[2022-05-18 07:13:19] [INFO ] Time to serialize properties into /tmp/LTL13578387427735643832.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/LTL5610584326099842517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13578387427735643832.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/LTL5610584...246
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("((i15.i0.u128.Node6HasDetectedCrashOfNode18<1)||(i0.u1.Node18IsTheNodeMaster<1))")))||(G("((i15.i0.u128.Node6HasDetectedCr...320
Formula 0 simplified : !G("((i18.i0.u364.Node17ManageTheCrashOfNode16>=1)&&(i18.i0.u363.Rx6IsAtTheRightExtremityOfTheLeafSet>=1))" | XG"((i15.i0.u128.Node6...306
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13322803007636369923
[2022-05-18 07:13:34] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13322803007636369923
Running compilation step : cd /tmp/ltsmin13322803007636369923;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13322803007636369923;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13322803007636369923;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S24C09-LTLFireability-09 finished in 329954 ms.
[2022-05-18 07:13:38] [INFO ] Flatten gal took : 667 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7133767709670035774
[2022-05-18 07:13:39] [INFO ] Too many transitions (24169) to apply POR reductions. Disabling POR matrices.
[2022-05-18 07:13:39] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7133767709670035774
Running compilation step : cd /tmp/ltsmin7133767709670035774;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-18 07:13:39] [INFO ] Applying decomposition
[2022-05-18 07:13:40] [INFO ] Flatten gal took : 835 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/graph17815346374398149663.txt' '-o' '/tmp/graph17815346374398149663.bin' '-w' '/tmp/graph17815346374398149663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17815346374398149663.bin' '-l' '-1' '-v' '-w' '/tmp/graph17815346374398149663.weights' '-q' '0' '-e' '0.001'
[2022-05-18 07:13:41] [INFO ] Decomposing Gal with order
[2022-05-18 07:13:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 07:13:47] [INFO ] Removed a total of 15451 redundant transitions.
[2022-05-18 07:13:47] [INFO ] Flatten gal took : 2982 ms
[2022-05-18 07:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1611 labels/synchronizations in 357 ms.
[2022-05-18 07:13:48] [INFO ] Time to serialize gal into /tmp/LTLFireability7395585307312789442.gal : 93 ms
[2022-05-18 07:13:48] [INFO ] Time to serialize properties into /tmp/LTLFireability3640067207271430421.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/LTLFireability7395585307312789442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3640067207271430421.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 2 LTL properties
Checking formula 0 : !((X(G((X("((i16.u383.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i16.u383.LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(i2.u373.Nod...201
Formula 0 simplified : !XG(X"((i16.u383.Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(i16.u383.LeafSetOfRx3IsSentToNode14<1))" | FG"(i2.u373.Node19HasT...188
Compilation finished in 341977 ms.
Running link step : cd /tmp/ltsmin7133767709670035774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 177 ms.
Running LTSmin : cd /tmp/ltsmin7133767709670035774;'/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([]((X((LTLAPp0==true))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2022-05-18 07:29:33] [INFO ] Flatten gal took : 4408 ms
[2022-05-18 07:29:34] [INFO ] Time to serialize gal into /tmp/LTLFireability518469317503249781.gal : 221 ms
[2022-05-18 07:29:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1079074945446559441.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/LTLFireability518469317503249781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1079074945446559441.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/LTLFireabi...287
Read 2 LTL properties
Checking formula 0 : !((X(G((X("((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))"))||(F(G("(Node19HasTheLeafSetOfLx2ToRep...175
Formula 0 simplified : !XG(X"((Node14HasAskedItsLeafSetToRx3ToReplaceNode17<1)||(LeafSetOfRx3IsSentToNode14<1))" | FG"(Node19HasTheLeafSetOfLx2ToReplaceNod...162
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin7133767709670035774;'/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([]((X((LTLAPp0==true))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7133767709670035774;'/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([]((LTLAPp2==true)))||[](!(LTLAPp2==true))||(LTLAPp3==true)))' '--buchi-type=spotba'

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="MultiCrashLeafsetExtension-PT-S24C09"
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 MultiCrashLeafsetExtension-PT-S24C09, 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-165271821300764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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