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-165251918100116.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-V80P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.8K Apr 29 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 21:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 21:44 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 3.7K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:08 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 45K 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-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652562804324

Running Version 202205111006
[2022-05-14 21:13:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 21:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 21:13:25] [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 21:13:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 21:13:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2022-05-14 21:13:26] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2022-05-14 21:13:26] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2022-05-14 21:13:26] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-13 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.1 ms
Remains 3 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
Finished random walk after 182 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=11 )
[2022-05-14 21:13:26] [INFO ] Flatten gal took : 14 ms
[2022-05-14 21:13:26] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] 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 21:13:26] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 105 ms.
[2022-05-14 21:13:26] [INFO ] Unfolded 15 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 63 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 21:13:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:13:27] [INFO ] Computed 5 place invariants in 23 ms
[2022-05-14 21:13:28] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
[2022-05-14 21:13:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:13:28] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 21:13:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-14 21:13:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:13:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:13:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:13:28] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2022-05-14 21:13:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:13:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:13:29] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/188 places, 2108/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2022-05-14 21:13:30] [INFO ] Flatten gal took : 274 ms
[2022-05-14 21:13:31] [INFO ] Flatten gal took : 285 ms
[2022-05-14 21:13:32] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1030 ms. (steps per millisecond=9 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-14 21:13:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:13:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:13:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 21:13:35] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(F(!G(p1))) U p2)))&&p0)))'
Support contains 95 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 52 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:13:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:13:36] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:13:37] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2022-05-14 21:13:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:13:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:13:37] [INFO ] Implicit Places using invariants in 209 ms returned []
[2022-05-14 21:13:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:13:37] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 21:13:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:13:38] [INFO ] Implicit Places using invariants and state equation in 870 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1092 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 574 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (OR (NOT p2) p1), p1]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s73 1) (LT s83 1) (LT s167 1)) (OR (LT s0 1) (LT s18 1) (LT s83 1) (LT s167 1)) (OR (LT s0 1) (LT s49 1) (LT s83 1) (LT s167 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10328 reset in 979 ms.
Product exploration explored 100000 steps with 10389 reset in 846 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p1), p1]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 21:13:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:13:41] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:13:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 21:13:41] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true, (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Support contains 12 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 344 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:13:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:13:42] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 21:13:43] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2022-05-14 21:13:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:13:43] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:13:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2022-05-14 21:13:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:13:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:13:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:13:43] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2022-05-14 21:13:44] [INFO ] Redundant transitions in 144 ms returned []
[2022-05-14 21:13:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:13:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:13:44] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [p2]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p2]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10746 reset in 672 ms.
Product exploration explored 100000 steps with 10615 reset in 672 ms.
Built C files in :
/tmp/ltsmin6999993713306377625
[2022-05-14 21:13:46] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:13:46] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6999993713306377625
Running compilation step : cd /tmp/ltsmin6999993713306377625;'/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/ltsmin6999993713306377625;'/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/ltsmin6999993713306377625;'/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 12 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 182 transition count 2106
Applied a total of 3 rules in 848 ms. Remains 182 /184 variables (removed 2) and now considering 2106/2107 (removed 1) transitions.
[2022-05-14 21:13:50] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 182 cols
[2022-05-14 21:13:50] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 21:13:50] [INFO ] Implicit Places using invariants in 254 ms returned []
[2022-05-14 21:13:50] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 182 cols
[2022-05-14 21:13:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 21:13:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:13:51] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1296 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/184 places, 2106/2107 transitions.
Applied a total of 0 rules in 217 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 181/184 places, 2106/2107 transitions.
Built C files in :
/tmp/ltsmin2133492487147951580
[2022-05-14 21:13:52] [INFO ] Too many transitions (2106) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:13:52] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2133492487147951580
Running compilation step : cd /tmp/ltsmin2133492487147951580;'/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/ltsmin2133492487147951580;'/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/ltsmin2133492487147951580;'/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 21:13:55] [INFO ] Flatten gal took : 92 ms
[2022-05-14 21:13:55] [INFO ] Flatten gal took : 87 ms
[2022-05-14 21:13:55] [INFO ] Time to serialize gal into /tmp/LTL2242207200427518975.gal : 26 ms
[2022-05-14 21:13:55] [INFO ] Time to serialize properties into /tmp/LTL723905521077877282.ltl : 3 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/LTL2242207200427518975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL723905521077877282.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/LTL2242207...265
Read 1 LTL properties
Checking formula 0 : !((X((((((((X(G((X(F(!(G("((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1)))||(((CAPACITE_0>=1)&&...13878
Formula 0 simplified : !X("((((((((CAPACITE_0<1)||(NB_ATTENTE_A_13<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_62<1))||((ATT...13843
Detected timeout of ITS tools.
[2022-05-14 21:14:10] [INFO ] Flatten gal took : 75 ms
[2022-05-14 21:14:10] [INFO ] Applying decomposition
[2022-05-14 21:14:10] [INFO ] Flatten gal took : 73 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/graph16504304316851123504.txt' '-o' '/tmp/graph16504304316851123504.bin' '-w' '/tmp/graph16504304316851123504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16504304316851123504.bin' '-l' '-1' '-v' '-w' '/tmp/graph16504304316851123504.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:14:11] [INFO ] Decomposing Gal with order
[2022-05-14 21:14:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:14:12] [INFO ] Removed a total of 4138 redundant transitions.
[2022-05-14 21:14:12] [INFO ] Flatten gal took : 937 ms
[2022-05-14 21:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 557 labels/synchronizations in 35 ms.
[2022-05-14 21:14:12] [INFO ] Time to serialize gal into /tmp/LTL17899209582363121731.gal : 3 ms
[2022-05-14 21:14:12] [INFO ] Time to serialize properties into /tmp/LTL15121417439788145015.ltl : 15 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/LTL17899209582363121731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15121417439788145015.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/LTL1789920...247
Read 1 LTL properties
Checking formula 0 : !((X((((((((X(G((X(F(!(G("((((((((((i0.u0.CAPACITE_0>=1)&&(i0.u1.NB_ATTENTE_A_72>=1))&&((i0.u1.ATTENTE_A_0>=1)&&(u4.CONTROLEUR_0>=1)))...17478
Formula 0 simplified : !X("((((((((i0.u0.CAPACITE_0<1)||(i0.u1.NB_ATTENTE_A_73<1))||((i0.u1.ATTENTE_A_0<1)||(u4.CONTROLEUR_0<1)))&&(((i0.u0.CAPACITE_0<1)||...17443
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16370660082879613346
[2022-05-14 21:14:27] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16370660082879613346
Running compilation step : cd /tmp/ltsmin16370660082879613346;'/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/ltsmin16370660082879613346;'/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/ltsmin16370660082879613346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 finished in 53752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p0))&&F(!G(p1))) U X(p1))))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 36 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:14:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:30] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:14:31] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
[2022-05-14 21:14:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:31] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 21:14:31] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-05-14 21:14:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:14:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:32] [INFO ] Implicit Places using invariants and state equation in 925 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1219 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 773 ms.
Product exploration explored 100000 steps with 33333 reset in 764 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-02 finished in 3843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1&&(X((F(p1) U p1))||p2)))))'
Support contains 97 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 226 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:14:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:34] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 21:14:35] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2022-05-14 21:14:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:14:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2022-05-14 21:14:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:14:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:36] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1292 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 227 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s105 1) (GEQ s165 1) (GEQ s168 1)) (AND (GEQ s0 1) (GEQ s136 1) (GEQ s165 1) (GEQ s168 1)) (AND (GEQ s0 1) (GEQ s129 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 33340 reset in 3503 ms.
Product exploration explored 100000 steps with 33280 reset in 3396 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 551 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Finished random walk after 269 steps, including 0 resets, run visited all 6 properties in 26 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND p1 (NOT p2))), (F p1), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 15 factoid took 302 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-03 finished in 10611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p0) U X(G(X(p1)))))))'
Support contains 13 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 21:14:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:14:44] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:14:45] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2022-05-14 21:14:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:14:45] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 21:14:45] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-14 21:14:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:14:45] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:14:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:46] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1420 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s169 1) (GEQ s172 1)) (AND (GEQ s169 1) (GEQ s171 1)) (AND (GEQ s169 1) (GEQ s174 1)) (AND (GEQ s169 1) (GEQ s173 1)) (AND (GEQ s170 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-04 finished in 2292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((false U (p1 U p2))||p0))))'
Support contains 95 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 23 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:14:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:47] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 21:14:47] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2022-05-14 21:14:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:14:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-14 21:14:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:14:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:48] [INFO ] Implicit Places using invariants and state equation in 675 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 824 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 828 ms.
Product exploration explored 100000 steps with 50000 reset in 820 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-05 finished in 3423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(p0))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 324 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:14:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:50] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:14:51] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2022-05-14 21:14:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:14:51] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-05-14 21:14:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:14:51] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:14:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:53] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2037 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 280 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 20) (GEQ s181 1)) (AND (GEQ s0 20) (GEQ s182 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1756 reset in 518 ms.
Product exploration explored 100000 steps with 1769 reset in 483 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2022-05-14 21:14:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:14:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:14:55] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 21:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:56] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2022-05-14 21:14:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:14:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 21:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:56] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-14 21:14:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:14:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 383 ms returned sat
[2022-05-14 21:14:57] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 3 ms to minimize.
[2022-05-14 21:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1651 ms
[2022-05-14 21:14:58] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 101 ms.
[2022-05-14 21:14:59] [INFO ] Added : 9 causal constraints over 3 iterations in 553 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 213 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:14:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:14:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:15:00] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
[2022-05-14 21:15:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:15:00] [INFO ] Implicit Places using invariants in 351 ms returned []
[2022-05-14 21:15:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:15:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:15:02] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
[2022-05-14 21:15:02] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-14 21:15:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:15:03] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2022-05-14 21:15:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:15:03] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-14 21:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:15:04] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2022-05-14 21:15:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:15:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 21:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:15:04] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-14 21:15:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:15:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 391 ms returned sat
[2022-05-14 21:15:05] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2022-05-14 21:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1480 ms
[2022-05-14 21:15:06] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 96 ms.
[2022-05-14 21:15:07] [INFO ] Added : 9 causal constraints over 3 iterations in 486 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1762 reset in 473 ms.
Product exploration explored 100000 steps with 1775 reset in 483 ms.
Built C files in :
/tmp/ltsmin15744261609188067317
[2022-05-14 21:15:08] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:15:08] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15744261609188067317
Running compilation step : cd /tmp/ltsmin15744261609188067317;'/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/ltsmin15744261609188067317;'/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/ltsmin15744261609188067317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 224 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:15:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:11] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:15:12] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
[2022-05-14 21:15:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:15:12] [INFO ] Implicit Places using invariants in 316 ms returned []
[2022-05-14 21:15:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:15:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:15:13] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2022-05-14 21:15:13] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-14 21:15:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:15:13] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:15:13] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin8057989604656763917
[2022-05-14 21:15:14] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:15:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8057989604656763917
Running compilation step : cd /tmp/ltsmin8057989604656763917;'/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/ltsmin8057989604656763917;'/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/ltsmin8057989604656763917;'/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 21:15:17] [INFO ] Flatten gal took : 72 ms
[2022-05-14 21:15:17] [INFO ] Flatten gal took : 71 ms
[2022-05-14 21:15:17] [INFO ] Time to serialize gal into /tmp/LTL18201351867029820961.gal : 10 ms
[2022-05-14 21:15:17] [INFO ] Time to serialize properties into /tmp/LTL15791651112542311821.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/LTL18201351867029820961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15791651112542311821.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/LTL1820135...268
Read 1 LTL properties
Checking formula 0 : !((F(F(F("(((CAPACITE_0>=20)&&(VIDANGE_0>=1))||((CAPACITE_0>=20)&&(VIDANGE_1>=1)))")))))
Formula 0 simplified : !F"(((CAPACITE_0>=20)&&(VIDANGE_0>=1))||((CAPACITE_0>=20)&&(VIDANGE_1>=1)))"
Detected timeout of ITS tools.
[2022-05-14 21:15:32] [INFO ] Flatten gal took : 66 ms
[2022-05-14 21:15:32] [INFO ] Applying decomposition
[2022-05-14 21:15:32] [INFO ] Flatten gal took : 64 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/graph14023400944784441177.txt' '-o' '/tmp/graph14023400944784441177.bin' '-w' '/tmp/graph14023400944784441177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14023400944784441177.bin' '-l' '-1' '-v' '-w' '/tmp/graph14023400944784441177.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:15:32] [INFO ] Decomposing Gal with order
[2022-05-14 21:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:15:33] [INFO ] Removed a total of 3713 redundant transitions.
[2022-05-14 21:15:33] [INFO ] Flatten gal took : 969 ms
[2022-05-14 21:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 29 ms.
[2022-05-14 21:15:33] [INFO ] Time to serialize gal into /tmp/LTL15601159280132827296.gal : 4 ms
[2022-05-14 21:15:33] [INFO ] Time to serialize properties into /tmp/LTL7156046948505613457.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/LTL15601159280132827296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7156046948505613457.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/LTL1560115...246
Read 1 LTL properties
Checking formula 0 : !((F(F(F("(((u0.CAPACITE_0>=20)&&(i2.u2.VIDANGE_0>=1))||((u0.CAPACITE_0>=20)&&(u3.VIDANGE_1>=1)))")))))
Formula 0 simplified : !F"(((u0.CAPACITE_0>=20)&&(i2.u2.VIDANGE_0>=1))||((u0.CAPACITE_0>=20)&&(u3.VIDANGE_1>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18425109596370244408
[2022-05-14 21:15:49] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18425109596370244408
Running compilation step : cd /tmp/ltsmin18425109596370244408;'/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/ltsmin18425109596370244408;'/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/ltsmin18425109596370244408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-06 finished in 61494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X(!(F(!p1)||X(p0)))))'
Support contains 95 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 20 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:15:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:52] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:15:52] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2022-05-14 21:15:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:15:52] [INFO ] Implicit Places using invariants in 163 ms returned []
[2022-05-14 21:15:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:15:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:15:53] [INFO ] Implicit Places using invariants and state equation in 736 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 908 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true, true, (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p1:(OR (AND (GEQ s169 1) (GEQ s181 1)) (AND (GEQ s170 1) (GEQ s181 1))), p0:(OR (AND (GEQ s10 1) (GEQ s85 1) (GEQ s168 1) (GEQ s175 1)) (AND (GEQ s31 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 finished in 1861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(F(!p0))&&!p0))))'
Support contains 93 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 48 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:15:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:15:54] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
[2022-05-14 21:15:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:15:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2022-05-14 21:15:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:15:54] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-14 21:15:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:15:55] [INFO ] Implicit Places using invariants and state equation in 784 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 948 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, p0, false, false, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (OR (LT s10 1) (LT s85 1) (LT s168 1) (LT s175 1)) (OR (LT s31 1) (LT s85 1) (LT s168 1) (LT s181 1)) (OR (LT s48 1) (LT s85 1) (LT s168 1) (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59367 steps with 88 reset in 4919 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 finished in 6814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(G(p0)) U !((!p1 U p2)||F(p3))))'
Support contains 88 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 230 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 21:16:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:16:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:16:01] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2022-05-14 21:16:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:16:01] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 21:16:01] [INFO ] Implicit Places using invariants in 225 ms returned []
[2022-05-14 21:16:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 21:16:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:16:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:16:02] [INFO ] Implicit Places using invariants and state equation in 789 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1019 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 219 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 185/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR p3 p2), p0, p2, p3]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p2 p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={0, 1} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}], [{ cond=p3, acceptance={0, 1} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s0 20) (GEQ s183 1)) (AND (GEQ s0 20) (GEQ s184 1))), p3:(AND (OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s83 1) (GEQ s168 1)) (AND (GEQ s0 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3682 reset in 1857 ms.
Product exploration explored 100000 steps with 3666 reset in 1830 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR p2 p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 14 factoid took 725 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 175 ms :[(OR p3 p2), p0, p2, p3]
Finished random walk after 273 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR p2 p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F p2), (F p0), (F p3), (F (AND (NOT p2) (NOT p1))), (F (OR p2 p3)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) (NOT p3) (NOT p1)))]
Knowledge based reduction with 14 factoid took 858 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 181 ms :[(OR p3 p2), p0, p2, p3]
Stuttering acceptance computed with spot in 170 ms :[(OR p3 p2), p0, p2, p3]
Support contains 88 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 235 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 21:16:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:09] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:16:09] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
[2022-05-14 21:16:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:09] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:16:10] [INFO ] Implicit Places using invariants in 224 ms returned []
[2022-05-14 21:16:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:10] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-14 21:16:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:16:10] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2022-05-14 21:16:10] [INFO ] Redundant transitions in 107 ms returned []
[2022-05-14 21:16:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:10] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:16:11] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (OR p2 p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 14 factoid took 732 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR p2 p3), p0, p2, p3]
Finished random walk after 284 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (OR p2 p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F p2), (F p0), (F p3), (F (AND (NOT p2) (NOT p1))), (F (OR p3 p2)), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p3) (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 759 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR p2 p3), p0, p2, p3]
Stuttering acceptance computed with spot in 171 ms :[(OR p2 p3), p0, p2, p3]
Stuttering acceptance computed with spot in 202 ms :[(OR p2 p3), p0, p2, p3]
Product exploration explored 100000 steps with 3893 reset in 1936 ms.
Product exploration explored 100000 steps with 3546 reset in 1948 ms.
Built C files in :
/tmp/ltsmin12241395591732672054
[2022-05-14 21:16:17] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:16:17] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12241395591732672054
Running compilation step : cd /tmp/ltsmin12241395591732672054;'/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/ltsmin12241395591732672054;'/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/ltsmin12241395591732672054;'/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 88 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 211 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 21:16:20] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:20] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:16:21] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2022-05-14 21:16:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:21] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 21:16:21] [INFO ] Implicit Places using invariants in 210 ms returned []
[2022-05-14 21:16:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:16:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:16:22] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2022-05-14 21:16:22] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-14 21:16:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 21:16:22] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:16:23] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin11906067272577832376
[2022-05-14 21:16:23] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:16:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11906067272577832376
Running compilation step : cd /tmp/ltsmin11906067272577832376;'/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/ltsmin11906067272577832376;'/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/ltsmin11906067272577832376;'/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 21:16:26] [INFO ] Flatten gal took : 69 ms
[2022-05-14 21:16:26] [INFO ] Flatten gal took : 68 ms
[2022-05-14 21:16:26] [INFO ] Time to serialize gal into /tmp/LTL12905909717836463387.gal : 14 ms
[2022-05-14 21:16:26] [INFO ] Time to serialize properties into /tmp/LTL4938530755328779776.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/LTL12905909717836463387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4938530755328779776.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/LTL1290590...267
Read 1 LTL properties
Checking formula 0 : !(((!(X(G("(SUR_PONT_A_0>=1)"))))U(!(((!("(((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((N...13644
Formula 0 simplified : !(!XG"(SUR_PONT_A_0>=1)" U !((!"(((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENT...13629
Detected timeout of ITS tools.
[2022-05-14 21:16:41] [INFO ] Flatten gal took : 65 ms
[2022-05-14 21:16:41] [INFO ] Applying decomposition
[2022-05-14 21:16:41] [INFO ] Flatten gal took : 64 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/graph13217377186568611967.txt' '-o' '/tmp/graph13217377186568611967.bin' '-w' '/tmp/graph13217377186568611967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13217377186568611967.bin' '-l' '-1' '-v' '-w' '/tmp/graph13217377186568611967.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:16:41] [INFO ] Decomposing Gal with order
[2022-05-14 21:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:16:42] [INFO ] Removed a total of 4531 redundant transitions.
[2022-05-14 21:16:42] [INFO ] Flatten gal took : 534 ms
[2022-05-14 21:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 760 labels/synchronizations in 21 ms.
[2022-05-14 21:16:42] [INFO ] Time to serialize gal into /tmp/LTL9973411204656120068.gal : 2 ms
[2022-05-14 21:16:42] [INFO ] Time to serialize properties into /tmp/LTL13649529114326943935.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9973411204656120068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13649529114326943935.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/LTL9973411...246
Read 1 LTL properties
Checking formula 0 : !(((!(X(G("(i1.u0.SUR_PONT_A_0>=1)"))))U(!(((!("(((((((((i2.u4.NB_ATTENTE_A_33>=1)&&(i1.u2.ROUTE_A_0>=1))||((i2.u4.NB_ATTENTE_A_23>=1)...17538
Formula 0 simplified : !(!XG"(i1.u0.SUR_PONT_A_0>=1)" U !((!"(((((((((i2.u4.NB_ATTENTE_A_33>=1)&&(i1.u2.ROUTE_A_0>=1))||((i2.u4.NB_ATTENTE_A_23>=1)&&(i1.u2...17523
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14343168478705529975
[2022-05-14 21:16:57] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14343168478705529975
Running compilation step : cd /tmp/ltsmin14343168478705529975;'/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/ltsmin14343168478705529975;'/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/ltsmin14343168478705529975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-10 finished in 59881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 186 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:17:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:00] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:17:01] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2022-05-14 21:17:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:17:01] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-05-14 21:17:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:17:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:17:04] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2841 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 209 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-11 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:(LT s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3458 reset in 558 ms.
Product exploration explored 100000 steps with 3549 reset in 593 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 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 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 174 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:17:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:17:06] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:17:07] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2022-05-14 21:17:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:17:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:17:07] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-14 21:17:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 21:17:07] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:17:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:17:08] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1439 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 171 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/184 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 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 157 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 53 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
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 398 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3384 reset in 532 ms.
Product exploration explored 100000 steps with 3350 reset in 504 ms.
Built C files in :
/tmp/ltsmin4150492531610940654
[2022-05-14 21:17:10] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:17:10] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4150492531610940654
Running compilation step : cd /tmp/ltsmin4150492531610940654;'/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/ltsmin4150492531610940654;'/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/ltsmin4150492531610940654;'/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 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 173 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:17:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:17:14] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:17:14] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2022-05-14 21:17:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:17:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:17:15] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-05-14 21:17:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:17:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:17:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:17:16] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2022-05-14 21:17:16] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-14 21:17:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:17:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:17:16] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin978378955172950771
[2022-05-14 21:17:16] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:17:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin978378955172950771
Running compilation step : cd /tmp/ltsmin978378955172950771;'/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/ltsmin978378955172950771;'/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/ltsmin978378955172950771;'/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 21:17:19] [INFO ] Flatten gal took : 58 ms
[2022-05-14 21:17:20] [INFO ] Flatten gal took : 72 ms
[2022-05-14 21:17:20] [INFO ] Time to serialize gal into /tmp/LTL15422721943641029210.gal : 8 ms
[2022-05-14 21:17:20] [INFO ] Time to serialize properties into /tmp/LTL16385909940302640258.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/LTL15422721943641029210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16385909940302640258.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/LTL1542272...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(SUR_PONT_A_0<1)"))))
Formula 0 simplified : !GF"(SUR_PONT_A_0<1)"
Detected timeout of ITS tools.
[2022-05-14 21:17:35] [INFO ] Flatten gal took : 98 ms
[2022-05-14 21:17:35] [INFO ] Applying decomposition
[2022-05-14 21:17:35] [INFO ] Flatten gal took : 56 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/graph13581811902811528318.txt' '-o' '/tmp/graph13581811902811528318.bin' '-w' '/tmp/graph13581811902811528318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13581811902811528318.bin' '-l' '-1' '-v' '-w' '/tmp/graph13581811902811528318.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:17:35] [INFO ] Decomposing Gal with order
[2022-05-14 21:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:17:35] [INFO ] Removed a total of 3879 redundant transitions.
[2022-05-14 21:17:36] [INFO ] Flatten gal took : 551 ms
[2022-05-14 21:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 584 labels/synchronizations in 17 ms.
[2022-05-14 21:17:36] [INFO ] Time to serialize gal into /tmp/LTL7619227859602366471.gal : 2 ms
[2022-05-14 21:17:36] [INFO ] Time to serialize properties into /tmp/LTL156502322249667227.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/LTL7619227859602366471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL156502322249667227.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/LTL7619227...244
Read 1 LTL properties
Checking formula 0 : !((G(F("(u6.SUR_PONT_A_0<1)"))))
Formula 0 simplified : !GF"(u6.SUR_PONT_A_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3731342792568816979
[2022-05-14 21:17:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3731342792568816979
Running compilation step : cd /tmp/ltsmin3731342792568816979;'/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/ltsmin3731342792568816979;'/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/ltsmin3731342792568816979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-11 finished in 53508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((X(X(p0)) U F(p1))) U X(p2)))'
Support contains 177 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 19 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:17:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:54] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:17:55] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
[2022-05-14 21:17:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:55] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:17:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-14 21:17:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:17:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:17:56] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2022-05-14 21:17:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:56] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:17:56] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2107/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 499 ms :[true, p2, p2, (AND p2 p1), p1]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s105 1) (GEQ s168 1) (GEQ s172 1)) (AND (GEQ s1 1) (GEQ s155 1) (GEQ s168 1) (GEQ s179 1)) (AND (GEQ s1 1) (GEQ s131 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 744 steps with 1 reset in 95 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-14 finished in 3263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(p2)&&p1))&&p0))))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 243 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 21:17:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:57] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:17:58] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2022-05-14 21:17:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:58] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:17:58] [INFO ] Implicit Places using invariants in 291 ms returned []
[2022-05-14 21:17:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 21:17:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:17:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:18:00] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1736 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 240 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 20) (LT s181 1)) (OR (LT s0 20) (LT s182 1))), p1:(AND (OR (LT s0 20) (LT s181 1)) (OR (LT s0 20) (LT s182 1))), p2:(AND (OR (LT s146 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 148 reset in 1239 ms.
Product exploration explored 100000 steps with 148 reset in 1220 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (NOT p1) (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 382 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 279 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (NOT p1) (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 454 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2022-05-14 21:18:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:18:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 21:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:18:05] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-14 21:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:18:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 21:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:18:07] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-14 21:18:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:18:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-14 21:18:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 6020 ms returned unknown
Could not prove EG (NOT p2)
Support contains 85 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 234 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:18:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:13] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:18:14] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
[2022-05-14 21:18:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:18:14] [INFO ] Implicit Places using invariants in 244 ms returned []
[2022-05-14 21:18:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:14] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-14 21:18:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:18:15] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2022-05-14 21:18:15] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-14 21:18:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:15] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 21:18:15] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X p0), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 413 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 246 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X p0), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2022-05-14 21:18:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 21:18:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 21:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:18:18] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-14 21:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:18:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 21:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:18:20] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-14 21:18:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:18:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-14 21:18:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 3094 ms returned sat
[2022-05-14 21:18:23] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 48 ms.
[2022-05-14 21:18:23] [INFO ] Added : 12 causal constraints over 3 iterations in 187 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 148 reset in 1235 ms.
Product exploration explored 100000 steps with 148 reset in 1209 ms.
Built C files in :
/tmp/ltsmin201242562628878275
[2022-05-14 21:18:26] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:18:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin201242562628878275
Running compilation step : cd /tmp/ltsmin201242562628878275;'/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/ltsmin201242562628878275;'/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/ltsmin201242562628878275;'/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 85 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 269 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 21:18:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:29] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:18:30] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2022-05-14 21:18:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:30] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 21:18:30] [INFO ] Implicit Places using invariants in 240 ms returned []
[2022-05-14 21:18:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 21:18:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 21:18:31] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2022-05-14 21:18:31] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-14 21:18:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 21:18:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 21:18:31] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin14103259400665768601
[2022-05-14 21:18:31] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:18:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14103259400665768601
Running compilation step : cd /tmp/ltsmin14103259400665768601;'/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/ltsmin14103259400665768601;'/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/ltsmin14103259400665768601;'/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 21:18:34] [INFO ] Flatten gal took : 63 ms
[2022-05-14 21:18:35] [INFO ] Flatten gal took : 61 ms
[2022-05-14 21:18:35] [INFO ] Time to serialize gal into /tmp/LTL17226171279734848992.gal : 8 ms
[2022-05-14 21:18:35] [INFO ] Time to serialize properties into /tmp/LTL2918709365290219855.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/LTL17226171279734848992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2918709365290219855.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/LTL1722617...267
Read 1 LTL properties
Checking formula 0 : !((F(G(((F(((G("(((((((((NB_ATTENTE_B_62<1)||(ROUTE_B_0<1))&&((NB_ATTENTE_B_23<1)||(ROUTE_B_0<1)))&&(((NB_ATTENTE_B_52<1)||(ROUTE_B_0<...3426
Formula 0 simplified : !FG("((CAPACITE_0<20)||(VIDANGE_0<1))" & "((CAPACITE_0<20)||(VIDANGE_1<1))" & F("((CAPACITE_0<20)||(VIDANGE_0<1))" & "((CAPACITE_0<2...3408
Detected timeout of ITS tools.
[2022-05-14 21:18:50] [INFO ] Flatten gal took : 69 ms
[2022-05-14 21:18:50] [INFO ] Applying decomposition
[2022-05-14 21:18:50] [INFO ] Flatten gal took : 61 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/graph12473381962921048734.txt' '-o' '/tmp/graph12473381962921048734.bin' '-w' '/tmp/graph12473381962921048734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12473381962921048734.bin' '-l' '-1' '-v' '-w' '/tmp/graph12473381962921048734.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:18:50] [INFO ] Decomposing Gal with order
[2022-05-14 21:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:18:50] [INFO ] Removed a total of 4787 redundant transitions.
[2022-05-14 21:18:50] [INFO ] Flatten gal took : 394 ms
[2022-05-14 21:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 726 labels/synchronizations in 25 ms.
[2022-05-14 21:18:50] [INFO ] Time to serialize gal into /tmp/LTL17500037066573079910.gal : 3 ms
[2022-05-14 21:18:50] [INFO ] Time to serialize properties into /tmp/LTL13203773334221102521.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/LTL17500037066573079910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13203773334221102521.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/LTL1750003...247
Read 1 LTL properties
Checking formula 0 : !((F(G(((F(((G("(((((((((i0.u0.NB_ATTENTE_B_62<1)||(i2.u5.ROUTE_B_0<1))&&((i2.u5.NB_ATTENTE_B_23<1)||(i2.u5.ROUTE_B_0<1)))&&(((i0.u0.N...4446
Formula 0 simplified : !FG("((i2.u1.CAPACITE_0<20)||(i0.u0.VIDANGE_1<1))" & "((i2.u1.CAPACITE_0<20)||(i1.u2.VIDANGE_0<1))" & F("((i2.u1.CAPACITE_0<20)||(i0...4428
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15222628684860970326
[2022-05-14 21:19:06] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15222628684860970326
Running compilation step : cd /tmp/ltsmin15222628684860970326;'/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/ltsmin15222628684860970326;'/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/ltsmin15222628684860970326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-15 finished in 71641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(F(!G(p1))) U p2)))&&p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(G(p0)) U !((!p1 U p2)||F(p3))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(p2)&&p1))&&p0))))'
[2022-05-14 21:19:09] [INFO ] Flatten gal took : 178 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1353575041404357313
[2022-05-14 21:19:09] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2022-05-14 21:19:09] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1353575041404357313
Running compilation step : cd /tmp/ltsmin1353575041404357313;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' '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 21:19:09] [INFO ] Applying decomposition
[2022-05-14 21:19:10] [INFO ] Flatten gal took : 132 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/graph8335791113938153141.txt' '-o' '/tmp/graph8335791113938153141.bin' '-w' '/tmp/graph8335791113938153141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8335791113938153141.bin' '-l' '-1' '-v' '-w' '/tmp/graph8335791113938153141.weights' '-q' '0' '-e' '0.001'
[2022-05-14 21:19:10] [INFO ] Decomposing Gal with order
[2022-05-14 21:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:19:11] [INFO ] Removed a total of 4475 redundant transitions.
[2022-05-14 21:19:11] [INFO ] Flatten gal took : 730 ms
[2022-05-14 21:19:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 689 labels/synchronizations in 52 ms.
[2022-05-14 21:19:11] [INFO ] Time to serialize gal into /tmp/LTLFireability1797955924616865558.gal : 2 ms
[2022-05-14 21:19:11] [INFO ] Time to serialize properties into /tmp/LTLFireability14361847091111880814.ltl : 3 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/LTLFireability1797955924616865558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14361847091111880814.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((X((((((((X(G((X(F(!(G("((((((((((u1.CAPACITE_0>=1)&&(i0.u3.NB_ATTENTE_A_72>=1))&&((i0.u0.ATTENTE_A_0>=1)&&(i2.u4.CONTROLEUR_0>=1)))...17448
Formula 0 simplified : !X("((((((((u1.CAPACITE_0<1)||(i0.u3.NB_ATTENTE_A_13<1))||((i0.u0.ATTENTE_A_0<1)||(i2.u4.CONTROLEUR_0<1)))&&(((u1.CAPACITE_0<1)||(i0...17413
Compilation finished in 5288 ms.
Running link step : cd /tmp/ltsmin1353575041404357313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1353575041404357313;'/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([]((X(<>())) U (LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1353575041404357313;'/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([]((X(<>())) U (LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1353575041404357313;'/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' '<>(<>(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 21:41:05] [INFO ] Applying decomposition
[2022-05-14 21:41:05] [INFO ] Flatten gal took : 211 ms
[2022-05-14 21:41:06] [INFO ] Decomposing Gal with order
[2022-05-14 21:41:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 21:41:06] [INFO ] Removed a total of 11550 redundant transitions.
[2022-05-14 21:41:06] [INFO ] Flatten gal took : 415 ms
[2022-05-14 21:41:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 42 ms.
[2022-05-14 21:41:06] [INFO ] Time to serialize gal into /tmp/LTLFireability4904964496689257700.gal : 41 ms
[2022-05-14 21:41:06] [INFO ] Time to serialize properties into /tmp/LTLFireability13129151539099372243.ltl : 3 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/LTLFireability4904964496689257700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13129151539099372243.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((X((((((((X(G((X(F(!(G("((((((((((CAPACITE.CAPACITE_0>=1)&&(voitureA72.NB_ATTENTE_A_72>=1))&&((ATTENTE_A.ATTENTE_A_0>=1)&&(sens0.CON...19940
Formula 0 simplified : !X("((((((((CAPACITE.CAPACITE_0<1)||(voitureA13.NB_ATTENTE_A_13<1))||((ATTENTE_A.ATTENTE_A_0<1)||(sens0.CONTROLEUR_0<1)))&&(((CAPACI...19905
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1353575041404357313;'/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' '<>(<>(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1353575041404357313;'/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([]((LTLAPp4==true))) U !((!(LTLAPp5==true) U (LTLAPp3==true))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1353575041404357313;'/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([]((LTLAPp4==true))) U !((!(LTLAPp5==true) U (LTLAPp3==true))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1353575041404357313;'/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'
Detected timeout of ITS tools.
[2022-05-14 22:03:01] [INFO ] Flatten gal took : 162 ms
[2022-05-14 22:03:01] [INFO ] Input system was already deterministic with 2108 transitions.
[2022-05-14 22:03:01] [INFO ] Transformed 186 places.
[2022-05-14 22:03:01] [INFO ] Transformed 2108 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 22:03:02] [INFO ] Time to serialize gal into /tmp/LTLFireability2272169712103271258.gal : 31 ms
[2022-05-14 22:03:02] [INFO ] Time to serialize properties into /tmp/LTLFireability4886297064788603243.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2272169712103271258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4886297064788603243.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((((((((X(G((X(F(!(G("((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1)))||(((CAPACITE_0>=1)&&...13878
Formula 0 simplified : !X("((((((((CAPACITE_0<1)||(NB_ATTENTE_A_13<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_62<1))||((ATT...13843
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1353575041404357313;'/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'
Running LTSmin : cd /tmp/ltsmin1353575041404357313;'/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' '<>([]((<>(([]((LTLAPp9==true))&&(LTLAPp8==true)))&&(LTLAPp7==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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