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.r024-tall-165251918000067.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 BridgeAndVehicles-COL-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918000067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.9K Apr 29 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 23:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 23:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:33 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 BridgeAndVehicles-COL-V50P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652546500052

Running Version 202205111006
[2022-05-14 16:41:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-14 16:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 16:41:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-14 16:41:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 16:41:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2022-05-14 16:41:41] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-14 16:41:42] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 9 ms.
[2022-05-14 16:41:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 16:41:42] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-14 16:41:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 16:41:42] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-14 16:41:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-14 16:41:42] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-14 16:41:42] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-14 16:41:42] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 112 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2022-05-14 16:41:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-14 16:41:42] [INFO ] Flatten gal took : 14 ms
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 16:41:42] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 16:41:43] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 59 ms.
[2022-05-14 16:41:43] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 44 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:41:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 16:41:43] [INFO ] Computed 7 place invariants in 19 ms
[2022-05-14 16:41:43] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
[2022-05-14 16:41:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 16:41:43] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 16:41:43] [INFO ] Implicit Places using invariants in 202 ms returned []
[2022-05-14 16:41:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 16:41:43] [INFO ] Computed 7 place invariants in 14 ms
[2022-05-14 16:41:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:44] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2022-05-14 16:41:44] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 16:41:44] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-14 16:41:44] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 1328/1328 transitions.
Support contains 13 out of 128 places after structural reductions.
[2022-05-14 16:41:44] [INFO ] Flatten gal took : 135 ms
[2022-05-14 16:41:44] [INFO ] Flatten gal took : 83 ms
[2022-05-14 16:41:45] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-14 16:41:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 16:41:45] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 16:41:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 16:41:45] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 16:41:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2022-05-14 16:41:45] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:45] [INFO ] After 34ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:45] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-14 16:41:46] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 173 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:41:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:41:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:41:46] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/128 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10008 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 414565 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 414565 steps, saw 113399 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 16:41:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:41:49] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 16:41:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:41:49] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 16:41:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 16:41:49] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:50] [INFO ] After 37ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:50] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-14 16:41:50] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 66 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 102 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:41:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:41:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:41:50] [INFO ] Implicit Places using invariants in 271 ms returned []
[2022-05-14 16:41:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:41:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:41:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:51] [INFO ] Implicit Places using invariants and state equation in 801 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1081 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 68 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/125 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472898 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472898 steps, saw 128865 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 16:41:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:41:54] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 16:41:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 16:41:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 16:41:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 16:41:54] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:54] [INFO ] After 29ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:54] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-14 16:41:54] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:41:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:41:54] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 16:41:55] [INFO ] Implicit Places using invariants in 212 ms returned []
[2022-05-14 16:41:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:41:55] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 16:41:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:56] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2022-05-14 16:41:56] [INFO ] Redundant transitions in 93 ms returned []
[2022-05-14 16:41:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:41:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:41:56] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 18 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 119 cols
[2022-05-14 16:41:56] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 16:41:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:41:56] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 16:41:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 16:41:56] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 16:41:56] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:56] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-14 16:41:56] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-14 16:41:56] [INFO ] Flatten gal took : 14 ms
[2022-05-14 16:41:56] [INFO ] Flatten gal took : 13 ms
[2022-05-14 16:41:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9362810658764072734.gal : 10 ms
[2022-05-14 16:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17993086541370681550.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1813088803994593125;'/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/ReachabilityCardinality9362810658764072734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17993086541370681550.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/ReachabilityCardinality17993086541370681550.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 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 168
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :168 after 840
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :840 after 3528
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3528 after 19110
Reachability property AtomicPropp2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,122010,0.211416,10084,2,2212,14,26871,6,0,728,13998,0
Total reachable state count : 122010

Verifying 1 reachability properties.
Reachability property AtomicPropp2 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
AtomicPropp2,210,0.211997,10084,2,244,14,26871,7,0,731,13998,0
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 18 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:41:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:41:57] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 16:41:57] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2022-05-14 16:41:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:41:57] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 16:41:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2022-05-14 16:41:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:41:58] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 16:41:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:41:58] [INFO ] Implicit Places using invariants and state equation in 805 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1036 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GT s107 1), p1:(LEQ 1 s52)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 615 ms.
Product exploration explored 100000 steps with 50000 reset in 563 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2541 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-00 finished in 3242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1327
Applied a total of 4 rules in 16 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:42:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:42:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 16:42:01] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
[2022-05-14 16:42:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:42:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 16:42:01] [INFO ] Implicit Places using invariants in 185 ms returned []
[2022-05-14 16:42:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:42:01] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:42:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:42:02] [INFO ] Implicit Places using invariants and state equation in 750 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 945 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(GT s52 (ADD s106 s107))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 236 reset in 525 ms.
Product exploration explored 100000 steps with 236 reset in 531 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[p1, p1]
Finished random walk after 189 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[p1, p1]
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
[2022-05-14 16:42:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 16:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:42:04] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-14 16:42:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:42:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:42:04] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-14 16:42:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:42:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 314 ms returned sat
[2022-05-14 16:42:05] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 66 ms.
[2022-05-14 16:42:05] [INFO ] Added : 40 causal constraints over 9 iterations in 365 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:42:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:05] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
[2022-05-14 16:42:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:05] [INFO ] Implicit Places using invariants in 173 ms returned []
[2022-05-14 16:42:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:42:06] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2022-05-14 16:42:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:07] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
Finished random walk after 171 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[p1, p1]
Stuttering acceptance computed with spot in 76 ms :[p1, p1]
[2022-05-14 16:42:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:42:08] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-14 16:42:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:42:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:42:08] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-14 16:42:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:42:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 308 ms returned sat
[2022-05-14 16:42:08] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 41 ms.
[2022-05-14 16:42:09] [INFO ] Added : 40 causal constraints over 9 iterations in 337 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
Product exploration explored 100000 steps with 236 reset in 488 ms.
Product exploration explored 100000 steps with 236 reset in 501 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 89 ms :[p1, p1]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 168 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:42:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:42:11] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
[2022-05-14 16:42:11] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-14 16:42:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:11] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:42:11] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Product exploration explored 100000 steps with 236 reset in 501 ms.
Product exploration explored 100000 steps with 236 reset in 498 ms.
Built C files in :
/tmp/ltsmin9406148203366208183
[2022-05-14 16:42:12] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9406148203366208183
Running compilation step : cd /tmp/ltsmin9406148203366208183;'/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 2812 ms.
Running link step : cd /tmp/ltsmin9406148203366208183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9406148203366208183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6346873076825627381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:42:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:42:28] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
[2022-05-14 16:42:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:42:28] [INFO ] Implicit Places using invariants in 177 ms returned []
[2022-05-14 16:42:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:42:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:42:29] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2022-05-14 16:42:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:42:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:42:29] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin10266759556402117698
[2022-05-14 16:42:29] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10266759556402117698
Running compilation step : cd /tmp/ltsmin10266759556402117698;'/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 2821 ms.
Running link step : cd /tmp/ltsmin10266759556402117698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10266759556402117698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2636217855806690403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 16:42:44] [INFO ] Flatten gal took : 61 ms
[2022-05-14 16:42:44] [INFO ] Flatten gal took : 57 ms
[2022-05-14 16:42:44] [INFO ] Time to serialize gal into /tmp/LTL13555591693014228866.gal : 12 ms
[2022-05-14 16:42:44] [INFO ] Time to serialize properties into /tmp/LTL183379097584984320.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/LTL13555591693014228866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL183379097584984320.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/LTL1355559...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(CAPACITE_0>=1)")U("(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(CAPACITE_0>=1)" U "(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))")
Detected timeout of ITS tools.
[2022-05-14 16:43:00] [INFO ] Flatten gal took : 51 ms
[2022-05-14 16:43:00] [INFO ] Applying decomposition
[2022-05-14 16:43:00] [INFO ] Flatten gal took : 51 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/graph11043551346854226123.txt' '-o' '/tmp/graph11043551346854226123.bin' '-w' '/tmp/graph11043551346854226123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11043551346854226123.bin' '-l' '-1' '-v' '-w' '/tmp/graph11043551346854226123.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:43:00] [INFO ] Decomposing Gal with order
[2022-05-14 16:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:43:01] [INFO ] Removed a total of 2415 redundant transitions.
[2022-05-14 16:43:01] [INFO ] Flatten gal took : 761 ms
[2022-05-14 16:43:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 66 ms.
[2022-05-14 16:43:01] [INFO ] Time to serialize gal into /tmp/LTL4531874349673724085.gal : 5 ms
[2022-05-14 16:43:01] [INFO ] Time to serialize properties into /tmp/LTL15092111374376679653.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/LTL4531874349673724085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15092111374376679653.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/LTL4531874...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(gi1.gu0.CAPACITE_0>=1)")U("(gu1.ROUTE_A_0>(gu1.CONTROLEUR_0+gu1.CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(gi1.gu0.CAPACITE_0>=1)" U "(gu1.ROUTE_A_0>(gu1.CONTROLEUR_0+gu1.CONTROLEUR_1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4975278155871217850
[2022-05-14 16:43:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4975278155871217850
Running compilation step : cd /tmp/ltsmin4975278155871217850;'/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 2577 ms.
Running link step : cd /tmp/ltsmin4975278155871217850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4975278155871217850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01 finished in 90775 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 17 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:43:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:43:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:43:31] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
[2022-05-14 16:43:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:43:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:43:32] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-14 16:43:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:43:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:43:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:43:32] [INFO ] Implicit Places using invariants and state equation in 719 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 958 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-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:(LEQ s105 s52)], 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 198 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-02 finished in 1547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))&&p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 11 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:43:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:43:33] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-14 16:43:33] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2022-05-14 16:43:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:43:33] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 16:43:33] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-14 16:43:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:43:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 16:43:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:43:34] [INFO ] Implicit Places using invariants and state equation in 783 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1010 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s52 s53), p0:(LEQ s54 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-05 finished in 1587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G(p0))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1324
Applied a total of 10 rules in 109 ms. Remains 121 /128 variables (removed 7) and now considering 1324/1328 (removed 4) transitions.
[2022-05-14 16:43:34] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2022-05-14 16:43:34] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-14 16:43:34] [INFO ] Implicit Places using invariants in 221 ms returned []
[2022-05-14 16:43:34] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2022-05-14 16:43:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:43:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:43:35] [INFO ] Implicit Places using invariants and state equation in 545 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 772 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/128 places, 1324/1328 transitions.
Applied a total of 0 rules in 65 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 120/128 places, 1324/1328 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s103 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 319 reset in 488 ms.
Product exploration explored 100000 steps with 319 reset in 506 ms.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 58 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-14 16:43:37] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:37] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:43:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2022-05-14 16:43:37] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:37] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:43:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:43:37] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2022-05-14 16:43:37] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-14 16:43:37] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:37] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:43:38] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 1324/1324 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 320 reset in 501 ms.
Product exploration explored 100000 steps with 320 reset in 479 ms.
Built C files in :
/tmp/ltsmin15285590035651674307
[2022-05-14 16:43:39] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-14 16:43:39] [INFO ] Computation of Complete disable matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:40] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-14 16:43:40] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:40] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2022-05-14 16:43:40] [INFO ] Computation of Completed DNA matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:40] [INFO ] Built C files in 488ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15285590035651674307
Running compilation step : cd /tmp/ltsmin15285590035651674307;'/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/ltsmin15285590035651674307;'/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/ltsmin15285590035651674307;'/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 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 69 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-14 16:43:43] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:43:43] [INFO ] Implicit Places using invariants in 221 ms returned []
[2022-05-14 16:43:43] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:43] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:43:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:43:44] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2022-05-14 16:43:44] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-14 16:43:44] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-14 16:43:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:43:44] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin15736490487796161184
[2022-05-14 16:43:44] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-14 16:43:44] [INFO ] Computation of Complete disable matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:44] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-14 16:43:44] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:44] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2022-05-14 16:43:44] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:43:45] [INFO ] Built C files in 443ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15736490487796161184
Running compilation step : cd /tmp/ltsmin15736490487796161184;'/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/ltsmin15736490487796161184;'/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/ltsmin15736490487796161184;'/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-14 16:43:48] [INFO ] Flatten gal took : 51 ms
[2022-05-14 16:43:48] [INFO ] Flatten gal took : 47 ms
[2022-05-14 16:43:48] [INFO ] Time to serialize gal into /tmp/LTL3356478981423996846.gal : 6 ms
[2022-05-14 16:43:48] [INFO ] Time to serialize properties into /tmp/LTL4510933634254934240.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/LTL3356478981423996846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4510933634254934240.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/LTL3356478...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F(G("(ATTENTE_B_0<=ROUTE_A_0)")))))))
Formula 0 simplified : !GXXFG"(ATTENTE_B_0<=ROUTE_A_0)"
Detected timeout of ITS tools.
[2022-05-14 16:44:03] [INFO ] Flatten gal took : 47 ms
[2022-05-14 16:44:03] [INFO ] Applying decomposition
[2022-05-14 16:44:03] [INFO ] Flatten gal took : 43 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/graph12802182826137641240.txt' '-o' '/tmp/graph12802182826137641240.bin' '-w' '/tmp/graph12802182826137641240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12802182826137641240.bin' '-l' '-1' '-v' '-w' '/tmp/graph12802182826137641240.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:44:03] [INFO ] Decomposing Gal with order
[2022-05-14 16:44:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:44:03] [INFO ] Removed a total of 1303 redundant transitions.
[2022-05-14 16:44:03] [INFO ] Flatten gal took : 198 ms
[2022-05-14 16:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 425 labels/synchronizations in 14 ms.
[2022-05-14 16:44:03] [INFO ] Time to serialize gal into /tmp/LTL2752005464965389061.gal : 3 ms
[2022-05-14 16:44:03] [INFO ] Time to serialize properties into /tmp/LTL10505421064982175512.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/LTL2752005464965389061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10505421064982175512.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/LTL2752005...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F(G("(gu0.ATTENTE_B_0<=gu0.ROUTE_A_0)")))))))
Formula 0 simplified : !GXXFG"(gu0.ATTENTE_B_0<=gu0.ROUTE_A_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3163849245862183824
[2022-05-14 16:44:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3163849245862183824
Running compilation step : cd /tmp/ltsmin3163849245862183824;'/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 2491 ms.
Running link step : cd /tmp/ltsmin3163849245862183824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3163849245862183824;'/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))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-07 finished in 59321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p0))))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1327
Applied a total of 3 rules in 91 ms. Remains 126 /128 variables (removed 2) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:44:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-14 16:44:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 16:44:34] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
[2022-05-14 16:44:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-14 16:44:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 16:44:34] [INFO ] Implicit Places using invariants in 217 ms returned []
[2022-05-14 16:44:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-14 16:44:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 16:44:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:44:35] [INFO ] Implicit Places using invariants and state equation in 744 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 965 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 68 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 95 ms :[p0, true, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 3 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-08 finished in 1635 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(p0)))))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 96 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:44:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:44:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:44:36] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2022-05-14 16:44:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:44:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:44:36] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-14 16:44:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:44:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:44:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:44:37] [INFO ] Implicit Places using invariants and state equation in 873 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1110 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 68 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3339 reset in 393 ms.
Product exploration explored 100000 steps with 3470 reset in 395 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 74 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:44:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:44:39] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
[2022-05-14 16:44:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:39] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 16:44:39] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-14 16:44:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:44:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:44:40] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2022-05-14 16:44:40] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-14 16:44:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:44:41] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3390 reset in 393 ms.
Product exploration explored 100000 steps with 3430 reset in 377 ms.
Built C files in :
/tmp/ltsmin8165626354658627141
[2022-05-14 16:44:42] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2022-05-14 16:44:42] [INFO ] Computation of Complete disable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:42] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2022-05-14 16:44:42] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:42] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2022-05-14 16:44:42] [INFO ] Computation of Completed DNA matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:42] [INFO ] Built C files in 411ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8165626354658627141
Running compilation step : cd /tmp/ltsmin8165626354658627141;'/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/ltsmin8165626354658627141;'/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/ltsmin8165626354658627141;'/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 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 83 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:44:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:44:46] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
[2022-05-14 16:44:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 16:44:46] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-14 16:44:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:44:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:44:47] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2022-05-14 16:44:47] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-14 16:44:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:44:47] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:44:47] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin12480632322514291877
[2022-05-14 16:44:48] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2022-05-14 16:44:48] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:48] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2022-05-14 16:44:48] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:48] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2022-05-14 16:44:48] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:44:48] [INFO ] Built C files in 396ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12480632322514291877
Running compilation step : cd /tmp/ltsmin12480632322514291877;'/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/ltsmin12480632322514291877;'/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/ltsmin12480632322514291877;'/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-14 16:44:51] [INFO ] Flatten gal took : 39 ms
[2022-05-14 16:44:51] [INFO ] Flatten gal took : 39 ms
[2022-05-14 16:44:51] [INFO ] Time to serialize gal into /tmp/LTL13666939515282269704.gal : 9 ms
[2022-05-14 16:44:51] [INFO ] Time to serialize properties into /tmp/LTL13769733536866158663.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/LTL13666939515282269704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13769733536866158663.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/LTL1366693...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(X("(SUR_PONT_A_0<1)"))))))
Formula 0 simplified : !XGFX"(SUR_PONT_A_0<1)"
Detected timeout of ITS tools.
[2022-05-14 16:45:06] [INFO ] Flatten gal took : 40 ms
[2022-05-14 16:45:06] [INFO ] Applying decomposition
[2022-05-14 16:45:06] [INFO ] Flatten gal took : 38 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/graph11951547229922332194.txt' '-o' '/tmp/graph11951547229922332194.bin' '-w' '/tmp/graph11951547229922332194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11951547229922332194.bin' '-l' '-1' '-v' '-w' '/tmp/graph11951547229922332194.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:45:06] [INFO ] Decomposing Gal with order
[2022-05-14 16:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:45:06] [INFO ] Removed a total of 3238 redundant transitions.
[2022-05-14 16:45:07] [INFO ] Flatten gal took : 146 ms
[2022-05-14 16:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 16 ms.
[2022-05-14 16:45:07] [INFO ] Time to serialize gal into /tmp/LTL17715869339768058889.gal : 2 ms
[2022-05-14 16:45:07] [INFO ] Time to serialize properties into /tmp/LTL567182659777665830.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/LTL17715869339768058889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL567182659777665830.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/LTL1771586...245
Read 1 LTL properties
Checking formula 0 : !((X(G(F(X("(i1.u13.SUR_PONT_A_0<1)"))))))
Formula 0 simplified : !XGFX"(i1.u13.SUR_PONT_A_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16976167983109979936
[2022-05-14 16:45:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16976167983109979936
Running compilation step : cd /tmp/ltsmin16976167983109979936;'/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 2510 ms.
Running link step : cd /tmp/ltsmin16976167983109979936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16976167983109979936;'/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)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-09 finished in 61578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 66 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:45:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:45:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:45:37] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
[2022-05-14 16:45:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:45:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:37] [INFO ] Implicit Places using invariants in 218 ms returned []
[2022-05-14 16:45:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-14 16:45:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:45:38] [INFO ] Implicit Places using invariants and state equation in 758 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 979 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s105)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 236 reset in 450 ms.
Product exploration explored 100000 steps with 236 reset in 463 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 585 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=292 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 61 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:45:40] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:45:40] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
[2022-05-14 16:45:40] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:40] [INFO ] Implicit Places using invariants in 200 ms returned []
[2022-05-14 16:45:40] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:45:41] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2022-05-14 16:45:41] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-14 16:45:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:45:41] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished Best-First random walk after 533 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=266 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 236 reset in 446 ms.
Product exploration explored 100000 steps with 236 reset in 460 ms.
Built C files in :
/tmp/ltsmin5182274551362448705
[2022-05-14 16:45:43] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-14 16:45:43] [INFO ] Computation of Complete disable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:43] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-14 16:45:43] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:43] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-14 16:45:43] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:43] [INFO ] Built C files in 404ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5182274551362448705
Running compilation step : cd /tmp/ltsmin5182274551362448705;'/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/ltsmin5182274551362448705;'/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/ltsmin5182274551362448705;'/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 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:45:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:45:47] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
[2022-05-14 16:45:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:47] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 16:45:47] [INFO ] Implicit Places using invariants in 200 ms returned []
[2022-05-14 16:45:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:45:48] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2022-05-14 16:45:48] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-14 16:45:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-14 16:45:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:45:48] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Built C files in :
/tmp/ltsmin328295073534660102
[2022-05-14 16:45:48] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-14 16:45:48] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:48] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-14 16:45:48] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:48] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-14 16:45:48] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:45:48] [INFO ] Built C files in 413ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin328295073534660102
Running compilation step : cd /tmp/ltsmin328295073534660102;'/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/ltsmin328295073534660102;'/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/ltsmin328295073534660102;'/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-14 16:45:51] [INFO ] Flatten gal took : 40 ms
[2022-05-14 16:45:51] [INFO ] Flatten gal took : 39 ms
[2022-05-14 16:45:51] [INFO ] Time to serialize gal into /tmp/LTL1109299008981460885.gal : 5 ms
[2022-05-14 16:45:51] [INFO ] Time to serialize properties into /tmp/LTL12509096297646254520.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/LTL1109299008981460885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12509096297646254520.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/LTL1109299...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G("(CAPACITE_0>SUR_PONT_B_0)"))))))
Formula 0 simplified : !FGFG"(CAPACITE_0>SUR_PONT_B_0)"
Detected timeout of ITS tools.
[2022-05-14 16:46:07] [INFO ] Flatten gal took : 39 ms
[2022-05-14 16:46:07] [INFO ] Applying decomposition
[2022-05-14 16:46:07] [INFO ] Flatten gal took : 38 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/graph17440085010917537980.txt' '-o' '/tmp/graph17440085010917537980.bin' '-w' '/tmp/graph17440085010917537980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17440085010917537980.bin' '-l' '-1' '-v' '-w' '/tmp/graph17440085010917537980.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:46:07] [INFO ] Decomposing Gal with order
[2022-05-14 16:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:46:07] [INFO ] Removed a total of 1244 redundant transitions.
[2022-05-14 16:46:07] [INFO ] Flatten gal took : 191 ms
[2022-05-14 16:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 4 ms.
[2022-05-14 16:46:07] [INFO ] Time to serialize gal into /tmp/LTL11929736625602354.gal : 4 ms
[2022-05-14 16:46:07] [INFO ] Time to serialize properties into /tmp/LTL4097961238854176943.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/LTL11929736625602354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4097961238854176943.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/LTL1192973...264
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G("(gu0.CAPACITE_0>gu0.SUR_PONT_B_0)"))))))
Formula 0 simplified : !FGFG"(gu0.CAPACITE_0>gu0.SUR_PONT_B_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8041867074032984803
[2022-05-14 16:46:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8041867074032984803
Running compilation step : cd /tmp/ltsmin8041867074032984803;'/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 2495 ms.
Running link step : cd /tmp/ltsmin8041867074032984803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 134 ms.
Running LTSmin : cd /tmp/ltsmin8041867074032984803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13 finished in 60450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(p0)))&&G(G(p1)))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1327
Applied a total of 4 rules in 15 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:46:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:46:38] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
[2022-05-14 16:46:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:38] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 16:46:38] [INFO ] Implicit Places using invariants in 203 ms returned []
[2022-05-14 16:46:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:46:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:38] [INFO ] Implicit Places using invariants and state equation in 574 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 781 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s109 s110) (ADD s107 s108)), p0:(GT 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 finished in 1332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 12 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-14 16:46:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:46:38] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 16:46:39] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
[2022-05-14 16:46:39] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:46:39] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 16:46:39] [INFO ] Implicit Places using invariants in 217 ms returned []
[2022-05-14 16:46:39] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-14 16:46:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 16:46:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:40] [INFO ] Implicit Places using invariants and state equation in 622 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 842 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 126/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s52) (LEQ s54 s107))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 530 ms.
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/126 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 finished in 2509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U p1))))'
Found a CL insensitive property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 27 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 16:46:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:42] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
[2022-05-14 16:46:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:42] [INFO ] Implicit Places using invariants in 173 ms returned []
[2022-05-14 16:46:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 16:46:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:43] [INFO ] Implicit Places using invariants and state equation in 772 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 947 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 16 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/128 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(GT s52 (ADD s106 s107))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 236 reset in 461 ms.
Product exploration explored 100000 steps with 236 reset in 494 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Finished random walk after 166 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
[2022-05-14 16:46:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:46:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:46:45] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-05-14 16:46:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:46:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 16:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:46:45] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-14 16:46:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 304 ms returned sat
[2022-05-14 16:46:45] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 33 ms.
[2022-05-14 16:46:45] [INFO ] Added : 40 causal constraints over 9 iterations in 320 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:46:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:46] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
[2022-05-14 16:46:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:46] [INFO ] Implicit Places using invariants in 188 ms returned []
[2022-05-14 16:46:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:47] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2022-05-14 16:46:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:47] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Finished random walk after 167 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
[2022-05-14 16:46:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:46:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:46:48] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-14 16:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:46:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 16:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:46:49] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-14 16:46:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:46:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 309 ms returned sat
[2022-05-14 16:46:49] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 34 ms.
[2022-05-14 16:46:49] [INFO ] Added : 40 causal constraints over 9 iterations in 328 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Product exploration explored 100000 steps with 236 reset in 469 ms.
Product exploration explored 100000 steps with 236 reset in 466 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:46:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:46:51] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2022-05-14 16:46:51] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-14 16:46:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:46:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:46:51] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Product exploration explored 100000 steps with 236 reset in 450 ms.
Product exploration explored 100000 steps with 236 reset in 453 ms.
Built C files in :
/tmp/ltsmin15337786791969938471
[2022-05-14 16:46:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15337786791969938471
Running compilation step : cd /tmp/ltsmin15337786791969938471;'/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 2514 ms.
Running link step : cd /tmp/ltsmin15337786791969938471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15337786791969938471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3787214998851644584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 16:47:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:47:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2022-05-14 16:47:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:47:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:47:08] [INFO ] Implicit Places using invariants in 164 ms returned []
[2022-05-14 16:47:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:47:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:47:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 16:47:09] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2022-05-14 16:47:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 16:47:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:47:09] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin2758466982471712667
[2022-05-14 16:47:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2758466982471712667
Running compilation step : cd /tmp/ltsmin2758466982471712667;'/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 2913 ms.
Running link step : cd /tmp/ltsmin2758466982471712667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2758466982471712667;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7879383984218620501.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 16:47:24] [INFO ] Flatten gal took : 40 ms
[2022-05-14 16:47:24] [INFO ] Flatten gal took : 39 ms
[2022-05-14 16:47:24] [INFO ] Time to serialize gal into /tmp/LTL5731858120953776945.gal : 6 ms
[2022-05-14 16:47:24] [INFO ] Time to serialize properties into /tmp/LTL2104651502776418747.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/LTL5731858120953776945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2104651502776418747.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/LTL5731858...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(CAPACITE_0>=1)")U("(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(CAPACITE_0>=1)" U "(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))")
Detected timeout of ITS tools.
[2022-05-14 16:47:39] [INFO ] Flatten gal took : 41 ms
[2022-05-14 16:47:39] [INFO ] Applying decomposition
[2022-05-14 16:47:39] [INFO ] Flatten gal took : 39 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/graph9366517577367622014.txt' '-o' '/tmp/graph9366517577367622014.bin' '-w' '/tmp/graph9366517577367622014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9366517577367622014.bin' '-l' '-1' '-v' '-w' '/tmp/graph9366517577367622014.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:47:39] [INFO ] Decomposing Gal with order
[2022-05-14 16:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:47:40] [INFO ] Removed a total of 3487 redundant transitions.
[2022-05-14 16:47:40] [INFO ] Flatten gal took : 239 ms
[2022-05-14 16:47:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 535 labels/synchronizations in 14 ms.
[2022-05-14 16:47:40] [INFO ] Time to serialize gal into /tmp/LTL9706357717755577564.gal : 2 ms
[2022-05-14 16:47:40] [INFO ] Time to serialize properties into /tmp/LTL14411895693915399085.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/LTL9706357717755577564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14411895693915399085.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/LTL9706357...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(gi1.gu0.CAPACITE_0>=1)")U("(gu1.ROUTE_A_0>(gu1.CONTROLEUR_0+gu1.CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(gi1.gu0.CAPACITE_0>=1)" U "(gu1.ROUTE_A_0>(gu1.CONTROLEUR_0+gu1.CONTROLEUR_1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16100689558099574725
[2022-05-14 16:47:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16100689558099574725
Running compilation step : cd /tmp/ltsmin16100689558099574725;'/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 2594 ms.
Running link step : cd /tmp/ltsmin16100689558099574725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16100689558099574725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLCardinality-01 finished in 88913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
[2022-05-14 16:48:10] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12953104926632774825
[2022-05-14 16:48:10] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-14 16:48:10] [INFO ] Applying decomposition
[2022-05-14 16:48:10] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:48:10] [INFO ] Flatten gal took : 41 ms
[2022-05-14 16:48:10] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-14 16:48:10] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph11553763614059197048.txt' '-o' '/tmp/graph11553763614059197048.bin' '-w' '/tmp/graph11553763614059197048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11553763614059197048.bin' '-l' '-1' '-v' '-w' '/tmp/graph11553763614059197048.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:48:10] [INFO ] Decomposing Gal with order
[2022-05-14 16:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:48:11] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-14 16:48:11] [INFO ] Computation of Completed DNA matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:48:11] [INFO ] Built C files in 467ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12953104926632774825
Running compilation step : cd /tmp/ltsmin12953104926632774825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-14 16:48:11] [INFO ] Removed a total of 2465 redundant transitions.
[2022-05-14 16:48:11] [INFO ] Flatten gal took : 474 ms
[2022-05-14 16:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1656 labels/synchronizations in 28 ms.
[2022-05-14 16:48:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality12858692554137112699.gal : 3 ms
[2022-05-14 16:48:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality5788125096427384594.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/LTLCardinality12858692554137112699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5788125096427384594.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/LTLCardina...289
Read 4 LTL properties
Checking formula 0 : !((X(F(!(("(gu3.CAPACITE_0>=1)")U("(gu4.ROUTE_A_0>(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(gu3.CAPACITE_0>=1)" U "(gu4.ROUTE_A_0>(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))")
Compilation finished in 6640 ms.
Running link step : cd /tmp/ltsmin12953104926632774825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin12953104926632774825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12953104926632774825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12953104926632774825;'/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(<>([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 17:10:21] [INFO ] Applying decomposition
[2022-05-14 17:10:21] [INFO ] Flatten gal took : 117 ms
[2022-05-14 17:10:21] [INFO ] Decomposing Gal with order
[2022-05-14 17:10:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:10:22] [INFO ] Removed a total of 7230 redundant transitions.
[2022-05-14 17:10:22] [INFO ] Flatten gal took : 256 ms
[2022-05-14 17:10:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2022-05-14 17:10:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality8517586178075414393.gal : 16 ms
[2022-05-14 17:10:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality9460876467566508343.ltl : 77 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/LTLCardinality8517586178075414393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9460876467566508343.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/LTLCardina...288
Read 4 LTL properties
Checking formula 0 : !((X(F(!(("(gCAPACITE.CAPACITE_0>=1)")U("(gROUTE_A.ROUTE_A_0>(gsens0.CONTROLEUR_0+gsens1.CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(gCAPACITE.CAPACITE_0>=1)" U "(gROUTE_A.ROUTE_A_0>(gsens0.CONTROLEUR_0+gsens1.CONTROLEUR_1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12953104926632774825;'/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(<>([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12953104926632774825;'/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((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 17:32:32] [INFO ] Flatten gal took : 122 ms
[2022-05-14 17:32:33] [INFO ] Input system was already deterministic with 1328 transitions.
[2022-05-14 17:32:33] [INFO ] Transformed 128 places.
[2022-05-14 17:32:33] [INFO ] Transformed 1328 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-14 17:32:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality1080828158064484293.gal : 21 ms
[2022-05-14 17:32:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality18395474031747903669.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/LTLCardinality1080828158064484293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18395474031747903669.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(!(("(CAPACITE_0>=1)")U("(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))"))))))
Formula 0 simplified : !XF!("(CAPACITE_0>=1)" U "(ROUTE_A_0>(CONTROLEUR_0+CONTROLEUR_1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12953104926632774825;'/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((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12953104926632774825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>([]((LTLAPp4==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BridgeAndVehicles-COL-V50P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918000067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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