Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372000082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S24C11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 12 06:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 06:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716649396007

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:03:18] [INFO ] Load time of PNML (sax parser for PT used): 595 ms
[2024-05-25 15:03:18] [INFO ] Transformed 19254 places.
[2024-05-25 15:03:18] [INFO ] Transformed 27973 transitions.
[2024-05-25 15:03:18] [INFO ] Parsed PT model containing 19254 places and 27973 transitions and 103022 arcs in 768 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 19254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19254/19254 places, 27973/27973 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 19204 transition count 27973
Applied a total of 50 rules in 699 ms. Remains 19204 /19254 variables (removed 50) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:03:19] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:03:22] [INFO ] Computed 1249 invariants in 2600 ms
[2024-05-25 15:03:23] [INFO ] Implicit Places using invariants in 4334 ms returned []
Implicit Place search using SMT only with invariants took 4357 ms to find 0 implicit places.
[2024-05-25 15:03:23] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:03:23] [INFO ] Invariant cache hit.
[2024-05-25 15:03:25] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19204/19254 places, 27973/27973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6809 ms. Remains : 19204/19254 places, 27973/27973 transitions.
Support contains 40 out of 19204 places after structural reductions.
[2024-05-25 15:03:26] [INFO ] Flatten gal took : 1024 ms
[2024-05-25 15:03:27] [INFO ] Flatten gal took : 767 ms
[2024-05-25 15:03:29] [INFO ] Input system was already deterministic with 27973 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 727 ms. (steps per millisecond=13 ) properties (out of 24) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 15:03:30] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:03:30] [INFO ] Invariant cache hit.
[2024-05-25 15:03:36] [INFO ] [Real]Absence check using 47 positive place invariants in 223 ms returned sat
[2024-05-25 15:03:37] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 692 ms returned sat
[2024-05-25 15:03:37] [INFO ] After 7123ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-05-25 15:03:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 215 ms returned sat
[2024-05-25 15:03:43] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 749 ms returned sat
[2024-05-25 15:04:02] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6574 transitions
Trivial Post-agglo rules discarded 6574 transitions
Performed 6574 trivial Post agglomeration. Transition count delta: 6574
Iterating post reduction 0 with 6574 rules applied. Total rules applied 6574 place count 19204 transition count 21399
Reduce places removed 6574 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 6595 rules applied. Total rules applied 13169 place count 12630 transition count 21378
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 13190 place count 12609 transition count 21378
Performed 548 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 548 Pre rules applied. Total rules applied 13190 place count 12609 transition count 20830
Deduced a syphon composed of 548 places in 28 ms
Reduce places removed 548 places and 0 transitions.
Iterating global reduction 3 with 1096 rules applied. Total rules applied 14286 place count 12061 transition count 20830
Discarding 6036 places :
Symmetric choice reduction at 3 with 6036 rule applications. Total rules 20322 place count 6025 transition count 14794
Iterating global reduction 3 with 6036 rules applied. Total rules applied 26358 place count 6025 transition count 14794
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 26358 place count 6025 transition count 14784
Deduced a syphon composed of 10 places in 12 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 26378 place count 6015 transition count 14784
Discarding 535 places :
Symmetric choice reduction at 3 with 535 rule applications. Total rules 26913 place count 5480 transition count 8899
Iterating global reduction 3 with 535 rules applied. Total rules applied 27448 place count 5480 transition count 8899
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27498 place count 5455 transition count 8874
Free-agglomeration rule (complex) applied 345 times.
Iterating global reduction 3 with 345 rules applied. Total rules applied 27843 place count 5455 transition count 13549
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 3 with 345 rules applied. Total rules applied 28188 place count 5110 transition count 13549
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 28487 place count 5110 transition count 13549
Applied a total of 28487 rules in 6131 ms. Remains 5110 /19204 variables (removed 14094) and now considering 13549/27973 (removed 14424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6132 ms. Remains : 5110/19204 places, 13549/27973 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:04:10] [INFO ] Flow matrix only has 12665 transitions (discarded 884 similar events)
// Phase 1: matrix 12665 rows 5110 cols
[2024-05-25 15:04:10] [INFO ] Computed 1249 invariants in 374 ms
[2024-05-25 15:04:11] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:04:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 15:04:13] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2024-05-25 15:04:27] [INFO ] After 14113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 15:04:27] [INFO ] State equation strengthened by 8272 read => feed constraints.
[2024-05-25 15:04:36] [INFO ] After 9034ms SMT Verify possible using 8272 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 15:04:36] [INFO ] After 9035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:04:36] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 14 out of 5110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5110/5110 places, 13549/13549 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5110 transition count 13548
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5109 transition count 13548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 5109 transition count 13547
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5108 transition count 13547
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 5108 transition count 13869
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 20 place count 5100 transition count 13869
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 5097 transition count 13866
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 5097 transition count 13866
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 5097 transition count 13866
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 5096 transition count 13865
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 5096 transition count 13865
Applied a total of 30 rules in 3262 ms. Remains 5096 /5110 variables (removed 14) and now considering 13865/13549 (removed -316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3262 ms. Remains : 5096/5110 places, 13865/13549 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 18807 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18807 steps, saw 8866 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:04:44] [INFO ] Flow matrix only has 12980 transitions (discarded 885 similar events)
// Phase 1: matrix 12980 rows 5096 cols
[2024-05-25 15:04:45] [INFO ] Computed 1249 invariants in 342 ms
[2024-05-25 15:04:46] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:04:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 15:04:47] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 358 ms returned sat
[2024-05-25 15:05:02] [INFO ] After 14146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 15:05:02] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:05:11] [INFO ] After 9018ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 15:05:11] [INFO ] After 9021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 15:05:11] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 14 out of 5096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5096/5096 places, 13865/13865 transitions.
Applied a total of 0 rules in 890 ms. Remains 5096 /5096 variables (removed 0) and now considering 13865/13865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 5096/5096 places, 13865/13865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5096/5096 places, 13865/13865 transitions.
Applied a total of 0 rules in 839 ms. Remains 5096 /5096 variables (removed 0) and now considering 13865/13865 (removed 0) transitions.
[2024-05-25 15:05:12] [INFO ] Flow matrix only has 12980 transitions (discarded 885 similar events)
[2024-05-25 15:05:12] [INFO ] Invariant cache hit.
[2024-05-25 15:05:18] [INFO ] Implicit Places using invariants in 5572 ms returned []
Implicit Place search using SMT only with invariants took 5573 ms to find 0 implicit places.
[2024-05-25 15:05:18] [INFO ] Flow matrix only has 12980 transitions (discarded 885 similar events)
[2024-05-25 15:05:18] [INFO ] Invariant cache hit.
[2024-05-25 15:05:26] [INFO ] Dead Transitions using invariants and state equation in 8226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14642 ms. Remains : 5096/5096 places, 13865/13865 transitions.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16580 stabilizing places and 22772 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6600 transitions
Trivial Post-agglo rules discarded 6600 transitions
Performed 6600 trivial Post agglomeration. Transition count delta: 6600
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 21373
Reduce places removed 6600 places and 0 transitions.
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 29 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6050 places :
Symmetric choice reduction at 2 with 6050 rule applications. Total rules 20350 place count 6004 transition count 14773
Iterating global reduction 2 with 6050 rules applied. Total rules applied 26400 place count 6004 transition count 14773
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 26400 place count 6004 transition count 14751
Deduced a syphon composed of 22 places in 16 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 26444 place count 5982 transition count 14751
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 26994 place count 5432 transition count 8701
Iterating global reduction 2 with 550 rules applied. Total rules applied 27544 place count 5432 transition count 8701
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27594 place count 5407 transition count 8676
Applied a total of 27594 rules in 3595 ms. Remains 5407 /19204 variables (removed 13797) and now considering 8676/27973 (removed 19297) transitions.
[2024-05-25 15:05:30] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
// Phase 1: matrix 8076 rows 5407 cols
[2024-05-25 15:05:30] [INFO ] Computed 1249 invariants in 286 ms
[2024-05-25 15:05:36] [INFO ] Implicit Places using invariants in 6360 ms returned []
[2024-05-25 15:05:36] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:05:36] [INFO ] Invariant cache hit.
[2024-05-25 15:05:41] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 10581 ms to find 0 implicit places.
[2024-05-25 15:05:42] [INFO ] Redundant transitions in 1086 ms returned []
[2024-05-25 15:05:42] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:05:42] [INFO ] Invariant cache hit.
[2024-05-25 15:05:47] [INFO ] Dead Transitions using invariants and state equation in 5374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5407/19204 places, 8676/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20653 ms. Remains : 5407/19204 places, 8676/27973 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s2227)], 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 1268 reset in 1426 ms.
Product exploration explored 100000 steps with 1267 reset in 1268 ms.
Computed a total of 2808 stabilizing places and 3500 stable transitions
Computed a total of 2808 stabilizing places and 3500 stable transitions
Detected a total of 2808/5407 stabilizing places and 3500/8676 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2814 steps, including 35 resets, run visited all 1 properties in 74 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 5407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5407/5407 places, 8676/8676 transitions.
Applied a total of 0 rules in 589 ms. Remains 5407 /5407 variables (removed 0) and now considering 8676/8676 (removed 0) transitions.
[2024-05-25 15:05:51] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:05:51] [INFO ] Invariant cache hit.
[2024-05-25 15:05:56] [INFO ] Implicit Places using invariants in 4244 ms returned []
[2024-05-25 15:05:56] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:05:56] [INFO ] Invariant cache hit.
[2024-05-25 15:06:00] [INFO ] Implicit Places using invariants and state equation in 4167 ms returned []
Implicit Place search using SMT with State Equation took 8411 ms to find 0 implicit places.
[2024-05-25 15:06:01] [INFO ] Redundant transitions in 979 ms returned []
[2024-05-25 15:06:01] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:06:01] [INFO ] Invariant cache hit.
[2024-05-25 15:06:06] [INFO ] Dead Transitions using invariants and state equation in 5262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15264 ms. Remains : 5407/5407 places, 8676/8676 transitions.
Computed a total of 2808 stabilizing places and 3500 stable transitions
Computed a total of 2808 stabilizing places and 3500 stable transitions
Detected a total of 2808/5407 stabilizing places and 3500/8676 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 782 steps, including 9 resets, run visited all 1 properties in 13 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1263 reset in 1220 ms.
Product exploration explored 100000 steps with 1269 reset in 1255 ms.
Built C files in :
/tmp/ltsmin249824084950169549
[2024-05-25 15:06:09] [INFO ] Too many transitions (8676) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:06:09] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin249824084950169549
Running compilation step : cd /tmp/ltsmin249824084950169549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin249824084950169549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin249824084950169549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 5407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5407/5407 places, 8676/8676 transitions.
Applied a total of 0 rules in 592 ms. Remains 5407 /5407 variables (removed 0) and now considering 8676/8676 (removed 0) transitions.
[2024-05-25 15:06:13] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:06:13] [INFO ] Invariant cache hit.
[2024-05-25 15:06:17] [INFO ] Implicit Places using invariants in 3992 ms returned []
[2024-05-25 15:06:17] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:06:17] [INFO ] Invariant cache hit.
[2024-05-25 15:06:21] [INFO ] Implicit Places using invariants and state equation in 4118 ms returned []
Implicit Place search using SMT with State Equation took 8112 ms to find 0 implicit places.
[2024-05-25 15:06:22] [INFO ] Redundant transitions in 723 ms returned []
[2024-05-25 15:06:22] [INFO ] Flow matrix only has 8076 transitions (discarded 600 similar events)
[2024-05-25 15:06:22] [INFO ] Invariant cache hit.
[2024-05-25 15:06:27] [INFO ] Dead Transitions using invariants and state equation in 5166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14602 ms. Remains : 5407/5407 places, 8676/8676 transitions.
Built C files in :
/tmp/ltsmin3366110684583086350
[2024-05-25 15:06:27] [INFO ] Too many transitions (8676) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:06:27] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3366110684583086350
Running compilation step : cd /tmp/ltsmin3366110684583086350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3366110684583086350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3366110684583086350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:06:31] [INFO ] Flatten gal took : 287 ms
[2024-05-25 15:06:31] [INFO ] Flatten gal took : 265 ms
[2024-05-25 15:06:32] [INFO ] Time to serialize gal into /tmp/LTL3403821635177273531.gal : 84 ms
[2024-05-25 15:06:32] [INFO ] Time to serialize properties into /tmp/LTL17749461194931939768.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3403821635177273531.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9048097361825967891.hoa' '-atoms' '/tmp/LTL17749461194931939768.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17749461194931939768.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9048097361825967891.hoa
Detected timeout of ITS tools.
[2024-05-25 15:06:47] [INFO ] Flatten gal took : 333 ms
[2024-05-25 15:06:48] [INFO ] Flatten gal took : 233 ms
[2024-05-25 15:06:48] [INFO ] Time to serialize gal into /tmp/LTL41231404896283775.gal : 56 ms
[2024-05-25 15:06:48] [INFO ] Time to serialize properties into /tmp/LTL7880812527112977860.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL41231404896283775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7880812527112977860.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node10WantsToManageTheCrashOfNode22<1)"))))
Formula 0 simplified : FG!"(Node10WantsToManageTheCrashOfNode22<1)"
Detected timeout of ITS tools.
[2024-05-25 15:07:03] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:07:03] [INFO ] Applying decomposition
[2024-05-25 15:07:03] [INFO ] Flatten gal took : 218 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4334063953342660373.txt' '-o' '/tmp/graph4334063953342660373.bin' '-w' '/tmp/graph4334063953342660373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4334063953342660373.bin' '-l' '-1' '-v' '-w' '/tmp/graph4334063953342660373.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:07:04] [INFO ] Decomposing Gal with order
[2024-05-25 15:07:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:07:06] [INFO ] Removed a total of 7358 redundant transitions.
[2024-05-25 15:07:06] [INFO ] Flatten gal took : 1451 ms
[2024-05-25 15:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 5157 labels/synchronizations in 494 ms.
[2024-05-25 15:07:07] [INFO ] Time to serialize gal into /tmp/LTL11607741171862074044.gal : 91 ms
[2024-05-25 15:07:07] [INFO ] Time to serialize properties into /tmp/LTL12841437790607379095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11607741171862074044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12841437790607379095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i0.u173.Node10WantsToManageTheCrashOfNode22<1)"))))
Formula 0 simplified : FG!"(i0.u173.Node10WantsToManageTheCrashOfNode22<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3770938100673562060
[2024-05-25 15:07:22] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3770938100673562060
Running compilation step : cd /tmp/ltsmin3770938100673562060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3770938100673562060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3770938100673562060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00 finished in 118641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 580 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:07:26] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:07:28] [INFO ] Computed 1249 invariants in 2420 ms
[2024-05-25 15:07:30] [INFO ] Implicit Places using invariants in 3953 ms returned []
Implicit Place search using SMT only with invariants took 3954 ms to find 0 implicit places.
[2024-05-25 15:07:30] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:07:30] [INFO ] Invariant cache hit.
[2024-05-25 15:07:31] [INFO ] Dead Transitions using invariants and state equation in 1490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6028 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GT 2 s915) (GT s13380 s14440))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03 finished in 6308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13199 place count 12605 transition count 21373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20824
Deduced a syphon composed of 549 places in 26 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 3 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Applied a total of 27586 rules in 3457 ms. Remains 5411 /19204 variables (removed 13793) and now considering 8690/27973 (removed 19283) transitions.
[2024-05-25 15:07:35] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2024-05-25 15:07:35] [INFO ] Computed 1249 invariants in 256 ms
[2024-05-25 15:07:39] [INFO ] Implicit Places using invariants in 4439 ms returned []
[2024-05-25 15:07:39] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:07:39] [INFO ] Invariant cache hit.
[2024-05-25 15:07:45] [INFO ] Implicit Places using invariants and state equation in 5729 ms returned []
Implicit Place search using SMT with State Equation took 10169 ms to find 0 implicit places.
[2024-05-25 15:07:46] [INFO ] Redundant transitions in 961 ms returned []
[2024-05-25 15:07:46] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:07:46] [INFO ] Invariant cache hit.
[2024-05-25 15:07:51] [INFO ] Dead Transitions using invariants and state equation in 5294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5411/19204 places, 8690/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19891 ms. Remains : 5411/19204 places, 8690/27973 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s3170) (LEQ 3 s4909))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04 finished in 19990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 582 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:07:52] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:07:54] [INFO ] Computed 1249 invariants in 2333 ms
[2024-05-25 15:07:56] [INFO ] Implicit Places using invariants in 3817 ms returned []
Implicit Place search using SMT only with invariants took 3819 ms to find 0 implicit places.
[2024-05-25 15:07:56] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:07:56] [INFO ] Invariant cache hit.
[2024-05-25 15:07:57] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5880 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s18044 s4287)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 59965 steps with 531 reset in 1138 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05 finished in 7217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13199 place count 12605 transition count 21373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 26 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20349 place count 6005 transition count 14774
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26398 place count 6005 transition count 14774
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26398 place count 6005 transition count 14753
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26440 place count 5984 transition count 14753
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26989 place count 5435 transition count 8714
Iterating global reduction 3 with 549 rules applied. Total rules applied 27538 place count 5435 transition count 8714
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27588 place count 5410 transition count 8689
Applied a total of 27588 rules in 3511 ms. Remains 5410 /19204 variables (removed 13794) and now considering 8689/27973 (removed 19284) transitions.
[2024-05-25 15:08:02] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2024-05-25 15:08:02] [INFO ] Computed 1249 invariants in 232 ms
[2024-05-25 15:08:07] [INFO ] Implicit Places using invariants in 4385 ms returned []
[2024-05-25 15:08:07] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:08:07] [INFO ] Invariant cache hit.
[2024-05-25 15:08:11] [INFO ] Implicit Places using invariants and state equation in 4226 ms returned []
Implicit Place search using SMT with State Equation took 8615 ms to find 0 implicit places.
[2024-05-25 15:08:12] [INFO ] Redundant transitions in 965 ms returned []
[2024-05-25 15:08:12] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:08:12] [INFO ] Invariant cache hit.
[2024-05-25 15:08:17] [INFO ] Dead Transitions using invariants and state equation in 5178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5410/19204 places, 8689/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18275 ms. Remains : 5410/19204 places, 8689/27973 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1668 s4611)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1248 reset in 1227 ms.
Product exploration explored 100000 steps with 1246 reset in 1236 ms.
Computed a total of 2811 stabilizing places and 3513 stable transitions
Computed a total of 2811 stabilizing places and 3513 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24294 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24294 steps, saw 11533 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:08:23] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:08:23] [INFO ] Invariant cache hit.
[2024-05-25 15:08:23] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:08:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:08:24] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 341 ms returned sat
[2024-05-25 15:08:30] [INFO ] After 5858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:08:30] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2024-05-25 15:08:31] [INFO ] After 1006ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:08:37] [INFO ] Deduced a trap composed of 591 places in 5956 ms of which 6 ms to minimize.
[2024-05-25 15:08:44] [INFO ] Deduced a trap composed of 355 places in 6001 ms of which 5 ms to minimize.
[2024-05-25 15:08:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12734 ms
[2024-05-25 15:08:44] [INFO ] After 13957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 364 ms.
[2024-05-25 15:08:45] [INFO ] After 21218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5073 transition count 13842
Applied a total of 699 rules in 2488 ms. Remains 5073 /5410 variables (removed 337) and now considering 13842/8689 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2488 ms. Remains : 5073/5410 places, 13842/8689 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20668 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20668 steps, saw 9700 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:08:51] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2024-05-25 15:08:51] [INFO ] Computed 1249 invariants in 347 ms
[2024-05-25 15:08:52] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:08:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-05-25 15:08:52] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 326 ms returned sat
[2024-05-25 15:08:59] [INFO ] After 6515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:08:59] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:09:08] [INFO ] After 8766ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:09:16] [INFO ] Deduced a trap composed of 294 places in 7792 ms of which 5 ms to minimize.
[2024-05-25 15:09:24] [INFO ] Deduced a trap composed of 300 places in 7014 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:09:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:09:24] [INFO ] After 31941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 852 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 885 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2024-05-25 15:09:25] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:09:25] [INFO ] Invariant cache hit.
[2024-05-25 15:09:30] [INFO ] Implicit Places using invariants in 4919 ms returned []
Implicit Place search using SMT only with invariants took 4920 ms to find 0 implicit places.
[2024-05-25 15:09:30] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:09:30] [INFO ] Invariant cache hit.
[2024-05-25 15:09:38] [INFO ] Dead Transitions using invariants and state equation in 7927 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13737 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3578 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 7 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51800 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 449 rules applied. Total rules applied 3816 place count 3358 transition count 9825
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4227 place count 3199 transition count 9573
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4577 place count 3072 transition count 9350
Ensure Unique test removed 27 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 319 rules applied. Total rules applied 4896 place count 2947 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5162 place count 2849 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5400 place count 2753 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5592 place count 2681 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5760 place count 2611 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5890 place count 2561 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6000 place count 2513 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6080 place count 2481 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6144 place count 2451 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6186 place count 2433 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6216 place count 2417 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 2409 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 2403 transition count 8355
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 2400 transition count 8354
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6245 place count 2400 transition count 7804
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7894 place count 1301 transition count 7804
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8445 place count 750 transition count 7253
Iterating global reduction 23 with 551 rules applied. Total rules applied 8996 place count 750 transition count 7253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8996 place count 750 transition count 7252
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8998 place count 749 transition count 7252
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 9537 place count 210 transition count 1323
Iterating global reduction 23 with 539 rules applied. Total rules applied 10076 place count 210 transition count 1323
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 10615 place count 210 transition count 784
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10666 place count 184 transition count 759
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10688 place count 184 transition count 737
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10710 place count 162 transition count 737
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10732 place count 140 transition count 495
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10765 place count 129 transition count 495
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10787 place count 129 transition count 473
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10798 place count 118 transition count 352
Iterating global reduction 26 with 11 rules applied. Total rules applied 10809 place count 118 transition count 352
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10820 place count 107 transition count 341
Iterating global reduction 26 with 11 rules applied. Total rules applied 10831 place count 107 transition count 341
Applied a total of 10831 rules in 9259 ms. Remains 107 /5073 variables (removed 4966) and now considering 341/13842 (removed 13501) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 107 cols
[2024-05-25 15:09:47] [INFO ] Computed 40 invariants in 11 ms
[2024-05-25 15:09:47] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:09:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:09:47] [INFO ] [Nat]Absence check using 4 positive and 36 generalized place invariants in 8 ms returned sat
[2024-05-25 15:09:48] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:09:48] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:09:48] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Applied a total of 0 rules in 623 ms. Remains 5410 /5410 variables (removed 0) and now considering 8689/8689 (removed 0) transitions.
[2024-05-25 15:09:48] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2024-05-25 15:09:49] [INFO ] Computed 1249 invariants in 250 ms
[2024-05-25 15:09:53] [INFO ] Implicit Places using invariants in 4307 ms returned []
[2024-05-25 15:09:53] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:09:53] [INFO ] Invariant cache hit.
[2024-05-25 15:09:57] [INFO ] Implicit Places using invariants and state equation in 4457 ms returned []
Implicit Place search using SMT with State Equation took 8766 ms to find 0 implicit places.
[2024-05-25 15:09:58] [INFO ] Redundant transitions in 766 ms returned []
[2024-05-25 15:09:58] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:09:58] [INFO ] Invariant cache hit.
[2024-05-25 15:10:03] [INFO ] Dead Transitions using invariants and state equation in 5401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15563 ms. Remains : 5410/5410 places, 8689/8689 transitions.
Computed a total of 2811 stabilizing places and 3513 stable transitions
Computed a total of 2811 stabilizing places and 3513 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23656 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23656 steps, saw 11243 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:10:07] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:10:07] [INFO ] Invariant cache hit.
[2024-05-25 15:10:07] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:10:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 15:10:08] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 372 ms returned sat
[2024-05-25 15:10:15] [INFO ] After 6832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:10:15] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2024-05-25 15:10:16] [INFO ] After 1046ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:10:22] [INFO ] Deduced a trap composed of 591 places in 5896 ms of which 5 ms to minimize.
[2024-05-25 15:10:29] [INFO ] Deduced a trap composed of 355 places in 5901 ms of which 5 ms to minimize.
[2024-05-25 15:10:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12572 ms
[2024-05-25 15:10:29] [INFO ] After 13825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 351 ms.
[2024-05-25 15:10:29] [INFO ] After 22154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5073 transition count 13842
Applied a total of 699 rules in 2642 ms. Remains 5073 /5410 variables (removed 337) and now considering 13842/8689 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2642 ms. Remains : 5073/5410 places, 13842/8689 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19932 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19932 steps, saw 9361 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:10:36] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2024-05-25 15:10:36] [INFO ] Computed 1249 invariants in 367 ms
[2024-05-25 15:10:37] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:10:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 15:10:38] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 351 ms returned sat
[2024-05-25 15:10:44] [INFO ] After 6618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:10:44] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:10:53] [INFO ] After 9051ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:11:02] [INFO ] Deduced a trap composed of 294 places in 8136 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:11:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:11:02] [INFO ] After 25280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 861 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 864 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 863 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2024-05-25 15:11:04] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:11:04] [INFO ] Invariant cache hit.
[2024-05-25 15:11:08] [INFO ] Implicit Places using invariants in 4758 ms returned []
Implicit Place search using SMT only with invariants took 4759 ms to find 0 implicit places.
[2024-05-25 15:11:08] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:11:08] [INFO ] Invariant cache hit.
[2024-05-25 15:11:16] [INFO ] Dead Transitions using invariants and state equation in 7534 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13160 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3578 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51800 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 449 rules applied. Total rules applied 3816 place count 3358 transition count 9825
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4227 place count 3199 transition count 9573
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4577 place count 3072 transition count 9350
Ensure Unique test removed 27 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 319 rules applied. Total rules applied 4896 place count 2947 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5162 place count 2849 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5400 place count 2753 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5592 place count 2681 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5760 place count 2611 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5890 place count 2561 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6000 place count 2513 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6080 place count 2481 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6144 place count 2451 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6186 place count 2433 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6216 place count 2417 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 2409 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 2403 transition count 8355
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 2400 transition count 8354
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6245 place count 2400 transition count 7804
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7894 place count 1301 transition count 7804
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8445 place count 750 transition count 7253
Iterating global reduction 23 with 551 rules applied. Total rules applied 8996 place count 750 transition count 7253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8996 place count 750 transition count 7252
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8998 place count 749 transition count 7252
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 9537 place count 210 transition count 1323
Iterating global reduction 23 with 539 rules applied. Total rules applied 10076 place count 210 transition count 1323
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 10615 place count 210 transition count 784
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10666 place count 184 transition count 759
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10688 place count 184 transition count 737
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10710 place count 162 transition count 737
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10732 place count 140 transition count 495
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10765 place count 129 transition count 495
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10787 place count 129 transition count 473
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10798 place count 118 transition count 352
Iterating global reduction 26 with 11 rules applied. Total rules applied 10809 place count 118 transition count 352
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10820 place count 107 transition count 341
Iterating global reduction 26 with 11 rules applied. Total rules applied 10831 place count 107 transition count 341
Applied a total of 10831 rules in 9068 ms. Remains 107 /5073 variables (removed 4966) and now considering 341/13842 (removed 13501) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 107 cols
[2024-05-25 15:11:25] [INFO ] Computed 40 invariants in 13 ms
[2024-05-25 15:11:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:11:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:25] [INFO ] [Nat]Absence check using 4 positive and 36 generalized place invariants in 5 ms returned sat
[2024-05-25 15:11:25] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:11:25] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:11:25] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1246 reset in 1198 ms.
Product exploration explored 100000 steps with 1247 reset in 1242 ms.
Built C files in :
/tmp/ltsmin239570003451475457
[2024-05-25 15:11:28] [INFO ] Too many transitions (8689) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:11:28] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin239570003451475457
Running compilation step : cd /tmp/ltsmin239570003451475457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin239570003451475457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin239570003451475457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Applied a total of 0 rules in 610 ms. Remains 5410 /5410 variables (removed 0) and now considering 8689/8689 (removed 0) transitions.
[2024-05-25 15:11:32] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2024-05-25 15:11:32] [INFO ] Computed 1249 invariants in 234 ms
[2024-05-25 15:11:36] [INFO ] Implicit Places using invariants in 4428 ms returned []
[2024-05-25 15:11:36] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:11:36] [INFO ] Invariant cache hit.
[2024-05-25 15:11:40] [INFO ] Implicit Places using invariants and state equation in 4220 ms returned []
Implicit Place search using SMT with State Equation took 8649 ms to find 0 implicit places.
[2024-05-25 15:11:41] [INFO ] Redundant transitions in 746 ms returned []
[2024-05-25 15:11:41] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2024-05-25 15:11:41] [INFO ] Invariant cache hit.
[2024-05-25 15:11:46] [INFO ] Dead Transitions using invariants and state equation in 5138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15148 ms. Remains : 5410/5410 places, 8689/8689 transitions.
Built C files in :
/tmp/ltsmin588497186781299443
[2024-05-25 15:11:46] [INFO ] Too many transitions (8689) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:11:46] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin588497186781299443
Running compilation step : cd /tmp/ltsmin588497186781299443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin588497186781299443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin588497186781299443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:11:50] [INFO ] Flatten gal took : 277 ms
[2024-05-25 15:11:50] [INFO ] Flatten gal took : 221 ms
[2024-05-25 15:11:50] [INFO ] Time to serialize gal into /tmp/LTL4414019582814032974.gal : 54 ms
[2024-05-25 15:11:50] [INFO ] Time to serialize properties into /tmp/LTL9587731622861829280.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4414019582814032974.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11818122713165784485.hoa' '-atoms' '/tmp/LTL9587731622861829280.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9587731622861829280.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11818122713165784485.hoa
Detected timeout of ITS tools.
[2024-05-25 15:12:06] [INFO ] Flatten gal took : 211 ms
[2024-05-25 15:12:06] [INFO ] Flatten gal took : 219 ms
[2024-05-25 15:12:06] [INFO ] Time to serialize gal into /tmp/LTL7748330525123587650.gal : 38 ms
[2024-05-25 15:12:06] [INFO ] Time to serialize properties into /tmp/LTL12214359588372874478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7748330525123587650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12214359588372874478.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
Detected timeout of ITS tools.
[2024-05-25 15:12:21] [INFO ] Flatten gal took : 209 ms
[2024-05-25 15:12:21] [INFO ] Applying decomposition
[2024-05-25 15:12:22] [INFO ] Flatten gal took : 220 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9547949385860906694.txt' '-o' '/tmp/graph9547949385860906694.bin' '-w' '/tmp/graph9547949385860906694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9547949385860906694.bin' '-l' '-1' '-v' '-w' '/tmp/graph9547949385860906694.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:12:22] [INFO ] Decomposing Gal with order
[2024-05-25 15:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:12:23] [INFO ] Removed a total of 7041 redundant transitions.
[2024-05-25 15:12:24] [INFO ] Flatten gal took : 837 ms
[2024-05-25 15:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 885 labels/synchronizations in 148 ms.
[2024-05-25 15:12:25] [INFO ] Time to serialize gal into /tmp/LTL142585446662068172.gal : 53 ms
[2024-05-25 15:12:25] [INFO ] Time to serialize properties into /tmp/LTL5913884237363800941.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL142585446662068172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5913884237363800941.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu144.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu144.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(gu144.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu144.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14688962232820104746
[2024-05-25 15:12:40] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14688962232820104746
Running compilation step : cd /tmp/ltsmin14688962232820104746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14688962232820104746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14688962232820104746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09 finished in 284313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||F(G(p2))) U p2))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 27 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 2 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 2 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 2 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Applied a total of 27586 rules in 3538 ms. Remains 5411 /19204 variables (removed 13793) and now considering 8690/27973 (removed 19283) transitions.
[2024-05-25 15:12:46] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2024-05-25 15:12:47] [INFO ] Computed 1249 invariants in 239 ms
[2024-05-25 15:12:51] [INFO ] Implicit Places using invariants in 4372 ms returned []
[2024-05-25 15:12:51] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:12:51] [INFO ] Invariant cache hit.
[2024-05-25 15:12:57] [INFO ] Implicit Places using invariants and state equation in 6041 ms returned []
Implicit Place search using SMT with State Equation took 10417 ms to find 0 implicit places.
[2024-05-25 15:12:58] [INFO ] Redundant transitions in 765 ms returned []
[2024-05-25 15:12:58] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:12:58] [INFO ] Invariant cache hit.
[2024-05-25 15:13:03] [INFO ] Dead Transitions using invariants and state equation in 5613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5411/19204 places, 8690/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20345 ms. Remains : 5411/19204 places, 8690/27973 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s371), p1:(LEQ s1702 s2655), p0:(LEQ 1 s1393)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 106 steps with 2 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10 finished in 20516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(G(!p0)||F((G(F(p1))||(p2&&F(p1))))))))'
Support contains 5 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 587 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:13:04] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:13:06] [INFO ] Computed 1249 invariants in 2364 ms
[2024-05-25 15:13:08] [INFO ] Implicit Places using invariants in 3854 ms returned []
Implicit Place search using SMT only with invariants took 3855 ms to find 0 implicit places.
[2024-05-25 15:13:08] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:13:08] [INFO ] Invariant cache hit.
[2024-05-25 15:13:09] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5981 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s7669 s4338), p1:(GT 1 s3254), p2:(GT s3580 s11846)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1833 reset in 2227 ms.
Product exploration explored 100000 steps with 1770 reset in 2202 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 477 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:13:16] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:13:16] [INFO ] Invariant cache hit.
[2024-05-25 15:13:18] [INFO ] [Real]Absence check using 47 positive place invariants in 212 ms returned sat
[2024-05-25 15:13:19] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 724 ms returned sat
[2024-05-25 15:13:41] [INFO ] After 21481ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:13:41] [INFO ] State equation strengthened by 8602 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:13:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:13:41] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 29 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 18 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 3 with 336 rules applied. Total rules applied 27918 place count 5413 transition count 13736
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 3 with 336 rules applied. Total rules applied 28254 place count 5077 transition count 13736
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 28304 place count 5077 transition count 13736
Applied a total of 28304 rules in 5518 ms. Remains 5077 /19204 variables (removed 14127) and now considering 13736/27973 (removed 14237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5520 ms. Remains : 5077/19204 places, 13736/27973 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19826 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19826 steps, saw 9328 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:13:50] [INFO ] Flow matrix only has 12851 transitions (discarded 885 similar events)
// Phase 1: matrix 12851 rows 5077 cols
[2024-05-25 15:13:51] [INFO ] Computed 1249 invariants in 316 ms
[2024-05-25 15:13:51] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 15:13:51] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 332 ms returned sat
[2024-05-25 15:13:58] [INFO ] After 6923ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:13:59] [INFO ] State equation strengthened by 8492 read => feed constraints.
[2024-05-25 15:14:00] [INFO ] After 1237ms SMT Verify possible using 8492 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:14:00] [INFO ] After 9269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:14:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 15:14:01] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 333 ms returned sat
[2024-05-25 15:14:09] [INFO ] After 8175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:14:15] [INFO ] After 5897ms SMT Verify possible using 8492 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:14:15] [INFO ] After 6465ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 371 ms.
[2024-05-25 15:14:16] [INFO ] After 16028ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 5077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13736/13736 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 5077 transition count 13843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 5074 transition count 13843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 5073 transition count 13842
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 5073 transition count 13842
Applied a total of 8 rules in 2077 ms. Remains 5073 /5077 variables (removed 4) and now considering 13842/13736 (removed -106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2077 ms. Remains : 5073/5077 places, 13842/13736 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20476 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20476 steps, saw 9601 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:14:22] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2024-05-25 15:14:22] [INFO ] Computed 1249 invariants in 339 ms
[2024-05-25 15:14:23] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-25 15:14:23] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 323 ms returned sat
[2024-05-25 15:14:30] [INFO ] After 6983ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:14:30] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:14:31] [INFO ] After 1341ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:14:31] [INFO ] After 9370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:14:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-25 15:14:32] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 325 ms returned sat
[2024-05-25 15:14:41] [INFO ] After 8357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:14:45] [INFO ] After 4432ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:14:46] [INFO ] After 5002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 363 ms.
[2024-05-25 15:14:46] [INFO ] After 14698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 857 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 858 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 841 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2024-05-25 15:14:48] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:14:48] [INFO ] Invariant cache hit.
[2024-05-25 15:14:55] [INFO ] Implicit Places using invariants in 7400 ms returned []
Implicit Place search using SMT only with invariants took 7402 ms to find 0 implicit places.
[2024-05-25 15:14:55] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:14:55] [INFO ] Invariant cache hit.
[2024-05-25 15:15:04] [INFO ] Dead Transitions using invariants and state equation in 8491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16736 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 15 factoid took 841 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Support contains 3 out of 19204 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 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6597 transitions
Trivial Post-agglo rules discarded 6597 transitions
Performed 6597 trivial Post agglomeration. Transition count delta: 6597
Iterating post reduction 0 with 6597 rules applied. Total rules applied 6597 place count 19204 transition count 21376
Reduce places removed 6597 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13196 place count 12607 transition count 21374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 27 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6047 places :
Symmetric choice reduction at 3 with 6047 rule applications. Total rules 20345 place count 6008 transition count 14777
Iterating global reduction 3 with 6047 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14758
Deduced a syphon composed of 19 places in 16 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 26430 place count 5989 transition count 14758
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 26976 place count 5443 transition count 8752
Iterating global reduction 3 with 546 rules applied. Total rules applied 27522 place count 5443 transition count 8752
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27572 place count 5418 transition count 8727
Applied a total of 27572 rules in 3495 ms. Remains 5418 /19204 variables (removed 13786) and now considering 8727/27973 (removed 19246) transitions.
[2024-05-25 15:15:08] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
// Phase 1: matrix 8127 rows 5418 cols
[2024-05-25 15:15:09] [INFO ] Computed 1249 invariants in 232 ms
[2024-05-25 15:15:14] [INFO ] Implicit Places using invariants in 6005 ms returned []
[2024-05-25 15:15:14] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:15:14] [INFO ] Invariant cache hit.
[2024-05-25 15:15:20] [INFO ] Implicit Places using invariants and state equation in 6052 ms returned []
Implicit Place search using SMT with State Equation took 12060 ms to find 0 implicit places.
[2024-05-25 15:15:21] [INFO ] Redundant transitions in 773 ms returned []
[2024-05-25 15:15:21] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:15:21] [INFO ] Invariant cache hit.
[2024-05-25 15:15:27] [INFO ] Dead Transitions using invariants and state equation in 5589 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5418/19204 places, 8727/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21922 ms. Remains : 5418/19204 places, 8727/27973 transitions.
Computed a total of 2819 stabilizing places and 3551 stable transitions
Computed a total of 2819 stabilizing places and 3551 stable transitions
Detected a total of 2819/5418 stabilizing places and 3551/8727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 8 factoid took 251 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:15:28] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:15:28] [INFO ] Invariant cache hit.
[2024-05-25 15:15:28] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 15:15:29] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 342 ms returned sat
[2024-05-25 15:15:33] [INFO ] After 4550ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:15:33] [INFO ] State equation strengthened by 3142 read => feed constraints.
[2024-05-25 15:15:34] [INFO ] After 482ms SMT Verify possible using 3142 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:15:34] [INFO ] After 6151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:15:34] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-05-25 15:15:35] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 358 ms returned sat
[2024-05-25 15:15:40] [INFO ] After 4874ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:15:40] [INFO ] After 623ms SMT Verify possible using 3142 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:15:41] [INFO ] After 1043ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 237 ms.
[2024-05-25 15:15:41] [INFO ] After 7246ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 5418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5418 transition count 8726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5417 transition count 8726
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 5414 transition count 8713
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 5414 transition count 8713
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 5414 transition count 8711
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 5412 transition count 8711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 5410 transition count 8689
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 5410 transition count 8689
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 353 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 690 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 715 place count 5073 transition count 13842
Applied a total of 715 rules in 3567 ms. Remains 5073 /5418 variables (removed 345) and now considering 13842/8727 (removed -5115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3567 ms. Remains : 5073/5418 places, 13842/8727 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19984 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19984 steps, saw 9389 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:15:48] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2024-05-25 15:15:49] [INFO ] Computed 1249 invariants in 336 ms
[2024-05-25 15:15:49] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-25 15:15:50] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 334 ms returned sat
[2024-05-25 15:15:57] [INFO ] After 7385ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:15:57] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:15:58] [INFO ] After 1298ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:15:58] [INFO ] After 9745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:15:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-05-25 15:15:59] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 339 ms returned sat
[2024-05-25 15:16:07] [INFO ] After 7362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:12] [INFO ] After 4872ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:12] [INFO ] After 5465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 394 ms.
[2024-05-25 15:16:13] [INFO ] After 14213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 871 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 872 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 862 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2024-05-25 15:16:14] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:16:14] [INFO ] Invariant cache hit.
[2024-05-25 15:16:22] [INFO ] Implicit Places using invariants in 7507 ms returned []
Implicit Place search using SMT only with invariants took 7508 ms to find 0 implicit places.
[2024-05-25 15:16:22] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2024-05-25 15:16:22] [INFO ] Invariant cache hit.
[2024-05-25 15:16:30] [INFO ] Dead Transitions using invariants and state equation in 8262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16635 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3579 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51800 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.20 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3358 transition count 9824
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3198 transition count 9570
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3070 transition count 9346
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2944 transition count 9152
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2846 transition count 8984
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2750 transition count 8842
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2678 transition count 8722
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2608 transition count 8624
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2558 transition count 8544
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2510 transition count 8482
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2478 transition count 8434
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2448 transition count 8400
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2430 transition count 8376
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2414 transition count 8362
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2406 transition count 8354
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2399 transition count 8352
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2397 transition count 8352
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2397 transition count 7802
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7899 place count 1298 transition count 7802
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8450 place count 747 transition count 7251
Iterating global reduction 23 with 551 rules applied. Total rules applied 9001 place count 747 transition count 7251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9001 place count 747 transition count 7250
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9003 place count 746 transition count 7250
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9543 place count 206 transition count 1310
Iterating global reduction 23 with 540 rules applied. Total rules applied 10083 place count 206 transition count 1310
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10623 place count 206 transition count 770
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10674 place count 180 transition count 745
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10696 place count 180 transition count 723
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10718 place count 158 transition count 723
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10740 place count 136 transition count 481
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10773 place count 125 transition count 481
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10795 place count 125 transition count 459
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10806 place count 114 transition count 338
Iterating global reduction 26 with 11 rules applied. Total rules applied 10817 place count 114 transition count 338
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10828 place count 103 transition count 327
Iterating global reduction 26 with 11 rules applied. Total rules applied 10839 place count 103 transition count 327
Applied a total of 10839 rules in 9458 ms. Remains 103 /5073 variables (removed 4970) and now considering 327/13842 (removed 13515) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 327 rows 103 cols
[2024-05-25 15:16:40] [INFO ] Computed 38 invariants in 4 ms
[2024-05-25 15:16:40] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 15:16:40] [INFO ] [Real]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:16:40] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:16:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:16:40] [INFO ] [Nat]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:16:40] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:40] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:16:40] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 9 factoid took 351 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Product exploration explored 100000 steps with 1261 reset in 1189 ms.
Product exploration explored 100000 steps with 1260 reset in 1231 ms.
Built C files in :
/tmp/ltsmin17568311426780380503
[2024-05-25 15:16:43] [INFO ] Too many transitions (8727) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:16:43] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17568311426780380503
Running compilation step : cd /tmp/ltsmin17568311426780380503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17568311426780380503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17568311426780380503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5418 transition count 8726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5417 transition count 8726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 5415 transition count 8714
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5415 transition count 8714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 5415 transition count 8713
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 5414 transition count 8713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 5413 transition count 8702
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 5413 transition count 8702
Applied a total of 10 rules in 1691 ms. Remains 5413 /5418 variables (removed 5) and now considering 8702/8727 (removed 25) transitions.
[2024-05-25 15:16:48] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:16:48] [INFO ] Computed 1249 invariants in 235 ms
[2024-05-25 15:16:54] [INFO ] Implicit Places using invariants in 5726 ms returned []
[2024-05-25 15:16:54] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:16:54] [INFO ] Invariant cache hit.
[2024-05-25 15:16:59] [INFO ] Implicit Places using invariants and state equation in 4838 ms returned []
Implicit Place search using SMT with State Equation took 10565 ms to find 0 implicit places.
[2024-05-25 15:16:59] [INFO ] Redundant transitions in 774 ms returned []
[2024-05-25 15:16:59] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:16:59] [INFO ] Invariant cache hit.
[2024-05-25 15:17:05] [INFO ] Dead Transitions using invariants and state equation in 5230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5413/5418 places, 8702/8727 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18270 ms. Remains : 5413/5418 places, 8702/8727 transitions.
Built C files in :
/tmp/ltsmin10863519383848801063
[2024-05-25 15:17:05] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:17:05] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10863519383848801063
Running compilation step : cd /tmp/ltsmin10863519383848801063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10863519383848801063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10863519383848801063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:17:09] [INFO ] Flatten gal took : 344 ms
[2024-05-25 15:17:09] [INFO ] Flatten gal took : 245 ms
[2024-05-25 15:17:09] [INFO ] Time to serialize gal into /tmp/LTL9608269092443320353.gal : 41 ms
[2024-05-25 15:17:09] [INFO ] Time to serialize properties into /tmp/LTL13315701439448705827.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9608269092443320353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15244460944860020553.hoa' '-atoms' '/tmp/LTL13315701439448705827.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13315701439448705827.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15244460944860020553.hoa
Detected timeout of ITS tools.
[2024-05-25 15:17:25] [INFO ] Flatten gal took : 300 ms
[2024-05-25 15:17:25] [INFO ] Flatten gal took : 212 ms
[2024-05-25 15:17:25] [INFO ] Time to serialize gal into /tmp/LTL15112237271442010999.gal : 37 ms
[2024-05-25 15:17:25] [INFO ] Time to serialize properties into /tmp/LTL1728394216598244046.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15112237271442010999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1728394216598244046.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(Node10ManageTheCrashOfNode0>Node5HasTheLeafSe...386
Formula 0 simplified : G(X!"(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(Node10ManageTheCrashOfNode0>Node5HasTheLeafSetOfL...370
Detected timeout of ITS tools.
[2024-05-25 15:17:40] [INFO ] Flatten gal took : 211 ms
[2024-05-25 15:17:40] [INFO ] Applying decomposition
[2024-05-25 15:17:40] [INFO ] Flatten gal took : 220 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2143079112660537808.txt' '-o' '/tmp/graph2143079112660537808.bin' '-w' '/tmp/graph2143079112660537808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2143079112660537808.bin' '-l' '-1' '-v' '-w' '/tmp/graph2143079112660537808.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:17:41] [INFO ] Decomposing Gal with order
[2024-05-25 15:17:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:17:42] [INFO ] Removed a total of 7463 redundant transitions.
[2024-05-25 15:17:42] [INFO ] Flatten gal took : 1076 ms
[2024-05-25 15:17:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 280 ms.
[2024-05-25 15:17:43] [INFO ] Time to serialize gal into /tmp/LTL10261530080847334324.gal : 48 ms
[2024-05-25 15:17:43] [INFO ] Time to serialize properties into /tmp/LTL9874498526230084310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10261530080847334324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9874498526230084310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("(gu149.Node10ManageTheCrashOfNode0<=gu149.Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(gu149.Node10ManageTheCrashOfNode0...450
Formula 0 simplified : G(X!"(gu149.Node10ManageTheCrashOfNode0<=gu149.Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(gu149.Node10ManageTheCrashOfNode0>gu1...434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6808465815179744524
[2024-05-25 15:17:58] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6808465815179744524
Running compilation step : cd /tmp/ltsmin6808465815179744524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6808465815179744524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6808465815179744524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 finished in 298030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Iterating post reduction 1 with 6598 rules applied. Total rules applied 13196 place count 12606 transition count 21375
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13196 place count 12606 transition count 20825
Deduced a syphon composed of 550 places in 27 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14296 place count 12056 transition count 20825
Discarding 6048 places :
Symmetric choice reduction at 2 with 6048 rule applications. Total rules 20344 place count 6008 transition count 14777
Iterating global reduction 2 with 6048 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14757
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 26432 place count 5988 transition count 14757
Discarding 547 places :
Symmetric choice reduction at 2 with 547 rule applications. Total rules 26979 place count 5441 transition count 8740
Iterating global reduction 2 with 547 rules applied. Total rules applied 27526 place count 5441 transition count 8740
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27576 place count 5416 transition count 8715
Applied a total of 27576 rules in 3624 ms. Remains 5416 /19204 variables (removed 13788) and now considering 8715/27973 (removed 19258) transitions.
[2024-05-25 15:18:05] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
// Phase 1: matrix 8115 rows 5416 cols
[2024-05-25 15:18:05] [INFO ] Computed 1249 invariants in 230 ms
[2024-05-25 15:18:10] [INFO ] Implicit Places using invariants in 4934 ms returned []
[2024-05-25 15:18:10] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:18:10] [INFO ] Invariant cache hit.
[2024-05-25 15:18:14] [INFO ] Implicit Places using invariants and state equation in 4158 ms returned []
Implicit Place search using SMT with State Equation took 9094 ms to find 0 implicit places.
[2024-05-25 15:18:15] [INFO ] Redundant transitions in 971 ms returned []
[2024-05-25 15:18:15] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:18:15] [INFO ] Invariant cache hit.
[2024-05-25 15:18:20] [INFO ] Dead Transitions using invariants and state equation in 4689 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5416/19204 places, 8715/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18382 ms. Remains : 5416/19204 places, 8715/27973 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1187 s2743), p1:(LEQ s3239 s2079)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1254 reset in 1294 ms.
Product exploration explored 100000 steps with 1251 reset in 1274 ms.
Computed a total of 2817 stabilizing places and 3539 stable transitions
Computed a total of 2817 stabilizing places and 3539 stable transitions
Detected a total of 2817/5416 stabilizing places and 3539/8715 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:18:23] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:18:23] [INFO ] Invariant cache hit.
[2024-05-25 15:18:24] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:18:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 15:18:25] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 336 ms returned sat
[2024-05-25 15:18:30] [INFO ] After 4941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:30] [INFO ] State equation strengthened by 3132 read => feed constraints.
[2024-05-25 15:18:32] [INFO ] After 2453ms SMT Verify possible using 3132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:33] [INFO ] After 2885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2024-05-25 15:18:33] [INFO ] After 9080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5415 transition count 8704
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5415 transition count 8704
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 340 place count 5415 transition count 13846
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 678 place count 5077 transition count 13846
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 728 place count 5077 transition count 13846
Applied a total of 728 rules in 3024 ms. Remains 5077 /5416 variables (removed 339) and now considering 13846/8715 (removed -5131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3026 ms. Remains : 5077/5416 places, 13846/8715 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19636 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19636 steps, saw 9232 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:18:40] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
// Phase 1: matrix 12960 rows 5077 cols
[2024-05-25 15:18:40] [INFO ] Computed 1249 invariants in 347 ms
[2024-05-25 15:18:40] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:18:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 15:18:41] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2024-05-25 15:18:48] [INFO ] After 6752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:48] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:18:53] [INFO ] After 4903ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:54] [INFO ] After 5538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 422 ms.
[2024-05-25 15:18:54] [INFO ] After 13732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 938 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 859 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
[2024-05-25 15:18:56] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2024-05-25 15:18:56] [INFO ] Invariant cache hit.
[2024-05-25 15:19:03] [INFO ] Implicit Places using invariants in 6901 ms returned []
Implicit Place search using SMT only with invariants took 6901 ms to find 0 implicit places.
[2024-05-25 15:19:03] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2024-05-25 15:19:03] [INFO ] Invariant cache hit.
[2024-05-25 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 7863 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15625 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Graph (trivial) has 3579 edges and 5077 vertex of which 25 / 5077 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51807 edges and 5053 vertex of which 5031 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4645 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4403 transition count 11636
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4162 transition count 11196
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3922 transition count 10798
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3722 transition count 10438
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3524 transition count 10116
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3362 transition count 9828
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3202 transition count 9574
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3074 transition count 9350
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2948 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2850 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2754 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2682 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2612 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2562 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2514 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2482 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2452 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2434 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2418 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2410 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2403 transition count 8356
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2401 transition count 8356
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2401 transition count 7806
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 548 places
Reduce places removed 1098 places and 0 transitions.
Iterating global reduction 23 with 1648 rules applied. Total rules applied 7898 place count 1303 transition count 7806
Discarding 550 places :
Symmetric choice reduction at 23 with 550 rule applications. Total rules 8448 place count 753 transition count 7256
Iterating global reduction 23 with 550 rules applied. Total rules applied 8998 place count 753 transition count 7256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8998 place count 753 transition count 7255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9000 place count 752 transition count 7255
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9528 place count 224 transition count 1447
Iterating global reduction 23 with 528 rules applied. Total rules applied 10056 place count 224 transition count 1447
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10584 place count 224 transition count 919
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10635 place count 198 transition count 894
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10657 place count 198 transition count 872
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10679 place count 176 transition count 872
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10701 place count 154 transition count 630
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10734 place count 143 transition count 630
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10756 place count 143 transition count 608
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10767 place count 132 transition count 487
Iterating global reduction 26 with 11 rules applied. Total rules applied 10778 place count 132 transition count 487
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10789 place count 121 transition count 476
Iterating global reduction 26 with 11 rules applied. Total rules applied 10800 place count 121 transition count 476
Applied a total of 10800 rules in 9477 ms. Remains 121 /5077 variables (removed 4956) and now considering 476/13846 (removed 13370) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 476 rows 121 cols
[2024-05-25 15:19:20] [INFO ] Computed 39 invariants in 7 ms
[2024-05-25 15:19:20] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:19:20] [INFO ] [Nat]Absence check using 3 positive and 36 generalized place invariants in 9 ms returned sat
[2024-05-25 15:19:20] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:20] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 15:19:20] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 5416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Applied a total of 0 rules in 615 ms. Remains 5416 /5416 variables (removed 0) and now considering 8715/8715 (removed 0) transitions.
[2024-05-25 15:19:22] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
// Phase 1: matrix 8115 rows 5416 cols
[2024-05-25 15:19:22] [INFO ] Computed 1249 invariants in 330 ms
[2024-05-25 15:19:27] [INFO ] Implicit Places using invariants in 5048 ms returned []
[2024-05-25 15:19:27] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:19:27] [INFO ] Invariant cache hit.
[2024-05-25 15:19:31] [INFO ] Implicit Places using invariants and state equation in 4156 ms returned []
Implicit Place search using SMT with State Equation took 9206 ms to find 0 implicit places.
[2024-05-25 15:19:31] [INFO ] Redundant transitions in 769 ms returned []
[2024-05-25 15:19:31] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:19:31] [INFO ] Invariant cache hit.
[2024-05-25 15:19:36] [INFO ] Dead Transitions using invariants and state equation in 4908 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15509 ms. Remains : 5416/5416 places, 8715/8715 transitions.
Computed a total of 2817 stabilizing places and 3539 stable transitions
Computed a total of 2817 stabilizing places and 3539 stable transitions
Detected a total of 2817/5416 stabilizing places and 3539/8715 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:19:37] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:19:37] [INFO ] Invariant cache hit.
[2024-05-25 15:19:38] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:38] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 15:19:39] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 314 ms returned sat
[2024-05-25 15:19:44] [INFO ] After 5319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:44] [INFO ] State equation strengthened by 3132 read => feed constraints.
[2024-05-25 15:19:47] [INFO ] After 2563ms SMT Verify possible using 3132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:47] [INFO ] After 3012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 265 ms.
[2024-05-25 15:19:47] [INFO ] After 9645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5415 transition count 8704
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5415 transition count 8704
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 340 place count 5415 transition count 13846
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 678 place count 5077 transition count 13846
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 728 place count 5077 transition count 13846
Applied a total of 728 rules in 3113 ms. Remains 5077 /5416 variables (removed 339) and now considering 13846/8715 (removed -5131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3114 ms. Remains : 5077/5416 places, 13846/8715 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19898 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19898 steps, saw 9348 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:19:54] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
// Phase 1: matrix 12960 rows 5077 cols
[2024-05-25 15:19:55] [INFO ] Computed 1249 invariants in 352 ms
[2024-05-25 15:19:55] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 15:19:56] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 341 ms returned sat
[2024-05-25 15:20:04] [INFO ] After 8213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:20:04] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:20:09] [INFO ] After 5030ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:20:10] [INFO ] After 5658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 421 ms.
[2024-05-25 15:20:10] [INFO ] After 15343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 5077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 883 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 860 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
[2024-05-25 15:20:12] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2024-05-25 15:20:12] [INFO ] Invariant cache hit.
[2024-05-25 15:20:19] [INFO ] Implicit Places using invariants in 7312 ms returned []
Implicit Place search using SMT only with invariants took 7315 ms to find 0 implicit places.
[2024-05-25 15:20:19] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2024-05-25 15:20:19] [INFO ] Invariant cache hit.
[2024-05-25 15:20:27] [INFO ] Dead Transitions using invariants and state equation in 7820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15999 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Graph (trivial) has 3579 edges and 5077 vertex of which 25 / 5077 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51807 edges and 5053 vertex of which 5031 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4645 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4403 transition count 11636
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4162 transition count 11196
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3922 transition count 10798
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3722 transition count 10438
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3524 transition count 10116
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3362 transition count 9828
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3202 transition count 9574
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3074 transition count 9350
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2948 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2850 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2754 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2682 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2612 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2562 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2514 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2482 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2452 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2434 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2418 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2410 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2403 transition count 8356
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2401 transition count 8356
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2401 transition count 7806
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 548 places
Reduce places removed 1098 places and 0 transitions.
Iterating global reduction 23 with 1648 rules applied. Total rules applied 7898 place count 1303 transition count 7806
Discarding 550 places :
Symmetric choice reduction at 23 with 550 rule applications. Total rules 8448 place count 753 transition count 7256
Iterating global reduction 23 with 550 rules applied. Total rules applied 8998 place count 753 transition count 7256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8998 place count 753 transition count 7255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9000 place count 752 transition count 7255
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9528 place count 224 transition count 1447
Iterating global reduction 23 with 528 rules applied. Total rules applied 10056 place count 224 transition count 1447
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10584 place count 224 transition count 919
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10635 place count 198 transition count 894
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10657 place count 198 transition count 872
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10679 place count 176 transition count 872
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10701 place count 154 transition count 630
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10734 place count 143 transition count 630
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10756 place count 143 transition count 608
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10767 place count 132 transition count 487
Iterating global reduction 26 with 11 rules applied. Total rules applied 10778 place count 132 transition count 487
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10789 place count 121 transition count 476
Iterating global reduction 26 with 11 rules applied. Total rules applied 10800 place count 121 transition count 476
Applied a total of 10800 rules in 9044 ms. Remains 121 /5077 variables (removed 4956) and now considering 476/13846 (removed 13370) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 476 rows 121 cols
[2024-05-25 15:20:36] [INFO ] Computed 39 invariants in 10 ms
[2024-05-25 15:20:36] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:20:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:20:36] [INFO ] [Nat]Absence check using 3 positive and 36 generalized place invariants in 5 ms returned sat
[2024-05-25 15:20:36] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:20:37] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 15:20:37] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1252 reset in 1186 ms.
Product exploration explored 100000 steps with 1255 reset in 1219 ms.
Built C files in :
/tmp/ltsmin1239090020085046919
[2024-05-25 15:20:40] [INFO ] Too many transitions (8715) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:20:40] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1239090020085046919
Running compilation step : cd /tmp/ltsmin1239090020085046919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1239090020085046919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1239090020085046919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Applied a total of 0 rules in 607 ms. Remains 5416 /5416 variables (removed 0) and now considering 8715/8715 (removed 0) transitions.
[2024-05-25 15:20:43] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
// Phase 1: matrix 8115 rows 5416 cols
[2024-05-25 15:20:43] [INFO ] Computed 1249 invariants in 232 ms
[2024-05-25 15:20:48] [INFO ] Implicit Places using invariants in 5220 ms returned []
[2024-05-25 15:20:48] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:20:48] [INFO ] Invariant cache hit.
[2024-05-25 15:20:53] [INFO ] Implicit Places using invariants and state equation in 4371 ms returned []
Implicit Place search using SMT with State Equation took 9596 ms to find 0 implicit places.
[2024-05-25 15:20:54] [INFO ] Redundant transitions in 729 ms returned []
[2024-05-25 15:20:54] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2024-05-25 15:20:54] [INFO ] Invariant cache hit.
[2024-05-25 15:20:59] [INFO ] Dead Transitions using invariants and state equation in 5491 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16429 ms. Remains : 5416/5416 places, 8715/8715 transitions.
Built C files in :
/tmp/ltsmin8897186275625039337
[2024-05-25 15:20:59] [INFO ] Too many transitions (8715) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:20:59] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8897186275625039337
Running compilation step : cd /tmp/ltsmin8897186275625039337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8897186275625039337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8897186275625039337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:21:03] [INFO ] Flatten gal took : 206 ms
[2024-05-25 15:21:03] [INFO ] Flatten gal took : 251 ms
[2024-05-25 15:21:03] [INFO ] Time to serialize gal into /tmp/LTL8767276422231706549.gal : 37 ms
[2024-05-25 15:21:03] [INFO ] Time to serialize properties into /tmp/LTL12487336716789650194.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8767276422231706549.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4464302334230231230.hoa' '-atoms' '/tmp/LTL12487336716789650194.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12487336716789650194.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4464302334230231230.hoa
Detected timeout of ITS tools.
[2024-05-25 15:21:19] [INFO ] Flatten gal took : 215 ms
[2024-05-25 15:21:19] [INFO ] Flatten gal took : 219 ms
[2024-05-25 15:21:19] [INFO ] Time to serialize gal into /tmp/LTL9811413511072538107.gal : 38 ms
[2024-05-25 15:21:19] [INFO ] Time to serialize properties into /tmp/LTL14339345696041508749.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9811413511072538107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14339345696041508749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node3HasDetectedCrashOfNode23<=Node15ManageTheCrashOfNode18)"))&&(F(G("(Node19HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheL...189
Formula 0 simplified : F(G!"(Node3HasDetectedCrashOfNode23<=Node15ManageTheCrashOfNode18)" | GF!"(Node19HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheLeafSe...179
Detected timeout of ITS tools.
[2024-05-25 15:21:34] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:21:34] [INFO ] Applying decomposition
[2024-05-25 15:21:34] [INFO ] Flatten gal took : 222 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph108091322888746791.txt' '-o' '/tmp/graph108091322888746791.bin' '-w' '/tmp/graph108091322888746791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph108091322888746791.bin' '-l' '-1' '-v' '-w' '/tmp/graph108091322888746791.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:21:35] [INFO ] Decomposing Gal with order
[2024-05-25 15:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:21:36] [INFO ] Removed a total of 7160 redundant transitions.
[2024-05-25 15:21:36] [INFO ] Flatten gal took : 893 ms
[2024-05-25 15:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1043 labels/synchronizations in 181 ms.
[2024-05-25 15:21:37] [INFO ] Time to serialize gal into /tmp/LTL9453111235044012709.gal : 51 ms
[2024-05-25 15:21:37] [INFO ] Time to serialize properties into /tmp/LTL9577952683689545559.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9453111235044012709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9577952683689545559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu217.Node3HasDetectedCrashOfNode23<=gu217.Node15ManageTheCrashOfNode18)"))&&(F(G("(gu253.Node19HasTheLeafSetOfLx6ToReplaceN...213
Formula 0 simplified : F(G!"(gu217.Node3HasDetectedCrashOfNode23<=gu217.Node15ManageTheCrashOfNode18)" | GF!"(gu253.Node19HasTheLeafSetOfLx6ToReplaceNode5<...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15850593327198717171
[2024-05-25 15:21:52] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15850593327198717171
Running compilation step : cd /tmp/ltsmin15850593327198717171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15850593327198717171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15850593327198717171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13 finished in 233640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6600 transitions
Trivial Post-agglo rules discarded 6600 transitions
Performed 6600 trivial Post agglomeration. Transition count delta: 6600
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 21373
Reduce places removed 6600 places and 0 transitions.
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 26 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6050 places :
Symmetric choice reduction at 2 with 6050 rule applications. Total rules 20350 place count 6004 transition count 14773
Iterating global reduction 2 with 6050 rules applied. Total rules applied 26400 place count 6004 transition count 14773
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 26400 place count 6004 transition count 14751
Deduced a syphon composed of 22 places in 17 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 26444 place count 5982 transition count 14751
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 26992 place count 5434 transition count 8723
Iterating global reduction 2 with 548 rules applied. Total rules applied 27540 place count 5434 transition count 8723
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27590 place count 5409 transition count 8698
Applied a total of 27590 rules in 3648 ms. Remains 5409 /19204 variables (removed 13795) and now considering 8698/27973 (removed 19275) transitions.
[2024-05-25 15:21:59] [INFO ] Flow matrix only has 8098 transitions (discarded 600 similar events)
// Phase 1: matrix 8098 rows 5409 cols
[2024-05-25 15:21:59] [INFO ] Computed 1249 invariants in 240 ms
[2024-05-25 15:22:03] [INFO ] Implicit Places using invariants in 4350 ms returned []
[2024-05-25 15:22:03] [INFO ] Flow matrix only has 8098 transitions (discarded 600 similar events)
[2024-05-25 15:22:03] [INFO ] Invariant cache hit.
[2024-05-25 15:22:09] [INFO ] Implicit Places using invariants and state equation in 5619 ms returned []
Implicit Place search using SMT with State Equation took 9969 ms to find 0 implicit places.
[2024-05-25 15:22:10] [INFO ] Redundant transitions in 754 ms returned []
[2024-05-25 15:22:10] [INFO ] Flow matrix only has 8098 transitions (discarded 600 similar events)
[2024-05-25 15:22:10] [INFO ] Invariant cache hit.
[2024-05-25 15:22:15] [INFO ] Dead Transitions using invariants and state equation in 5279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5409/19204 places, 8698/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19662 ms. Remains : 5409/19204 places, 8698/27973 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3007 s2855)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14 finished in 19753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 588 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:22:15] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:22:18] [INFO ] Computed 1249 invariants in 2323 ms
[2024-05-25 15:22:19] [INFO ] Implicit Places using invariants in 3768 ms returned []
Implicit Place search using SMT only with invariants took 3768 ms to find 0 implicit places.
[2024-05-25 15:22:19] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:22:19] [INFO ] Invariant cache hit.
[2024-05-25 15:22:21] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5838 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s14261 s13339) (GT 2 s12689)), p0:(OR (LEQ 2 s10239) (LEQ s14261 s13339))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 886 reset in 1848 ms.
Product exploration explored 100000 steps with 885 reset in 1823 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9764 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9764 steps, saw 4809 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:22:29] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:22:29] [INFO ] Invariant cache hit.
[2024-05-25 15:22:32] [INFO ] After 2763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:22:34] [INFO ] [Nat]Absence check using 47 positive place invariants in 170 ms returned sat
[2024-05-25 15:22:35] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 789 ms returned sat
[2024-05-25 15:22:57] [INFO ] After 20659ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 15:22:57] [INFO ] State equation strengthened by 8602 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:22:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:22:57] [INFO ] After 25165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 28 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 19 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27919 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28256 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 28306 place count 5076 transition count 13845
Applied a total of 28306 rules in 5475 ms. Remains 5076 /19204 variables (removed 14128) and now considering 13845/27973 (removed 14128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5475 ms. Remains : 5076/19204 places, 13845/27973 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19189 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19189 steps, saw 9036 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:23:06] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2024-05-25 15:23:07] [INFO ] Computed 1249 invariants in 331 ms
[2024-05-25 15:23:07] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:23:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 15:23:08] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 317 ms returned sat
[2024-05-25 15:23:18] [INFO ] After 9679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:23:18] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:23:24] [INFO ] After 5775ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:23:31] [INFO ] Deduced a trap composed of 546 places in 6825 ms of which 5 ms to minimize.
[2024-05-25 15:23:32] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 8027 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:23:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:23:32] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 851 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 905 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2024-05-25 15:23:34] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:23:34] [INFO ] Invariant cache hit.
[2024-05-25 15:23:39] [INFO ] Implicit Places using invariants in 4774 ms returned []
Implicit Place search using SMT only with invariants took 4774 ms to find 0 implicit places.
[2024-05-25 15:23:39] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:23:39] [INFO ] Invariant cache hit.
[2024-05-25 15:23:47] [INFO ] Dead Transitions using invariants and state equation in 7681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13363 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 3 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 8992 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2024-05-25 15:23:56] [INFO ] Computed 54 invariants in 21 ms
[2024-05-25 15:23:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:23:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:23:56] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 10 ms returned sat
[2024-05-25 15:23:56] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:23:56] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-25 15:23:56] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 29 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Applied a total of 27582 rules in 3709 ms. Remains 5413 /19204 variables (removed 13791) and now considering 8702/27973 (removed 19271) transitions.
[2024-05-25 15:24:00] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:24:00] [INFO ] Computed 1249 invariants in 259 ms
[2024-05-25 15:24:04] [INFO ] Implicit Places using invariants in 4371 ms returned []
[2024-05-25 15:24:04] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:24:04] [INFO ] Invariant cache hit.
[2024-05-25 15:24:09] [INFO ] Implicit Places using invariants and state equation in 4109 ms returned []
Implicit Place search using SMT with State Equation took 8480 ms to find 0 implicit places.
[2024-05-25 15:24:09] [INFO ] Redundant transitions in 776 ms returned []
[2024-05-25 15:24:09] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:24:09] [INFO ] Invariant cache hit.
[2024-05-25 15:24:15] [INFO ] Dead Transitions using invariants and state equation in 5252 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5413/19204 places, 8702/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18228 ms. Remains : 5413/19204 places, 8702/27973 transitions.
Computed a total of 2814 stabilizing places and 3526 stable transitions
Computed a total of 2814 stabilizing places and 3526 stable transitions
Detected a total of 2814/5413 stabilizing places and 3526/8702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 182 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22530 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22530 steps, saw 10729 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:24:18] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:24:18] [INFO ] Invariant cache hit.
[2024-05-25 15:24:19] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:24:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 15:24:20] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 342 ms returned sat
[2024-05-25 15:24:28] [INFO ] After 7461ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:24:28] [INFO ] State equation strengthened by 3122 read => feed constraints.
[2024-05-25 15:24:30] [INFO ] After 2252ms SMT Verify possible using 3122 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 15:24:36] [INFO ] Deduced a trap composed of 626 places in 5903 ms of which 5 ms to minimize.
[2024-05-25 15:24:43] [INFO ] Deduced a trap composed of 1060 places in 5903 ms of which 5 ms to minimize.
[2024-05-25 15:24:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 13473 ms
[2024-05-25 15:24:44] [INFO ] After 16242ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-25 15:24:44] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 724 place count 5076 transition count 13845
Applied a total of 724 rules in 2520 ms. Remains 5076 /5413 variables (removed 337) and now considering 13845/8702 (removed -5143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2520 ms. Remains : 5076/5413 places, 13845/8702 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19458 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19458 steps, saw 9156 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:24:51] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2024-05-25 15:24:51] [INFO ] Computed 1249 invariants in 337 ms
[2024-05-25 15:24:52] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:24:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 15:24:53] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 330 ms returned sat
[2024-05-25 15:25:03] [INFO ] After 9542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:25:03] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:25:08] [INFO ] After 4876ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:25:15] [INFO ] Deduced a trap composed of 546 places in 6972 ms of which 6 ms to minimize.
[2024-05-25 15:25:24] [INFO ] Deduced a trap composed of 528 places in 6928 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:25:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:25:24] [INFO ] After 31943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 845 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 858 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2024-05-25 15:25:25] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:25:25] [INFO ] Invariant cache hit.
[2024-05-25 15:25:30] [INFO ] Implicit Places using invariants in 4853 ms returned []
Implicit Place search using SMT only with invariants took 4854 ms to find 0 implicit places.
[2024-05-25 15:25:30] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:25:30] [INFO ] Invariant cache hit.
[2024-05-25 15:25:38] [INFO ] Dead Transitions using invariants and state equation in 7555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13269 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 3 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 9052 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2024-05-25 15:25:47] [INFO ] Computed 54 invariants in 19 ms
[2024-05-25 15:25:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:25:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:25:47] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 6 ms returned sat
[2024-05-25 15:25:47] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:25:47] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-25 15:25:47] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1245 reset in 1215 ms.
Product exploration explored 100000 steps with 1245 reset in 1261 ms.
Built C files in :
/tmp/ltsmin15544165170330384809
[2024-05-25 15:25:50] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:25:50] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15544165170330384809
Running compilation step : cd /tmp/ltsmin15544165170330384809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15544165170330384809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15544165170330384809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 611 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2024-05-25 15:25:54] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:25:54] [INFO ] Computed 1249 invariants in 231 ms
[2024-05-25 15:25:58] [INFO ] Implicit Places using invariants in 4299 ms returned []
[2024-05-25 15:25:58] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:25:58] [INFO ] Invariant cache hit.
[2024-05-25 15:26:02] [INFO ] Implicit Places using invariants and state equation in 4067 ms returned []
Implicit Place search using SMT with State Equation took 8367 ms to find 0 implicit places.
[2024-05-25 15:26:03] [INFO ] Redundant transitions in 732 ms returned []
[2024-05-25 15:26:03] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:26:03] [INFO ] Invariant cache hit.
[2024-05-25 15:26:08] [INFO ] Dead Transitions using invariants and state equation in 5162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14878 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Built C files in :
/tmp/ltsmin5979210183884307337
[2024-05-25 15:26:12] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:26:12] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5979210183884307337
Running compilation step : cd /tmp/ltsmin5979210183884307337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5979210183884307337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5979210183884307337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:26:16] [INFO ] Flatten gal took : 213 ms
[2024-05-25 15:26:16] [INFO ] Flatten gal took : 226 ms
[2024-05-25 15:26:16] [INFO ] Time to serialize gal into /tmp/LTL7319812567408198298.gal : 40 ms
[2024-05-25 15:26:16] [INFO ] Time to serialize properties into /tmp/LTL3437034458142450975.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7319812567408198298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16477477603896656917.hoa' '-atoms' '/tmp/LTL3437034458142450975.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3437034458142450975.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16477477603896656917.hoa
Detected timeout of ITS tools.
[2024-05-25 15:26:32] [INFO ] Flatten gal took : 300 ms
[2024-05-25 15:26:32] [INFO ] Flatten gal took : 198 ms
[2024-05-25 15:26:32] [INFO ] Time to serialize gal into /tmp/LTL15064722069678102621.gal : 36 ms
[2024-05-25 15:26:32] [INFO ] Time to serialize properties into /tmp/LTL6231783039697922832.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15064722069678102621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6231783039697922832.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode1...323
Formula 0 simplified : XF(!"((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode13)...315
Detected timeout of ITS tools.
[2024-05-25 15:26:47] [INFO ] Flatten gal took : 205 ms
[2024-05-25 15:26:47] [INFO ] Applying decomposition
[2024-05-25 15:26:48] [INFO ] Flatten gal took : 227 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7857195540771075712.txt' '-o' '/tmp/graph7857195540771075712.bin' '-w' '/tmp/graph7857195540771075712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7857195540771075712.bin' '-l' '-1' '-v' '-w' '/tmp/graph7857195540771075712.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:26:48] [INFO ] Decomposing Gal with order
[2024-05-25 15:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:26:49] [INFO ] Removed a total of 7113 redundant transitions.
[2024-05-25 15:26:50] [INFO ] Flatten gal took : 982 ms
[2024-05-25 15:26:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1266 labels/synchronizations in 136 ms.
[2024-05-25 15:26:50] [INFO ] Time to serialize gal into /tmp/LTL7964249661565235596.gal : 50 ms
[2024-05-25 15:26:50] [INFO ] Time to serialize properties into /tmp/LTL13607673432747849443.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7964249661565235596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13607673432747849443.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gi1.gi1.gu403.RequestOfNode13IsSentToLx3>=2)||(gu274.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu274.Node18HasAskedIts...375
Formula 0 simplified : XF(!"((gi1.gi1.gu403.RequestOfNode13IsSentToLx3>=2)||(gu274.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu274.Node18HasAskedItsLe...367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3351777035832459653
[2024-05-25 15:27:06] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3351777035832459653
Running compilation step : cd /tmp/ltsmin3351777035832459653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3351777035832459653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3351777035832459653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 finished in 293719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(G(!p0)||F((G(F(p1))||(p2&&F(p1))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6597 transitions
Trivial Post-agglo rules discarded 6597 transitions
Performed 6597 trivial Post agglomeration. Transition count delta: 6597
Iterating post reduction 0 with 6597 rules applied. Total rules applied 6597 place count 19204 transition count 21376
Reduce places removed 6597 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13196 place count 12607 transition count 21374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 26 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6047 places :
Symmetric choice reduction at 3 with 6047 rule applications. Total rules 20345 place count 6008 transition count 14777
Iterating global reduction 3 with 6047 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14758
Deduced a syphon composed of 19 places in 16 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 26430 place count 5989 transition count 14758
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 26976 place count 5443 transition count 8752
Iterating global reduction 3 with 546 rules applied. Total rules applied 27522 place count 5443 transition count 8752
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27572 place count 5418 transition count 8727
Applied a total of 27572 rules in 3504 ms. Remains 5418 /19204 variables (removed 13786) and now considering 8727/27973 (removed 19246) transitions.
[2024-05-25 15:27:13] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
// Phase 1: matrix 8127 rows 5418 cols
[2024-05-25 15:27:13] [INFO ] Computed 1249 invariants in 230 ms
[2024-05-25 15:27:19] [INFO ] Implicit Places using invariants in 6242 ms returned []
[2024-05-25 15:27:19] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:19] [INFO ] Invariant cache hit.
[2024-05-25 15:27:25] [INFO ] Implicit Places using invariants and state equation in 6011 ms returned []
Implicit Place search using SMT with State Equation took 12253 ms to find 0 implicit places.
[2024-05-25 15:27:25] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:25] [INFO ] Invariant cache hit.
[2024-05-25 15:27:30] [INFO ] Dead Transitions using invariants and state equation in 5315 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5418/19204 places, 8727/27973 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21076 ms. Remains : 5418/19204 places, 8727/27973 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s2163 s1461), p1:(GT 1 s1183), p2:(GT s1250 s2822)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2486 reset in 1396 ms.
Product exploration explored 100000 steps with 2478 reset in 1372 ms.
Computed a total of 2819 stabilizing places and 3551 stable transitions
Computed a total of 2819 stabilizing places and 3551 stable transitions
Detected a total of 2819/5418 stabilizing places and 3551/8727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1063 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:27:35] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:35] [INFO ] Invariant cache hit.
[2024-05-25 15:27:35] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:27:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 15:27:36] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 329 ms returned sat
[2024-05-25 15:27:36] [INFO ] After 904ms SMT Verify possible using all constraints in natural 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 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F p2), (F (NOT p1)), (F (AND p2 p1))]
Knowledge based reduction with 15 factoid took 958 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Support contains 3 out of 5418 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 : 5418/5418 places, 8727/8727 transitions.
Applied a total of 0 rules in 599 ms. Remains 5418 /5418 variables (removed 0) and now considering 8727/8727 (removed 0) transitions.
[2024-05-25 15:27:38] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:38] [INFO ] Invariant cache hit.
[2024-05-25 15:27:44] [INFO ] Implicit Places using invariants in 5938 ms returned []
[2024-05-25 15:27:44] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:44] [INFO ] Invariant cache hit.
[2024-05-25 15:27:50] [INFO ] Implicit Places using invariants and state equation in 5950 ms returned []
Implicit Place search using SMT with State Equation took 11890 ms to find 0 implicit places.
[2024-05-25 15:27:51] [INFO ] Redundant transitions in 734 ms returned []
[2024-05-25 15:27:51] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:51] [INFO ] Invariant cache hit.
[2024-05-25 15:27:56] [INFO ] Dead Transitions using invariants and state equation in 5630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18860 ms. Remains : 5418/5418 places, 8727/8727 transitions.
Computed a total of 2819 stabilizing places and 3551 stable transitions
Computed a total of 2819 stabilizing places and 3551 stable transitions
Detected a total of 2819/5418 stabilizing places and 3551/8727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 8 factoid took 245 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:27:57] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2024-05-25 15:27:57] [INFO ] Invariant cache hit.
[2024-05-25 15:27:58] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2024-05-25 15:27:58] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 330 ms returned sat
[2024-05-25 15:28:03] [INFO ] After 4561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:28:03] [INFO ] State equation strengthened by 3142 read => feed constraints.
[2024-05-25 15:28:03] [INFO ] After 475ms SMT Verify possible using 3142 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:28:03] [INFO ] After 6123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:28:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 15:28:04] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2024-05-25 15:28:09] [INFO ] After 4632ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:28:10] [INFO ] After 704ms SMT Verify possible using 3142 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:28:10] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-05-25 15:28:10] [INFO ] After 7073ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 5418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5418 transition count 8726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5417 transition count 8726
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 5414 transition count 8713
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 5414 transition count 8713
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 5414 transition count 8711
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 5412 transition count 8711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 5410 transition count 8689
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 5410 transition count 8689
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 353 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 690 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 715 place count 5073 transition count 13842
Applied a total of 715 rules in 3475 ms. Remains 5073 /5418 variables (removed 345) and now considering 13842/8727 (removed -5115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3475 ms. Remains : 5073/5418 places, 13842/8727 transitions.
Finished random walk after 2678 steps, including 39 resets, run visited all 1 properties in 164 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F p2), (F (NOT p1)), (F (AND p2 p1))]
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 547 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), false]
Product exploration explored 100000 steps with 1263 reset in 1504 ms.
Product exploration explored 100000 steps with 1258 reset in 1497 ms.
Built C files in :
/tmp/ltsmin6403351423215526205
[2024-05-25 15:28:18] [INFO ] Too many transitions (8727) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:28:19] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6403351423215526205
Running compilation step : cd /tmp/ltsmin6403351423215526205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6403351423215526205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6403351423215526205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5418 transition count 8726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5417 transition count 8726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 5415 transition count 8714
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5415 transition count 8714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 5415 transition count 8713
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 5414 transition count 8713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 5413 transition count 8702
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 5413 transition count 8702
Applied a total of 10 rules in 1722 ms. Remains 5413 /5418 variables (removed 5) and now considering 8702/8727 (removed 25) transitions.
[2024-05-25 15:28:23] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:28:24] [INFO ] Computed 1249 invariants in 232 ms
[2024-05-25 15:28:29] [INFO ] Implicit Places using invariants in 5675 ms returned []
[2024-05-25 15:28:29] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:28:29] [INFO ] Invariant cache hit.
[2024-05-25 15:28:34] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 10393 ms to find 0 implicit places.
[2024-05-25 15:28:34] [INFO ] Redundant transitions in 765 ms returned []
[2024-05-25 15:28:34] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:28:34] [INFO ] Invariant cache hit.
[2024-05-25 15:28:40] [INFO ] Dead Transitions using invariants and state equation in 5530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5413/5418 places, 8702/8727 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18422 ms. Remains : 5413/5418 places, 8702/8727 transitions.
Built C files in :
/tmp/ltsmin16714297084083339269
[2024-05-25 15:28:40] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:28:40] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16714297084083339269
Running compilation step : cd /tmp/ltsmin16714297084083339269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16714297084083339269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16714297084083339269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:28:44] [INFO ] Flatten gal took : 229 ms
[2024-05-25 15:28:44] [INFO ] Flatten gal took : 231 ms
[2024-05-25 15:28:44] [INFO ] Time to serialize gal into /tmp/LTL12674545910229885435.gal : 39 ms
[2024-05-25 15:28:44] [INFO ] Time to serialize properties into /tmp/LTL7850432713412495154.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12674545910229885435.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15943123346058165225.hoa' '-atoms' '/tmp/LTL7850432713412495154.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7850432713412495154.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15943123346058165225.hoa
Detected timeout of ITS tools.
[2024-05-25 15:29:00] [INFO ] Flatten gal took : 242 ms
[2024-05-25 15:29:00] [INFO ] Flatten gal took : 338 ms
[2024-05-25 15:29:00] [INFO ] Time to serialize gal into /tmp/LTL8867513821065134318.gal : 44 ms
[2024-05-25 15:29:00] [INFO ] Time to serialize properties into /tmp/LTL3877795289229553440.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8867513821065134318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3877795289229553440.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X("(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(Node10ManageTheCrashOfNode0>Node5HasTheLeafSe...386
Formula 0 simplified : G(X!"(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(Node10ManageTheCrashOfNode0>Node5HasTheLeafSetOfL...370
Detected timeout of ITS tools.
[2024-05-25 15:29:15] [INFO ] Flatten gal took : 238 ms
[2024-05-25 15:29:15] [INFO ] Applying decomposition
[2024-05-25 15:29:16] [INFO ] Flatten gal took : 254 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9423408799885108103.txt' '-o' '/tmp/graph9423408799885108103.bin' '-w' '/tmp/graph9423408799885108103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9423408799885108103.bin' '-l' '-1' '-v' '-w' '/tmp/graph9423408799885108103.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:29:16] [INFO ] Decomposing Gal with order
[2024-05-25 15:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:29:18] [INFO ] Removed a total of 7473 redundant transitions.
[2024-05-25 15:29:18] [INFO ] Flatten gal took : 1136 ms
[2024-05-25 15:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1054 labels/synchronizations in 157 ms.
[2024-05-25 15:29:19] [INFO ] Time to serialize gal into /tmp/LTL3154587498607961690.gal : 53 ms
[2024-05-25 15:29:19] [INFO ] Time to serialize properties into /tmp/LTL2126879665945923528.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3154587498607961690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2126879665945923528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X("(gu250.Node10ManageTheCrashOfNode0<=gu250.Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(gu250.Node10ManageTheCrashOfNode0...450
Formula 0 simplified : G(X!"(gu250.Node10ManageTheCrashOfNode0<=gu250.Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(gu250.Node10ManageTheCrashOfNode0>gu2...434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5946417845130686838
[2024-05-25 15:29:34] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5946417845130686838
Running compilation step : cd /tmp/ltsmin5946417845130686838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5946417845130686838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5946417845130686838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 finished in 148204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 30 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 38 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Applied a total of 27582 rules in 3505 ms. Remains 5413 /19204 variables (removed 13791) and now considering 8702/27973 (removed 19271) transitions.
[2024-05-25 15:29:42] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:29:42] [INFO ] Computed 1249 invariants in 234 ms
[2024-05-25 15:29:46] [INFO ] Implicit Places using invariants in 4456 ms returned []
[2024-05-25 15:29:46] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:29:46] [INFO ] Invariant cache hit.
[2024-05-25 15:29:50] [INFO ] Implicit Places using invariants and state equation in 4230 ms returned []
Implicit Place search using SMT with State Equation took 8688 ms to find 0 implicit places.
[2024-05-25 15:29:50] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:29:50] [INFO ] Invariant cache hit.
[2024-05-25 15:29:56] [INFO ] Dead Transitions using invariants and state equation in 5291 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5413/19204 places, 8702/27973 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17485 ms. Remains : 5413/19204 places, 8702/27973 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s3360 s3145) (GT 2 s2999)), p0:(OR (LEQ 2 s2541) (LEQ s3360 s3145))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1245 reset in 1207 ms.
Product exploration explored 100000 steps with 1245 reset in 1240 ms.
Computed a total of 2814 stabilizing places and 3526 stable transitions
Computed a total of 2814 stabilizing places and 3526 stable transitions
Detected a total of 2814/5413 stabilizing places and 3526/8702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 142 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22344 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22344 steps, saw 10646 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:30:02] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:30:02] [INFO ] Invariant cache hit.
[2024-05-25 15:30:03] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:30:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 15:30:04] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 338 ms returned sat
[2024-05-25 15:30:11] [INFO ] After 6912ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:30:11] [INFO ] State equation strengthened by 3122 read => feed constraints.
[2024-05-25 15:30:13] [INFO ] After 2247ms SMT Verify possible using 3122 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 15:30:19] [INFO ] Deduced a trap composed of 515 places in 5744 ms of which 4 ms to minimize.
[2024-05-25 15:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6642 ms
[2024-05-25 15:30:21] [INFO ] After 9965ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 931 ms.
[2024-05-25 15:30:22] [INFO ] After 19162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 724 place count 5076 transition count 13845
Applied a total of 724 rules in 2469 ms. Remains 5076 /5413 variables (removed 337) and now considering 13845/8702 (removed -5143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2470 ms. Remains : 5076/5413 places, 13845/8702 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19082 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19082 steps, saw 8988 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:30:29] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2024-05-25 15:30:29] [INFO ] Computed 1249 invariants in 336 ms
[2024-05-25 15:30:30] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:30:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 15:30:31] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 311 ms returned sat
[2024-05-25 15:30:40] [INFO ] After 9526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:30:40] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:30:46] [INFO ] After 5941ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:30:54] [INFO ] Deduced a trap composed of 546 places in 7127 ms of which 6 ms to minimize.
[2024-05-25 15:30:55] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 7915 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:30:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:30:55] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 849 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 849 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 847 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2024-05-25 15:30:56] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:30:56] [INFO ] Invariant cache hit.
[2024-05-25 15:31:01] [INFO ] Implicit Places using invariants in 4989 ms returned []
Implicit Place search using SMT only with invariants took 4989 ms to find 0 implicit places.
[2024-05-25 15:31:01] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:31:01] [INFO ] Invariant cache hit.
[2024-05-25 15:31:09] [INFO ] Dead Transitions using invariants and state equation in 8098 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13938 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 3 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 8951 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2024-05-25 15:31:18] [INFO ] Computed 54 invariants in 20 ms
[2024-05-25 15:31:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:31:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 15:31:18] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 7 ms returned sat
[2024-05-25 15:31:19] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:31:19] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-25 15:31:19] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 607 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2024-05-25 15:31:20] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:31:20] [INFO ] Computed 1249 invariants in 237 ms
[2024-05-25 15:31:24] [INFO ] Implicit Places using invariants in 4438 ms returned []
[2024-05-25 15:31:24] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:31:24] [INFO ] Invariant cache hit.
[2024-05-25 15:31:28] [INFO ] Implicit Places using invariants and state equation in 3917 ms returned []
Implicit Place search using SMT with State Equation took 8356 ms to find 0 implicit places.
[2024-05-25 15:31:29] [INFO ] Redundant transitions in 740 ms returned []
[2024-05-25 15:31:29] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:31:29] [INFO ] Invariant cache hit.
[2024-05-25 15:31:34] [INFO ] Dead Transitions using invariants and state equation in 4934 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14650 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Computed a total of 2814 stabilizing places and 3526 stable transitions
Computed a total of 2814 stabilizing places and 3526 stable transitions
Detected a total of 2814/5413 stabilizing places and 3526/8702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22034 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22034 steps, saw 10505 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:31:39] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:31:39] [INFO ] Invariant cache hit.
[2024-05-25 15:31:40] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:31:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 15:31:41] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2024-05-25 15:31:49] [INFO ] After 7670ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:31:49] [INFO ] State equation strengthened by 3122 read => feed constraints.
[2024-05-25 15:31:51] [INFO ] After 2247ms SMT Verify possible using 3122 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 626 places in 6099 ms of which 5 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 1060 places in 5933 ms of which 6 ms to minimize.
[2024-05-25 15:32:11] [INFO ] Deduced a trap composed of 2 places in 6490 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:32:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:32:11] [INFO ] After 31542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 724 place count 5076 transition count 13845
Applied a total of 724 rules in 2407 ms. Remains 5076 /5413 variables (removed 337) and now considering 13845/8702 (removed -5143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2407 ms. Remains : 5076/5413 places, 13845/8702 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 692 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 20198 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20198 steps, saw 9478 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:32:18] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2024-05-25 15:32:18] [INFO ] Computed 1249 invariants in 346 ms
[2024-05-25 15:32:19] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:32:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 15:32:20] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 321 ms returned sat
[2024-05-25 15:32:30] [INFO ] After 9828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:32:30] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:32:34] [INFO ] After 4713ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:32:42] [INFO ] Deduced a trap composed of 546 places in 6977 ms of which 5 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 2 places in 8241 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:32:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:32:52] [INFO ] After 33344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 868 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 868 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 866 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2024-05-25 15:32:54] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:32:54] [INFO ] Invariant cache hit.
[2024-05-25 15:32:59] [INFO ] Implicit Places using invariants in 4878 ms returned []
Implicit Place search using SMT only with invariants took 4879 ms to find 0 implicit places.
[2024-05-25 15:32:59] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2024-05-25 15:32:59] [INFO ] Invariant cache hit.
[2024-05-25 15:33:06] [INFO ] Dead Transitions using invariants and state equation in 7929 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13679 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 3 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 8929 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2024-05-25 15:33:15] [INFO ] Computed 54 invariants in 19 ms
[2024-05-25 15:33:15] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:33:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:33:16] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 6 ms returned sat
[2024-05-25 15:33:16] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:33:16] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-25 15:33:16] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1244 reset in 1213 ms.
Product exploration explored 100000 steps with 1245 reset in 1238 ms.
Built C files in :
/tmp/ltsmin15904565209384775904
[2024-05-25 15:33:19] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:33:19] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15904565209384775904
Running compilation step : cd /tmp/ltsmin15904565209384775904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15904565209384775904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15904565209384775904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 609 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2024-05-25 15:33:22] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2024-05-25 15:33:23] [INFO ] Computed 1249 invariants in 247 ms
[2024-05-25 15:33:27] [INFO ] Implicit Places using invariants in 4148 ms returned []
[2024-05-25 15:33:27] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:33:27] [INFO ] Invariant cache hit.
[2024-05-25 15:33:31] [INFO ] Implicit Places using invariants and state equation in 4163 ms returned []
Implicit Place search using SMT with State Equation took 8313 ms to find 0 implicit places.
[2024-05-25 15:33:32] [INFO ] Redundant transitions in 724 ms returned []
[2024-05-25 15:33:32] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2024-05-25 15:33:32] [INFO ] Invariant cache hit.
[2024-05-25 15:33:37] [INFO ] Dead Transitions using invariants and state equation in 5230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14880 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Built C files in :
/tmp/ltsmin12450666482022372609
[2024-05-25 15:33:37] [INFO ] Too many transitions (8702) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:33:37] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12450666482022372609
Running compilation step : cd /tmp/ltsmin12450666482022372609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12450666482022372609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12450666482022372609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 15:33:40] [INFO ] Flatten gal took : 209 ms
[2024-05-25 15:33:41] [INFO ] Flatten gal took : 216 ms
[2024-05-25 15:33:41] [INFO ] Time to serialize gal into /tmp/LTL1710571091940272906.gal : 38 ms
[2024-05-25 15:33:41] [INFO ] Time to serialize properties into /tmp/LTL3338678833965606745.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1710571091940272906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5831057730634565967.hoa' '-atoms' '/tmp/LTL3338678833965606745.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3338678833965606745.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5831057730634565967.hoa
Detected timeout of ITS tools.
[2024-05-25 15:33:56] [INFO ] Flatten gal took : 211 ms
[2024-05-25 15:33:56] [INFO ] Flatten gal took : 222 ms
[2024-05-25 15:33:57] [INFO ] Time to serialize gal into /tmp/LTL14647724841616584593.gal : 124 ms
[2024-05-25 15:33:57] [INFO ] Time to serialize properties into /tmp/LTL11619465299299828821.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14647724841616584593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11619465299299828821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode1...323
Formula 0 simplified : XF(!"((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode13)...315
Detected timeout of ITS tools.
[2024-05-25 15:34:12] [INFO ] Flatten gal took : 209 ms
[2024-05-25 15:34:12] [INFO ] Applying decomposition
[2024-05-25 15:34:12] [INFO ] Flatten gal took : 216 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5034635229147813005.txt' '-o' '/tmp/graph5034635229147813005.bin' '-w' '/tmp/graph5034635229147813005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5034635229147813005.bin' '-l' '-1' '-v' '-w' '/tmp/graph5034635229147813005.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:34:12] [INFO ] Decomposing Gal with order
[2024-05-25 15:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:34:14] [INFO ] Removed a total of 7267 redundant transitions.
[2024-05-25 15:34:14] [INFO ] Flatten gal took : 941 ms
[2024-05-25 15:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1162 labels/synchronizations in 137 ms.
[2024-05-25 15:34:16] [INFO ] Time to serialize gal into /tmp/LTL14603767085140371708.gal : 1443 ms
[2024-05-25 15:34:16] [INFO ] Time to serialize properties into /tmp/LTL10942930665774993174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14603767085140371708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10942930665774993174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gi1.gi1.gu441.RequestOfNode13IsSentToLx3>=2)||(gu300.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu300.Node18HasAskedIts...375
Formula 0 simplified : XF(!"((gi1.gi1.gu441.RequestOfNode13IsSentToLx3>=2)||(gu300.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu300.Node18HasAskedItsLe...367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4249988877863370654
[2024-05-25 15:34:31] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4249988877863370654
Running compilation step : cd /tmp/ltsmin4249988877863370654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4249988877863370654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4249988877863370654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 finished in 296356 ms.
[2024-05-25 15:34:35] [INFO ] Flatten gal took : 670 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin389276270354687227
[2024-05-25 15:34:35] [INFO ] Too many transitions (27973) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:34:36] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin389276270354687227
Running compilation step : cd /tmp/ltsmin389276270354687227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 15:34:36] [INFO ] Applying decomposition
[2024-05-25 15:34:37] [INFO ] Flatten gal took : 718 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17862815122101418137.txt' '-o' '/tmp/graph17862815122101418137.bin' '-w' '/tmp/graph17862815122101418137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17862815122101418137.bin' '-l' '-1' '-v' '-w' '/tmp/graph17862815122101418137.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:34:38] [INFO ] Decomposing Gal with order
[2024-05-25 15:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:34:48] [INFO ] Removed a total of 17942 redundant transitions.
[2024-05-25 15:34:49] [INFO ] Flatten gal took : 5722 ms
[2024-05-25 15:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 128 ms.
[2024-05-25 15:34:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality2048628236269747115.gal : 137 ms
[2024-05-25 15:34:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality7906382306567742647.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2048628236269747115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7906382306567742647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 5 LTL properties
Checking formula 0 : !((G(F("(gi0.gi0.gu0.Node10WantsToManageTheCrashOfNode22<1)"))))
Formula 0 simplified : FG!"(gi0.gi0.gu0.Node10WantsToManageTheCrashOfNode22<1)"
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/ltsmin389276270354687227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin389276270354687227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-25 15:52:53] [INFO ] Flatten gal took : 738 ms
[2024-05-25 15:52:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality8259728473298600910.gal : 152 ms
[2024-05-25 15:52:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality10235694037306052368.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8259728473298600910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10235694037306052368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((G(F("(Node10WantsToManageTheCrashOfNode22<1)"))))
Formula 0 simplified : FG!"(Node10WantsToManageTheCrashOfNode22<1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9727344 kB
After kill :
MemTotal: 16393216 kB
MemFree: 10902996 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S24C11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372000082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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