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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-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 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 12M 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-S24C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716636424743

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 11:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 11:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:27:06] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2024-05-25 11:27:06] [INFO ] Transformed 11106 places.
[2024-05-25 11:27:06] [INFO ] Transformed 16561 transitions.
[2024-05-25 11:27:06] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 582 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 11106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 11068 transition count 16561
Discarding 2984 places :
Symmetric choice reduction at 1 with 2984 rule applications. Total rules 3022 place count 8084 transition count 13577
Iterating global reduction 1 with 2984 rules applied. Total rules applied 6006 place count 8084 transition count 13577
Discarding 2735 places :
Symmetric choice reduction at 1 with 2735 rule applications. Total rules 8741 place count 5349 transition count 10842
Iterating global reduction 1 with 2735 rules applied. Total rules applied 11476 place count 5349 transition count 10842
Discarding 533 places :
Symmetric choice reduction at 1 with 533 rule applications. Total rules 12009 place count 4816 transition count 8177
Iterating global reduction 1 with 533 rules applied. Total rules applied 12542 place count 4816 transition count 8177
Applied a total of 12542 rules in 2930 ms. Remains 4816 /11106 variables (removed 6290) and now considering 8177/16561 (removed 8384) transitions.
[2024-05-25 11:27:10] [INFO ] Flow matrix only has 7577 transitions (discarded 600 similar events)
// Phase 1: matrix 7577 rows 4816 cols
[2024-05-25 11:27:10] [INFO ] Computed 937 invariants in 416 ms
[2024-05-25 11:27:14] [INFO ] Implicit Places using invariants in 3872 ms returned []
[2024-05-25 11:27:14] [INFO ] Flow matrix only has 7577 transitions (discarded 600 similar events)
[2024-05-25 11:27:14] [INFO ] Invariant cache hit.
[2024-05-25 11:27:18] [INFO ] Implicit Places using invariants and state equation in 4358 ms returned []
Implicit Place search using SMT with State Equation took 8263 ms to find 0 implicit places.
[2024-05-25 11:27:18] [INFO ] Flow matrix only has 7577 transitions (discarded 600 similar events)
[2024-05-25 11:27:18] [INFO ] Invariant cache hit.
[2024-05-25 11:27:23] [INFO ] Dead Transitions using invariants and state equation in 5095 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4816/11106 places, 8177/16561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16293 ms. Remains : 4816/11106 places, 8177/16561 transitions.
Support contains 62 out of 4816 places after structural reductions.
[2024-05-25 11:27:24] [INFO ] Flatten gal took : 476 ms
[2024-05-25 11:27:24] [INFO ] Flatten gal took : 302 ms
[2024-05-25 11:27:25] [INFO ] Input system was already deterministic with 8177 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-25 11:27:25] [INFO ] Flow matrix only has 7577 transitions (discarded 600 similar events)
[2024-05-25 11:27:25] [INFO ] Invariant cache hit.
[2024-05-25 11:27:28] [INFO ] [Real]Absence check using 47 positive place invariants in 59 ms returned sat
[2024-05-25 11:27:28] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 273 ms returned sat
[2024-05-25 11:27:37] [INFO ] After 7689ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:22
[2024-05-25 11:27:37] [INFO ] State equation strengthened by 2870 read => feed constraints.
[2024-05-25 11:27:38] [INFO ] After 492ms SMT Verify possible using 2870 Read/Feed constraints in real domain returned unsat :1 sat :0 real:23
[2024-05-25 11:27:38] [INFO ] After 12358ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:23
[2024-05-25 11:27:40] [INFO ] [Nat]Absence check using 47 positive place invariants in 64 ms returned sat
[2024-05-25 11:27:40] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 307 ms returned sat
[2024-05-25 11:27:53] [INFO ] After 10558ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2024-05-25 11:28:03] [INFO ] After 10260ms SMT Verify possible using 2870 Read/Feed constraints in natural domain returned unsat :8 sat :15
[2024-05-25 11:28:03] [INFO ] After 10262ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :15
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 11:28:03] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :15
Fused 24 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 28 out of 4816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 255 Pre rules applied. Total rules applied 0 place count 4816 transition count 7922
Deduced a syphon composed of 255 places in 5 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 0 with 510 rules applied. Total rules applied 510 place count 4561 transition count 7922
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 517 place count 4554 transition count 7907
Iterating global reduction 0 with 7 rules applied. Total rules applied 524 place count 4554 transition count 7907
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 524 place count 4554 transition count 7904
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 530 place count 4551 transition count 7904
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 534 place count 4547 transition count 7884
Iterating global reduction 0 with 4 rules applied. Total rules applied 538 place count 4547 transition count 7884
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 592 place count 4520 transition count 7857
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 930 place count 4520 transition count 9635
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 1268 place count 4182 transition count 9635
Partial Free-agglomeration rule applied 121 times.
Drop transitions removed 121 transitions
Iterating global reduction 1 with 121 rules applied. Total rules applied 1389 place count 4182 transition count 9635
Applied a total of 1389 rules in 2922 ms. Remains 4182 /4816 variables (removed 634) and now considering 9635/8177 (removed -1458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2925 ms. Remains : 4182/4816 places, 9635/8177 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-25 11:28:07] [INFO ] Flow matrix only has 8756 transitions (discarded 879 similar events)
// Phase 1: matrix 8756 rows 4182 cols
[2024-05-25 11:28:07] [INFO ] Computed 937 invariants in 234 ms
[2024-05-25 11:28:08] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 11:28:08] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 232 ms returned sat
[2024-05-25 11:28:14] [INFO ] After 4938ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:10
[2024-05-25 11:28:14] [INFO ] State equation strengthened by 4962 read => feed constraints.
[2024-05-25 11:28:16] [INFO ] After 1903ms SMT Verify possible using 4962 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-25 11:28:16] [INFO ] After 9349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-25 11:28:17] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 11:28:18] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 238 ms returned sat
[2024-05-25 11:28:27] [INFO ] After 8690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-25 11:28:41] [INFO ] After 14116ms SMT Verify possible using 4962 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-25 11:28:41] [INFO ] After 14118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 11:28:41] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 86 ms.
Support contains 25 out of 4182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4182/4182 places, 9635/9635 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 4182 transition count 9634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4181 transition count 9634
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 4181 transition count 9633
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4180 transition count 9633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4179 transition count 9632
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4179 transition count 9632
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4179 transition count 9632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 4178 transition count 9631
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 4178 transition count 9631
Applied a total of 10 rules in 1402 ms. Remains 4178 /4182 variables (removed 4) and now considering 9631/9635 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1402 ms. Remains : 4178/4182 places, 9631/9635 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 11:28:44] [INFO ] Flow matrix only has 8752 transitions (discarded 879 similar events)
// Phase 1: matrix 8752 rows 4178 cols
[2024-05-25 11:28:44] [INFO ] Computed 937 invariants in 247 ms
[2024-05-25 11:28:45] [INFO ] [Real]Absence check using 49 positive place invariants in 58 ms returned sat
[2024-05-25 11:28:46] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 237 ms returned sat
[2024-05-25 11:28:50] [INFO ] After 5318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 11:28:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 11:28:51] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 249 ms returned sat
[2024-05-25 11:28:57] [INFO ] After 5962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 11:28:57] [INFO ] State equation strengthened by 4962 read => feed constraints.
[2024-05-25 11:29:15] [INFO ] After 17454ms SMT Verify possible using 4962 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-25 11:29:15] [INFO ] After 17454ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 11:29:15] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 17 out of 4178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4178/4178 places, 9631/9631 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 4178 transition count 9627
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4174 transition count 9627
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 4174 transition count 9624
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 4171 transition count 9624
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 4167 transition count 9620
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 4167 transition count 9620
Applied a total of 22 rules in 1153 ms. Remains 4167 /4178 variables (removed 11) and now considering 9620/9631 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1153 ms. Remains : 4167/4178 places, 9620/9631 transitions.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2192 stabilizing places and 2976 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((!p0 U (!p0&&G((!p1||(!p0&&X((!p0 U (!p2||G(!p0))))))))))))'
Support contains 8 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4800 transition count 8149
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4800 transition count 8149
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 4788 transition count 8113
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 4788 transition count 8113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 4782 transition count 8083
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 4782 transition count 8083
Applied a total of 68 rules in 1231 ms. Remains 4782 /4816 variables (removed 34) and now considering 8083/8177 (removed 94) transitions.
[2024-05-25 11:29:18] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2024-05-25 11:29:18] [INFO ] Computed 937 invariants in 285 ms
[2024-05-25 11:29:23] [INFO ] Implicit Places using invariants in 5089 ms returned []
[2024-05-25 11:29:23] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:29:23] [INFO ] Invariant cache hit.
[2024-05-25 11:29:26] [INFO ] Implicit Places using invariants and state equation in 3329 ms returned []
Implicit Place search using SMT with State Equation took 8428 ms to find 0 implicit places.
[2024-05-25 11:29:26] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:29:26] [INFO ] Invariant cache hit.
[2024-05-25 11:29:31] [INFO ] Dead Transitions using invariants and state equation in 4602 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4782/4816 places, 8083/8177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14262 ms. Remains : 4782/4816 places, 8083/8177 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 576 ms :[true, p0, p0, p0, (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s2494 1) (GEQ s2578 1)), p1:(AND (GEQ s2 1) (GEQ s671 1) (GEQ s2225 1) (GEQ s2226 1)), p2:(AND (GEQ s2274 1) (GEQ s2286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1936 reset in 1107 ms.
Product exploration explored 100000 steps with 1935 reset in 954 ms.
Computed a total of 2158 stabilizing places and 2882 stable transitions
Computed a total of 2158 stabilizing places and 2882 stable transitions
Detected a total of 2158/4782 stabilizing places and 2882/8083 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[true, (AND p0 p1), (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 36 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 36 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 11:29:35] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:29:35] [INFO ] Invariant cache hit.
[2024-05-25 11:29:35] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-25 11:29:36] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 285 ms returned sat
[2024-05-25 11:29:36] [INFO ] After 966ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 11:29:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 65 ms returned sat
[2024-05-25 11:29:37] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 333 ms returned sat
[2024-05-25 11:29:49] [INFO ] After 12025ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 11:29:49] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2024-05-25 11:29:53] [INFO ] After 4437ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 11:30:00] [INFO ] Deduced a trap composed of 951 places in 4665 ms of which 17 ms to minimize.
[2024-05-25 11:30:05] [INFO ] Deduced a trap composed of 851 places in 4708 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: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 11:30:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:30:05] [INFO ] After 29046ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 4782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4782/4782 places, 8083/8083 transitions.
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 266 Pre rules applied. Total rules applied 0 place count 4782 transition count 7817
Deduced a syphon composed of 266 places in 6 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 0 with 532 rules applied. Total rules applied 532 place count 4516 transition count 7817
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 582 place count 4491 transition count 7792
Free-agglomeration rule (complex) applied 286 times.
Iterating global reduction 0 with 286 rules applied. Total rules applied 868 place count 4491 transition count 7506
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 0 with 286 rules applied. Total rules applied 1154 place count 4205 transition count 7506
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 1202 place count 4205 transition count 7506
Applied a total of 1202 rules in 1677 ms. Remains 4205 /4782 variables (removed 577) and now considering 7506/8083 (removed 577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1678 ms. Remains : 4205/4782 places, 7506/8083 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 26474 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26474 steps, saw 12275 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:30:10] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
// Phase 1: matrix 6620 rows 4205 cols
[2024-05-25 11:30:10] [INFO ] Computed 937 invariants in 168 ms
[2024-05-25 11:30:11] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 11:30:11] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 251 ms returned sat
[2024-05-25 11:30:15] [INFO ] After 5506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:30:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 11:30:16] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 251 ms returned sat
[2024-05-25 11:30:24] [INFO ] After 7827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:30:24] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2024-05-25 11:30:29] [INFO ] After 4614ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:30:33] [INFO ] After 8570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2528 ms.
[2024-05-25 11:30:35] [INFO ] After 19931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 4205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4205/4205 places, 7506/7506 transitions.
Applied a total of 0 rules in 346 ms. Remains 4205 /4205 variables (removed 0) and now considering 7506/7506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 4205/4205 places, 7506/7506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4205/4205 places, 7506/7506 transitions.
Applied a total of 0 rules in 331 ms. Remains 4205 /4205 variables (removed 0) and now considering 7506/7506 (removed 0) transitions.
[2024-05-25 11:30:36] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2024-05-25 11:30:36] [INFO ] Invariant cache hit.
[2024-05-25 11:30:40] [INFO ] Implicit Places using invariants in 4437 ms returned []
[2024-05-25 11:30:40] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2024-05-25 11:30:40] [INFO ] Invariant cache hit.
[2024-05-25 11:30:45] [INFO ] Implicit Places using invariants and state equation in 4400 ms returned []
Implicit Place search using SMT with State Equation took 8841 ms to find 0 implicit places.
[2024-05-25 11:30:46] [INFO ] Redundant transitions in 817 ms returned []
[2024-05-25 11:30:46] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2024-05-25 11:30:46] [INFO ] Invariant cache hit.
[2024-05-25 11:30:50] [INFO ] Dead Transitions using invariants and state equation in 4456 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14457 ms. Remains : 4205/4205 places, 7506/7506 transitions.
Graph (trivial) has 2654 edges and 4205 vertex of which 25 / 4205 are part of one of the 1 SCC in 5 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 11924 edges and 4181 vertex of which 4159 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 384 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3598.t3932 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 3774 transition count 5777
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 3532 transition count 5296
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 3291 transition count 4856
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 3051 transition count 4458
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 2851 transition count 4098
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 2653 transition count 3776
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 2491 transition count 3488
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 2331 transition count 3234
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 2203 transition count 3010
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 2077 transition count 2816
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 1979 transition count 2648
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 1883 transition count 2506
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 1811 transition count 2386
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 1741 transition count 2288
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 1691 transition count 2208
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 1643 transition count 2146
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 1611 transition count 2098
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 1581 transition count 2064
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 1563 transition count 2040
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 1547 transition count 2026
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 1539 transition count 2018
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 1532 transition count 2016
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1530 transition count 2016
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6250 place count 1530 transition count 1766
Deduced a syphon composed of 250 places in 1 ms
Ensure Unique test removed 248 places
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 23 with 748 rules applied. Total rules applied 6998 place count 1032 transition count 1766
Discarding 264 places :
Symmetric choice reduction at 23 with 264 rule applications. Total rules 7262 place count 768 transition count 1502
Iterating global reduction 23 with 264 rules applied. Total rules applied 7526 place count 768 transition count 1502
Discarding 46 places :
Symmetric choice reduction at 23 with 46 rule applications. Total rules 7572 place count 722 transition count 1272
Iterating global reduction 23 with 46 rules applied. Total rules applied 7618 place count 722 transition count 1272
Discarding 527 places :
Symmetric choice reduction at 23 with 527 rule applications. Total rules 8145 place count 195 transition count 745
Iterating global reduction 23 with 527 rules applied. Total rules applied 8672 place count 195 transition count 745
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 23 with 527 rules applied. Total rules applied 9199 place count 195 transition count 218
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 24 with 48 rules applied. Total rules applied 9247 place count 171 transition count 194
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 24 with 8 rules applied. Total rules applied 9255 place count 171 transition count 186
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 24 with 8 rules applied. Total rules applied 9263 place count 163 transition count 186
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 9265 place count 163 transition count 186
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 25 with 3 rules applied. Total rules applied 9268 place count 163 transition count 186
Applied a total of 9268 rules in 2845 ms. Remains 163 /4205 variables (removed 4042) and now considering 186/7506 (removed 7320) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 163 cols
[2024-05-25 11:30:53] [INFO ] Computed 40 invariants in 6 ms
[2024-05-25 11:30:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 11:30:53] [INFO ] [Real]Absence check using 3 positive and 37 generalized place invariants in 5 ms returned sat
[2024-05-25 11:30:53] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 11:30:53] [INFO ] After 119ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 11:30:53] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-25 11:30:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 11:30:53] [INFO ] [Nat]Absence check using 3 positive and 37 generalized place invariants in 13 ms returned sat
[2024-05-25 11:30:53] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:30:53] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 11:30:53] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (OR (AND p0 p1) (AND p0 p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1)), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 finished in 97116 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 1 out of 4816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 4816 transition count 8172
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 4811 transition count 8172
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 259 Pre rules applied. Total rules applied 10 place count 4811 transition count 7913
Deduced a syphon composed of 259 places in 5 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 2 with 518 rules applied. Total rules applied 528 place count 4552 transition count 7913
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 540 place count 4540 transition count 7889
Iterating global reduction 2 with 12 rules applied. Total rules applied 552 place count 4540 transition count 7889
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 552 place count 4540 transition count 7884
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 562 place count 4535 transition count 7884
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 570 place count 4527 transition count 7844
Iterating global reduction 2 with 8 rules applied. Total rules applied 578 place count 4527 transition count 7844
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 634 place count 4499 transition count 7816
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 639 place count 4494 transition count 7811
Iterating global reduction 2 with 5 rules applied. Total rules applied 644 place count 4494 transition count 7811
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 644 place count 4494 transition count 7809
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 648 place count 4492 transition count 7809
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 653 place count 4487 transition count 7784
Iterating global reduction 2 with 5 rules applied. Total rules applied 658 place count 4487 transition count 7784
Applied a total of 658 rules in 2337 ms. Remains 4487 /4816 variables (removed 329) and now considering 7784/8177 (removed 393) transitions.
[2024-05-25 11:30:56] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
// Phase 1: matrix 7184 rows 4487 cols
[2024-05-25 11:30:56] [INFO ] Computed 937 invariants in 209 ms
[2024-05-25 11:30:59] [INFO ] Implicit Places using invariants in 3425 ms returned []
[2024-05-25 11:30:59] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:30:59] [INFO ] Invariant cache hit.
[2024-05-25 11:31:04] [INFO ] Implicit Places using invariants and state equation in 4308 ms returned []
Implicit Place search using SMT with State Equation took 7735 ms to find 0 implicit places.
[2024-05-25 11:31:04] [INFO ] Redundant transitions in 814 ms returned []
[2024-05-25 11:31:04] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:04] [INFO ] Invariant cache hit.
[2024-05-25 11:31:09] [INFO ] Dead Transitions using invariants and state equation in 4475 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4487/4816 places, 7784/8177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15372 ms. Remains : 4487/4816 places, 7784/8177 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2702 1)], 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 2705 reset in 1053 ms.
Product exploration explored 100000 steps with 2707 reset in 1114 ms.
Computed a total of 1888 stabilizing places and 2608 stable transitions
Computed a total of 1888 stabilizing places and 2608 stable transitions
Detected a total of 1888/4487 stabilizing places and 2608/7784 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 269 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Finished Best-First random walk after 7063 steps, including 26 resets, run visited all 1 properties in 21 ms. (steps per millisecond=336 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 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)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 4487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4487/4487 places, 7784/7784 transitions.
Applied a total of 0 rules in 473 ms. Remains 4487 /4487 variables (removed 0) and now considering 7784/7784 (removed 0) transitions.
[2024-05-25 11:31:12] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:12] [INFO ] Invariant cache hit.
[2024-05-25 11:31:16] [INFO ] Implicit Places using invariants in 4155 ms returned []
[2024-05-25 11:31:16] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:16] [INFO ] Invariant cache hit.
[2024-05-25 11:31:20] [INFO ] Implicit Places using invariants and state equation in 4113 ms returned []
Implicit Place search using SMT with State Equation took 8270 ms to find 0 implicit places.
[2024-05-25 11:31:21] [INFO ] Redundant transitions in 622 ms returned []
[2024-05-25 11:31:21] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:21] [INFO ] Invariant cache hit.
[2024-05-25 11:31:25] [INFO ] Dead Transitions using invariants and state equation in 4272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13647 ms. Remains : 4487/4487 places, 7784/7784 transitions.
Computed a total of 1888 stabilizing places and 2608 stable transitions
Computed a total of 1888 stabilizing places and 2608 stable transitions
Detected a total of 1888/4487 stabilizing places and 2608/7784 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 43 ms :[(NOT p0)]
Finished random walk after 3096 steps, including 83 resets, run visited all 1 properties in 58 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2706 reset in 1070 ms.
Product exploration explored 100000 steps with 2707 reset in 1091 ms.
Built C files in :
/tmp/ltsmin10463166901602947471
[2024-05-25 11:31:28] [INFO ] Too many transitions (7784) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:31:28] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10463166901602947471
Running compilation step : cd /tmp/ltsmin10463166901602947471;'/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/ltsmin10463166901602947471;'/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/ltsmin10463166901602947471;'/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 4487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4487/4487 places, 7784/7784 transitions.
Applied a total of 0 rules in 434 ms. Remains 4487 /4487 variables (removed 0) and now considering 7784/7784 (removed 0) transitions.
[2024-05-25 11:31:32] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:32] [INFO ] Invariant cache hit.
[2024-05-25 11:31:36] [INFO ] Implicit Places using invariants in 3970 ms returned []
[2024-05-25 11:31:36] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:36] [INFO ] Invariant cache hit.
[2024-05-25 11:31:40] [INFO ] Implicit Places using invariants and state equation in 4097 ms returned []
Implicit Place search using SMT with State Equation took 8074 ms to find 0 implicit places.
[2024-05-25 11:31:40] [INFO ] Redundant transitions in 840 ms returned []
[2024-05-25 11:31:40] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:31:40] [INFO ] Invariant cache hit.
[2024-05-25 11:31:45] [INFO ] Dead Transitions using invariants and state equation in 4365 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13721 ms. Remains : 4487/4487 places, 7784/7784 transitions.
Built C files in :
/tmp/ltsmin16687454561556794301
[2024-05-25 11:31:45] [INFO ] Too many transitions (7784) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:31:45] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16687454561556794301
Running compilation step : cd /tmp/ltsmin16687454561556794301;'/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/ltsmin16687454561556794301;'/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/ltsmin16687454561556794301;'/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 11:31:49] [INFO ] Flatten gal took : 252 ms
[2024-05-25 11:31:49] [INFO ] Flatten gal took : 223 ms
[2024-05-25 11:31:49] [INFO ] Time to serialize gal into /tmp/LTL805772539243791513.gal : 64 ms
[2024-05-25 11:31:49] [INFO ] Time to serialize properties into /tmp/LTL12407059640888027927.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/LTL805772539243791513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8683328352266776675.hoa' '-atoms' '/tmp/LTL12407059640888027927.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/LTL12407059640888027927.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8683328352266776675.hoa
Detected timeout of ITS tools.
[2024-05-25 11:32:04] [INFO ] Flatten gal took : 215 ms
[2024-05-25 11:32:04] [INFO ] Flatten gal took : 217 ms
[2024-05-25 11:32:04] [INFO ] Time to serialize gal into /tmp/LTL9185346598683290266.gal : 39 ms
[2024-05-25 11:32:05] [INFO ] Time to serialize properties into /tmp/LTL2284040856953998072.ltl : 6 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/LTL9185346598683290266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2284040856953998072.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(G("(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Detected timeout of ITS tools.
[2024-05-25 11:32:20] [INFO ] Flatten gal took : 234 ms
[2024-05-25 11:32:20] [INFO ] Applying decomposition
[2024-05-25 11:32:20] [INFO ] Flatten gal took : 197 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/graph14265085275107709733.txt' '-o' '/tmp/graph14265085275107709733.bin' '-w' '/tmp/graph14265085275107709733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14265085275107709733.bin' '-l' '-1' '-v' '-w' '/tmp/graph14265085275107709733.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:32:21] [INFO ] Decomposing Gal with order
[2024-05-25 11:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:32:22] [INFO ] Removed a total of 6423 redundant transitions.
[2024-05-25 11:32:23] [INFO ] Flatten gal took : 1603 ms
[2024-05-25 11:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 5581 labels/synchronizations in 497 ms.
[2024-05-25 11:32:24] [INFO ] Time to serialize gal into /tmp/LTL10688166388099484409.gal : 75 ms
[2024-05-25 11:32:24] [INFO ] Time to serialize properties into /tmp/LTL1592386476105547648.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/LTL10688166388099484409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1592386476105547648.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i20.i0.u365.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(i20.i0.u365.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14176798170514666171
[2024-05-25 11:32:39] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14176798170514666171
Running compilation step : cd /tmp/ltsmin14176798170514666171;'/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/ltsmin14176798170514666171;'/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/ltsmin14176798170514666171;'/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-S24C05-LTLFireability-03 finished in 108581 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(((p0||X(X(F(!p1)))) U (p2&&(p0||X(X(F(!p1))))))))'
Support contains 4 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4800 transition count 8149
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4800 transition count 8149
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 4788 transition count 8105
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 4788 transition count 8105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 4784 transition count 8085
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 4784 transition count 8085
Applied a total of 64 rules in 1391 ms. Remains 4784 /4816 variables (removed 32) and now considering 8085/8177 (removed 92) transitions.
[2024-05-25 11:32:43] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
// Phase 1: matrix 7485 rows 4784 cols
[2024-05-25 11:32:44] [INFO ] Computed 937 invariants in 191 ms
[2024-05-25 11:32:47] [INFO ] Implicit Places using invariants in 3324 ms returned []
[2024-05-25 11:32:47] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:32:47] [INFO ] Invariant cache hit.
[2024-05-25 11:32:50] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned []
Implicit Place search using SMT with State Equation took 6827 ms to find 0 implicit places.
[2024-05-25 11:32:50] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:32:50] [INFO ] Invariant cache hit.
[2024-05-25 11:32:55] [INFO ] Dead Transitions using invariants and state equation in 4390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4784/4816 places, 8085/8177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12609 ms. Remains : 4784/4816 places, 8085/8177 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s2442 1), p0:(GEQ s1350 1), p1:(AND (NOT (AND (GEQ s3346 1) (GEQ s4259 1))) (GEQ s1350 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19944 reset in 2490 ms.
Product exploration explored 100000 steps with 19909 reset in 2520 ms.
Computed a total of 2160 stabilizing places and 2884 stable transitions
Computed a total of 2160 stabilizing places and 2884 stable transitions
Detected a total of 2160/4784 stabilizing places and 2884/8085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:33:00] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:33:00] [INFO ] Invariant cache hit.
[2024-05-25 11:33:01] [INFO ] [Real]Absence check using 47 positive place invariants in 57 ms returned sat
[2024-05-25 11:33:01] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 276 ms returned sat
[2024-05-25 11:33:01] [INFO ] After 985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:33:02] [INFO ] [Nat]Absence check using 47 positive place invariants in 57 ms returned sat
[2024-05-25 11:33:02] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 289 ms returned sat
[2024-05-25 11:33:07] [INFO ] After 4212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:33:07] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2024-05-25 11:33:08] [INFO ] After 1642ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:33:13] [INFO ] Deduced a trap composed of 785 places in 4654 ms of which 5 ms to minimize.
[2024-05-25 11:33:18] [INFO ] Deduced a trap composed of 849 places in 4534 ms of which 5 ms to minimize.
[2024-05-25 11:33:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9992 ms
[2024-05-25 11:33:19] [INFO ] After 12163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 432 ms.
[2024-05-25 11:33:19] [INFO ] After 17815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 4784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4784/4784 places, 8085/8085 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 4784 transition count 8084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4783 transition count 8084
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 266 Pre rules applied. Total rules applied 2 place count 4783 transition count 7818
Deduced a syphon composed of 266 places in 4 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 534 place count 4517 transition count 7818
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 588 place count 4490 transition count 7791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 589 place count 4489 transition count 7790
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 4489 transition count 7790
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 590 place count 4489 transition count 7789
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 592 place count 4488 transition count 7789
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 593 place count 4487 transition count 7784
Iterating global reduction 2 with 1 rules applied. Total rules applied 594 place count 4487 transition count 7784
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 931 place count 4487 transition count 9643
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 1268 place count 4150 transition count 9643
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 1293 place count 4150 transition count 9643
Applied a total of 1293 rules in 2590 ms. Remains 4150 /4784 variables (removed 634) and now considering 9643/8085 (removed -1558) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2591 ms. Remains : 4150/4784 places, 9643/8085 transitions.
Incomplete random walk after 10000 steps, including 320 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24326 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24326 steps, saw 11073 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:33:25] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
// Phase 1: matrix 8757 rows 4150 cols
[2024-05-25 11:33:26] [INFO ] Computed 937 invariants in 226 ms
[2024-05-25 11:33:26] [INFO ] [Real]Absence check using 49 positive place invariants in 49 ms returned sat
[2024-05-25 11:33:26] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 233 ms returned sat
[2024-05-25 11:33:30] [INFO ] After 4707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:33:31] [INFO ] [Nat]Absence check using 49 positive place invariants in 50 ms returned sat
[2024-05-25 11:33:31] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 237 ms returned sat
[2024-05-25 11:33:35] [INFO ] After 3949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:33:35] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:33:37] [INFO ] After 2116ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:33:38] [INFO ] After 2915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 491 ms.
[2024-05-25 11:33:39] [INFO ] After 8267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4150/4150 places, 9643/9643 transitions.
Applied a total of 0 rules in 464 ms. Remains 4150 /4150 variables (removed 0) and now considering 9643/9643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 4150/4150 places, 9643/9643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4150/4150 places, 9643/9643 transitions.
Applied a total of 0 rules in 450 ms. Remains 4150 /4150 variables (removed 0) and now considering 9643/9643 (removed 0) transitions.
[2024-05-25 11:33:39] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:33:39] [INFO ] Invariant cache hit.
[2024-05-25 11:33:44] [INFO ] Implicit Places using invariants in 4559 ms returned []
[2024-05-25 11:33:44] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:33:44] [INFO ] Invariant cache hit.
[2024-05-25 11:33:49] [INFO ] Implicit Places using invariants and state equation in 4603 ms returned []
Implicit Place search using SMT with State Equation took 9163 ms to find 0 implicit places.
[2024-05-25 11:33:50] [INFO ] Redundant transitions in 1285 ms returned []
[2024-05-25 11:33:50] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:33:50] [INFO ] Invariant cache hit.
[2024-05-25 11:33:55] [INFO ] Dead Transitions using invariants and state equation in 5452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16367 ms. Remains : 4150/4150 places, 9643/9643 transitions.
Graph (trivial) has 3277 edges and 4150 vertex of which 25 / 4150 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 28053 edges and 4126 vertex of which 4104 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 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 t3598.t3932 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 3718 transition count 7914
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 3476 transition count 7433
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 3235 transition count 6993
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 2995 transition count 6595
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 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 559 rules applied. Total rules applied 2846 place count 2795 transition count 6236
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3363 place count 2598 transition count 5916
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 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 447 rules applied. Total rules applied 3810 place count 2437 transition count 5630
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 4221 place count 2278 transition count 5378
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4570 place count 2151 transition count 5156
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4887 place count 2026 transition count 4964
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5150 place count 1929 transition count 4798
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5385 place count 1834 transition count 4658
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5574 place count 1763 transition count 4540
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5739 place count 1694 transition count 4444
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 127 rules applied. Total rules applied 5866 place count 1645 transition count 4366
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 5973 place count 1598 transition count 4306
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 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 78 rules applied. Total rules applied 6051 place count 1567 transition count 4259
Ensure Unique test removed 11 places
Reduce places removed 29 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 63 rules applied. Total rules applied 6114 place count 1538 transition count 4225
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 6156 place count 1520 transition count 4201
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 6186 place count 1504 transition count 4187
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 6202 place count 1496 transition count 4179
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 6211 place count 1490 transition count 4176
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 6215 place count 1487 transition count 4175
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6215 place count 1487 transition count 3925
Deduced a syphon composed of 250 places in 1 ms
Ensure Unique test removed 249 places
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 23 with 749 rules applied. Total rules applied 6964 place count 988 transition count 3925
Discarding 263 places :
Symmetric choice reduction at 23 with 263 rule applications. Total rules 7227 place count 725 transition count 3662
Iterating global reduction 23 with 263 rules applied. Total rules applied 7490 place count 725 transition count 3662
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7490 place count 725 transition count 3661
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7492 place count 724 transition count 3661
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8031 place count 185 transition count 966
Iterating global reduction 23 with 539 rules applied. Total rules applied 8570 place count 185 transition count 966
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9109 place count 185 transition count 427
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 24 with 69 rules applied. Total rules applied 9178 place count 150 transition count 393
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 24 with 9 rules applied. Total rules applied 9187 place count 150 transition count 384
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 9188 place count 150 transition count 383
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 25 with 11 rules applied. Total rules applied 9199 place count 150 transition count 372
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9210 place count 139 transition count 372
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 9232 place count 117 transition count 262
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 9264 place count 107 transition count 262
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 9286 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 9296 place count 97 transition count 190
Iterating global reduction 27 with 10 rules applied. Total rules applied 9306 place count 97 transition count 190
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 9316 place count 87 transition count 180
Iterating global reduction 27 with 10 rules applied. Total rules applied 9326 place count 87 transition count 180
Applied a total of 9326 rules in 5075 ms. Remains 87 /4150 variables (removed 4063) and now considering 180/9643 (removed 9463) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 87 cols
[2024-05-25 11:34:00] [INFO ] Computed 29 invariants in 3 ms
[2024-05-25 11:34:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 11:34:01] [INFO ] [Real]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 11:34:01] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 11:34:01] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:34:01] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:34:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 11:34:01] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 11:34:01] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:34:01] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-25 11:34:01] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
[2024-05-25 11:34:01] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
// Phase 1: matrix 7485 rows 4784 cols
[2024-05-25 11:34:02] [INFO ] Computed 937 invariants in 228 ms
Could not prove EG (NOT p2)
Support contains 4 out of 4784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4784/4784 places, 8085/8085 transitions.
Applied a total of 0 rules in 634 ms. Remains 4784 /4784 variables (removed 0) and now considering 8085/8085 (removed 0) transitions.
[2024-05-25 11:34:17] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:34:17] [INFO ] Invariant cache hit.
[2024-05-25 11:34:20] [INFO ] Implicit Places using invariants in 3113 ms returned []
[2024-05-25 11:34:20] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:34:20] [INFO ] Invariant cache hit.
[2024-05-25 11:34:24] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 6484 ms to find 0 implicit places.
[2024-05-25 11:34:24] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:34:24] [INFO ] Invariant cache hit.
[2024-05-25 11:34:28] [INFO ] Dead Transitions using invariants and state equation in 4478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11596 ms. Remains : 4784/4784 places, 8085/8085 transitions.
Computed a total of 2160 stabilizing places and 2884 stable transitions
Computed a total of 2160 stabilizing places and 2884 stable transitions
Detected a total of 2160/4784 stabilizing places and 2884/8085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Incomplete random walk after 10000 steps, including 194 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:34:29] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:34:29] [INFO ] Invariant cache hit.
[2024-05-25 11:34:29] [INFO ] [Real]Absence check using 47 positive place invariants in 58 ms returned sat
[2024-05-25 11:34:30] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 277 ms returned sat
[2024-05-25 11:34:30] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:34:30] [INFO ] [Nat]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 11:34:31] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 280 ms returned sat
[2024-05-25 11:34:35] [INFO ] After 4310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:34:35] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2024-05-25 11:34:37] [INFO ] After 1637ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:34:42] [INFO ] Deduced a trap composed of 785 places in 4537 ms of which 5 ms to minimize.
[2024-05-25 11:34:46] [INFO ] Deduced a trap composed of 849 places in 4616 ms of which 5 ms to minimize.
[2024-05-25 11:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9947 ms
[2024-05-25 11:34:47] [INFO ] After 12121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 436 ms.
[2024-05-25 11:34:48] [INFO ] After 17869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 4784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4784/4784 places, 8085/8085 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 4784 transition count 8084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4783 transition count 8084
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 266 Pre rules applied. Total rules applied 2 place count 4783 transition count 7818
Deduced a syphon composed of 266 places in 4 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 534 place count 4517 transition count 7818
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 588 place count 4490 transition count 7791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 589 place count 4489 transition count 7790
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 4489 transition count 7790
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 590 place count 4489 transition count 7789
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 592 place count 4488 transition count 7789
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 593 place count 4487 transition count 7784
Iterating global reduction 2 with 1 rules applied. Total rules applied 594 place count 4487 transition count 7784
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 931 place count 4487 transition count 9643
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 1268 place count 4150 transition count 9643
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 1293 place count 4150 transition count 9643
Applied a total of 1293 rules in 2861 ms. Remains 4150 /4784 variables (removed 634) and now considering 9643/8085 (removed -1558) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2861 ms. Remains : 4150/4784 places, 9643/8085 transitions.
Incomplete random walk after 10000 steps, including 320 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24896 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24896 steps, saw 11325 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:34:54] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
// Phase 1: matrix 8757 rows 4150 cols
[2024-05-25 11:34:54] [INFO ] Computed 937 invariants in 225 ms
[2024-05-25 11:34:55] [INFO ] [Real]Absence check using 49 positive place invariants in 48 ms returned sat
[2024-05-25 11:34:55] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 236 ms returned sat
[2024-05-25 11:34:59] [INFO ] After 4805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:35:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 47 ms returned sat
[2024-05-25 11:35:00] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 232 ms returned sat
[2024-05-25 11:35:04] [INFO ] After 3847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:35:04] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:35:06] [INFO ] After 2180ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:35:07] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 587 ms.
[2024-05-25 11:35:07] [INFO ] After 8360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 4150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4150/4150 places, 9643/9643 transitions.
Applied a total of 0 rules in 484 ms. Remains 4150 /4150 variables (removed 0) and now considering 9643/9643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 4150/4150 places, 9643/9643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4150/4150 places, 9643/9643 transitions.
Applied a total of 0 rules in 482 ms. Remains 4150 /4150 variables (removed 0) and now considering 9643/9643 (removed 0) transitions.
[2024-05-25 11:35:08] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:35:08] [INFO ] Invariant cache hit.
[2024-05-25 11:35:13] [INFO ] Implicit Places using invariants in 4716 ms returned []
[2024-05-25 11:35:13] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:35:13] [INFO ] Invariant cache hit.
[2024-05-25 11:35:18] [INFO ] Implicit Places using invariants and state equation in 4634 ms returned []
Implicit Place search using SMT with State Equation took 9352 ms to find 0 implicit places.
[2024-05-25 11:35:19] [INFO ] Redundant transitions in 1289 ms returned []
[2024-05-25 11:35:19] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
[2024-05-25 11:35:19] [INFO ] Invariant cache hit.
[2024-05-25 11:35:24] [INFO ] Dead Transitions using invariants and state equation in 5333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16473 ms. Remains : 4150/4150 places, 9643/9643 transitions.
Graph (trivial) has 3277 edges and 4150 vertex of which 25 / 4150 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 28053 edges and 4126 vertex of which 4104 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 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 t3598.t3932 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 3718 transition count 7914
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 3476 transition count 7433
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 3235 transition count 6993
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 2995 transition count 6595
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 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 559 rules applied. Total rules applied 2846 place count 2795 transition count 6236
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3363 place count 2598 transition count 5916
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 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 447 rules applied. Total rules applied 3810 place count 2437 transition count 5630
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 4221 place count 2278 transition count 5378
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4570 place count 2151 transition count 5156
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4887 place count 2026 transition count 4964
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5150 place count 1929 transition count 4798
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5385 place count 1834 transition count 4658
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5574 place count 1763 transition count 4540
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5739 place count 1694 transition count 4444
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 127 rules applied. Total rules applied 5866 place count 1645 transition count 4366
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 5973 place count 1598 transition count 4306
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 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 78 rules applied. Total rules applied 6051 place count 1567 transition count 4259
Ensure Unique test removed 11 places
Reduce places removed 29 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 63 rules applied. Total rules applied 6114 place count 1538 transition count 4225
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 6156 place count 1520 transition count 4201
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 6186 place count 1504 transition count 4187
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 6202 place count 1496 transition count 4179
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 6211 place count 1490 transition count 4176
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 6215 place count 1487 transition count 4175
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6215 place count 1487 transition count 3925
Deduced a syphon composed of 250 places in 1 ms
Ensure Unique test removed 249 places
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 23 with 749 rules applied. Total rules applied 6964 place count 988 transition count 3925
Discarding 263 places :
Symmetric choice reduction at 23 with 263 rule applications. Total rules 7227 place count 725 transition count 3662
Iterating global reduction 23 with 263 rules applied. Total rules applied 7490 place count 725 transition count 3662
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7490 place count 725 transition count 3661
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7492 place count 724 transition count 3661
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8031 place count 185 transition count 966
Iterating global reduction 23 with 539 rules applied. Total rules applied 8570 place count 185 transition count 966
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9109 place count 185 transition count 427
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 24 with 69 rules applied. Total rules applied 9178 place count 150 transition count 393
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 24 with 9 rules applied. Total rules applied 9187 place count 150 transition count 384
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 9188 place count 150 transition count 383
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 25 with 11 rules applied. Total rules applied 9199 place count 150 transition count 372
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9210 place count 139 transition count 372
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 9232 place count 117 transition count 262
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 9264 place count 107 transition count 262
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 9286 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 9296 place count 97 transition count 190
Iterating global reduction 27 with 10 rules applied. Total rules applied 9306 place count 97 transition count 190
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 9316 place count 87 transition count 180
Iterating global reduction 27 with 10 rules applied. Total rules applied 9326 place count 87 transition count 180
Applied a total of 9326 rules in 5073 ms. Remains 87 /4150 variables (removed 4063) and now considering 180/9643 (removed 9463) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 87 cols
[2024-05-25 11:35:29] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 11:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 11:35:30] [INFO ] [Real]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 11:35:30] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 11:35:30] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:35:30] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:35:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 11:35:30] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 11:35:30] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:35:30] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 11:35:30] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
[2024-05-25 11:35:30] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
// Phase 1: matrix 7485 rows 4784 cols
[2024-05-25 11:35:30] [INFO ] Computed 937 invariants in 182 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Product exploration explored 100000 steps with 20022 reset in 2544 ms.
Product exploration explored 100000 steps with 20067 reset in 2530 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Support contains 4 out of 4784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4784/4784 places, 8085/8085 transitions.
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 258 Pre rules applied. Total rules applied 0 place count 4784 transition count 8087
Deduced a syphon composed of 258 places in 5 ms
Iterating global reduction 0 with 258 rules applied. Total rules applied 258 place count 4784 transition count 8087
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 285 places in 5 ms
Iterating global reduction 0 with 27 rules applied. Total rules applied 285 place count 4784 transition count 8087
Deduced a syphon composed of 285 places in 4 ms
Applied a total of 285 rules in 1927 ms. Remains 4784 /4784 variables (removed 0) and now considering 8087/8085 (removed -2) transitions.
[2024-05-25 11:35:54] [INFO ] Redundant transitions in 921 ms returned []
[2024-05-25 11:35:54] [INFO ] Flow matrix only has 7487 transitions (discarded 600 similar events)
// Phase 1: matrix 7487 rows 4784 cols
[2024-05-25 11:35:54] [INFO ] Computed 937 invariants in 206 ms
[2024-05-25 11:35:59] [INFO ] Dead Transitions using invariants and state equation in 5290 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4784/4784 places, 8087/8085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8147 ms. Remains : 4784/4784 places, 8087/8085 transitions.
Built C files in :
/tmp/ltsmin5305287801968209617
[2024-05-25 11:35:59] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5305287801968209617
Running compilation step : cd /tmp/ltsmin5305287801968209617;'/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/ltsmin5305287801968209617;'/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/ltsmin5305287801968209617;'/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 4784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4784/4784 places, 8085/8085 transitions.
Applied a total of 0 rules in 387 ms. Remains 4784 /4784 variables (removed 0) and now considering 8085/8085 (removed 0) transitions.
[2024-05-25 11:36:03] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
// Phase 1: matrix 7485 rows 4784 cols
[2024-05-25 11:36:03] [INFO ] Computed 937 invariants in 181 ms
[2024-05-25 11:36:06] [INFO ] Implicit Places using invariants in 3659 ms returned []
[2024-05-25 11:36:06] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:36:06] [INFO ] Invariant cache hit.
[2024-05-25 11:36:10] [INFO ] Implicit Places using invariants and state equation in 3456 ms returned []
Implicit Place search using SMT with State Equation took 7122 ms to find 0 implicit places.
[2024-05-25 11:36:10] [INFO ] Flow matrix only has 7485 transitions (discarded 600 similar events)
[2024-05-25 11:36:10] [INFO ] Invariant cache hit.
[2024-05-25 11:36:14] [INFO ] Dead Transitions using invariants and state equation in 4339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11853 ms. Remains : 4784/4784 places, 8085/8085 transitions.
Built C files in :
/tmp/ltsmin11930017104210183040
[2024-05-25 11:36:14] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11930017104210183040
Running compilation step : cd /tmp/ltsmin11930017104210183040;'/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/ltsmin11930017104210183040;'/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/ltsmin11930017104210183040;'/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 11:36:18] [INFO ] Flatten gal took : 212 ms
[2024-05-25 11:36:18] [INFO ] Flatten gal took : 218 ms
[2024-05-25 11:36:18] [INFO ] Time to serialize gal into /tmp/LTL12242087916980893249.gal : 47 ms
[2024-05-25 11:36:18] [INFO ] Time to serialize properties into /tmp/LTL1490217739171352823.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/LTL12242087916980893249.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12080345824304760289.hoa' '-atoms' '/tmp/LTL1490217739171352823.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/LTL1490217739171352823.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12080345824304760289.hoa
Detected timeout of ITS tools.
[2024-05-25 11:36:33] [INFO ] Flatten gal took : 241 ms
[2024-05-25 11:36:33] [INFO ] Flatten gal took : 234 ms
[2024-05-25 11:36:34] [INFO ] Time to serialize gal into /tmp/LTL9382244240079505465.gal : 49 ms
[2024-05-25 11:36:34] [INFO ] Time to serialize properties into /tmp/LTL7397210785224118000.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/LTL9382244240079505465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7397210785224118000.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 : !((X((("(Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)")||(X(X(F(!("((!((Node21NotifyThatHeIsActive>=1)&&(Node24ThinksNode21ShouldBeNodeM...496
Formula 0 simplified : X(!"(Node14HasTheLeafSetOfRx2ToReplaceNode13>=1)" W (!"(Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)" & XXG"((!((Node21NotifyThatHeIsA...272
Detected timeout of ITS tools.
[2024-05-25 11:36:49] [INFO ] Flatten gal took : 208 ms
[2024-05-25 11:36:49] [INFO ] Applying decomposition
[2024-05-25 11:36:49] [INFO ] Flatten gal took : 217 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/graph14470394809435088535.txt' '-o' '/tmp/graph14470394809435088535.bin' '-w' '/tmp/graph14470394809435088535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14470394809435088535.bin' '-l' '-1' '-v' '-w' '/tmp/graph14470394809435088535.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:36:50] [INFO ] Decomposing Gal with order
[2024-05-25 11:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:36:51] [INFO ] Removed a total of 6042 redundant transitions.
[2024-05-25 11:36:51] [INFO ] Flatten gal took : 746 ms
[2024-05-25 11:36:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3400 labels/synchronizations in 307 ms.
[2024-05-25 11:36:52] [INFO ] Time to serialize gal into /tmp/LTL2641758553741061270.gal : 53 ms
[2024-05-25 11:36:52] [INFO ] Time to serialize properties into /tmp/LTL3230984587895798491.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/LTL2641758553741061270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3230984587895798491.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...254
Read 1 LTL properties
Checking formula 0 : !((X((("(i8.u614.Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)")||(X(X(F(!("((!((i22.u368.Node21NotifyThatHeIsActive>=1)&&(i22.u460.Node2...572
Formula 0 simplified : X(!"(i7.u266.Node14HasTheLeafSetOfRx2ToReplaceNode13>=1)" W (!"(i8.u614.Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)" & XXG"((!((i22.u...314
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11342652704686249152
[2024-05-25 11:37:07] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11342652704686249152
Running compilation step : cd /tmp/ltsmin11342652704686249152;'/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/ltsmin11342652704686249152;'/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/ltsmin11342652704686249152;'/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-S24C05-LTLFireability-06 finished in 267954 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(F(((p1||X(G(p1)))&&p0))))))'
Support contains 4 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4800 transition count 8149
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4800 transition count 8149
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 4788 transition count 8113
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 4788 transition count 8113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 4782 transition count 8083
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 4782 transition count 8083
Applied a total of 68 rules in 1679 ms. Remains 4782 /4816 variables (removed 34) and now considering 8083/8177 (removed 94) transitions.
[2024-05-25 11:37:12] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2024-05-25 11:37:12] [INFO ] Computed 937 invariants in 182 ms
[2024-05-25 11:37:15] [INFO ] Implicit Places using invariants in 3652 ms returned []
[2024-05-25 11:37:15] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:37:15] [INFO ] Invariant cache hit.
[2024-05-25 11:37:20] [INFO ] Implicit Places using invariants and state equation in 4753 ms returned []
Implicit Place search using SMT with State Equation took 8407 ms to find 0 implicit places.
[2024-05-25 11:37:20] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:37:20] [INFO ] Invariant cache hit.
[2024-05-25 11:37:25] [INFO ] Dead Transitions using invariants and state equation in 4791 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4782/4816 places, 8083/8177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14878 ms. Remains : 4782/4816 places, 8083/8177 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s2771 1) (GEQ s2812 1)), p1:(AND (GEQ s647 1) (GEQ s663 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 finished in 15131 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||G(p1))))'
Support contains 6 out of 4816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4816/4816 places, 8177/8177 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 0 with 6 rules applied. Total rules applied 6 place count 4816 transition count 8171
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 4810 transition count 8171
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 12 place count 4810 transition count 7913
Deduced a syphon composed of 258 places in 5 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 528 place count 4552 transition count 7913
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 539 place count 4541 transition count 7890
Iterating global reduction 2 with 11 rules applied. Total rules applied 550 place count 4541 transition count 7890
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 550 place count 4541 transition count 7886
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 558 place count 4537 transition count 7886
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 565 place count 4530 transition count 7851
Iterating global reduction 2 with 7 rules applied. Total rules applied 572 place count 4530 transition count 7851
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 626 place count 4503 transition count 7824
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 632 place count 4497 transition count 7818
Iterating global reduction 2 with 6 rules applied. Total rules applied 638 place count 4497 transition count 7818
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 638 place count 4497 transition count 7815
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 644 place count 4494 transition count 7815
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 650 place count 4488 transition count 7785
Iterating global reduction 2 with 6 rules applied. Total rules applied 656 place count 4488 transition count 7785
Applied a total of 656 rules in 2976 ms. Remains 4488 /4816 variables (removed 328) and now considering 7785/8177 (removed 392) transitions.
[2024-05-25 11:37:28] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
// Phase 1: matrix 7185 rows 4488 cols
[2024-05-25 11:37:28] [INFO ] Computed 937 invariants in 212 ms
[2024-05-25 11:37:33] [INFO ] Implicit Places using invariants in 4845 ms returned []
[2024-05-25 11:37:33] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
[2024-05-25 11:37:33] [INFO ] Invariant cache hit.
[2024-05-25 11:37:36] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 8214 ms to find 0 implicit places.
[2024-05-25 11:37:37] [INFO ] Redundant transitions in 834 ms returned []
[2024-05-25 11:37:37] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
[2024-05-25 11:37:37] [INFO ] Invariant cache hit.
[2024-05-25 11:37:41] [INFO ] Dead Transitions using invariants and state equation in 4331 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4488/4816 places, 7785/8177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16377 ms. Remains : 4488/4816 places, 7785/8177 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s1540 1) (LT s1601 1)) (OR (LT s2752 1) (LT s3322 1)) (GEQ s3105 1) (GEQ s3857 1)), p0:(AND (GEQ s2752 1) (GEQ s3322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 finished in 16480 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||F(p1)) U (G(!p2)||(!p2&&F(!p3)))))))'
Support contains 8 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4801 transition count 8154
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4801 transition count 8154
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 4789 transition count 8118
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 4789 transition count 8118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 4783 transition count 8088
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 4783 transition count 8088
Applied a total of 66 rules in 1721 ms. Remains 4783 /4816 variables (removed 33) and now considering 8088/8177 (removed 89) transitions.
[2024-05-25 11:37:43] [INFO ] Flow matrix only has 7488 transitions (discarded 600 similar events)
// Phase 1: matrix 7488 rows 4783 cols
[2024-05-25 11:37:44] [INFO ] Computed 937 invariants in 184 ms
[2024-05-25 11:37:47] [INFO ] Implicit Places using invariants in 3739 ms returned []
[2024-05-25 11:37:47] [INFO ] Flow matrix only has 7488 transitions (discarded 600 similar events)
[2024-05-25 11:37:47] [INFO ] Invariant cache hit.
[2024-05-25 11:37:51] [INFO ] Implicit Places using invariants and state equation in 3745 ms returned [686]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4782/4816 places, 8088/8177 transitions.
Applied a total of 0 rules in 395 ms. Remains 4782 /4782 variables (removed 0) and now considering 8088/8088 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9611 ms. Remains : 4782/4816 places, 8088/8177 transitions.
Stuttering acceptance computed with spot in 295 ms :[p2, p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND p2 p3), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s120 1) (GEQ s2391 1)), p0:(AND (GEQ s3002 1) (GEQ s3134 1)), p1:(AND (GEQ s499 1) (GEQ s4582 1)), p3:(AND (GEQ s2078 1) (GEQ s2119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1936 reset in 1112 ms.
Product exploration explored 100000 steps with 1935 reset in 1169 ms.
Computed a total of 2158 stabilizing places and 2887 stable transitions
Computed a total of 2158 stabilizing places and 2887 stable transitions
Detected a total of 2158/4782 stabilizing places and 2887/8088 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 384 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 11:37:56] [INFO ] Flow matrix only has 7488 transitions (discarded 600 similar events)
// Phase 1: matrix 7488 rows 4782 cols
[2024-05-25 11:37:56] [INFO ] Computed 936 invariants in 172 ms
[2024-05-25 11:37:57] [INFO ] [Real]Absence check using 47 positive place invariants in 38 ms returned sat
[2024-05-25 11:37:57] [INFO ] [Real]Absence check using 47 positive and 889 generalized place invariants in 304 ms returned sat
[2024-05-25 11:38:02] [INFO ] After 5953ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2024-05-25 11:38:03] [INFO ] [Nat]Absence check using 47 positive place invariants in 36 ms returned sat
[2024-05-25 11:38:03] [INFO ] [Nat]Absence check using 47 positive and 889 generalized place invariants in 302 ms returned sat
[2024-05-25 11:38:09] [INFO ] After 5649ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2024-05-25 11:38:09] [INFO ] State equation strengthened by 2814 read => feed constraints.
[2024-05-25 11:38:13] [INFO ] After 4415ms SMT Verify possible using 2814 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2024-05-25 11:38:18] [INFO ] Deduced a trap composed of 793 places in 4510 ms of which 6 ms to minimize.
[2024-05-25 11:38:23] [INFO ] Deduced a trap composed of 352 places in 4711 ms of which 7 ms to minimize.
[2024-05-25 11:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9952 ms
[2024-05-25 11:38:29] [INFO ] Deduced a trap composed of 955 places in 4591 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: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 11:38:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:38:29] [INFO ] After 27387ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:6
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 4782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4782/4782 places, 8088/8088 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 4782 transition count 8087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4781 transition count 8087
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 2 place count 4781 transition count 7822
Deduced a syphon composed of 265 places in 6 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 532 place count 4516 transition count 7822
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 582 place count 4491 transition count 7797
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 919 place count 4491 transition count 9648
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 1256 place count 4154 transition count 9648
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 1304 place count 4154 transition count 9648
Applied a total of 1304 rules in 2381 ms. Remains 4154 /4782 variables (removed 628) and now considering 9648/8088 (removed -1560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2381 ms. Remains : 4154/4782 places, 9648/8088 transitions.
Incomplete random walk after 10000 steps, including 320 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 23902 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 23902 steps, saw 10893 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :4
Running SMT prover for 2 properties.
[2024-05-25 11:38:35] [INFO ] Flow matrix only has 8763 transitions (discarded 885 similar events)
// Phase 1: matrix 8763 rows 4154 cols
[2024-05-25 11:38:36] [INFO ] Computed 936 invariants in 228 ms
[2024-05-25 11:38:36] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 11:38:36] [INFO ] [Real]Absence check using 49 positive and 887 generalized place invariants in 223 ms returned sat
[2024-05-25 11:38:41] [INFO ] After 5480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:38:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 11:38:42] [INFO ] [Nat]Absence check using 49 positive and 887 generalized place invariants in 225 ms returned sat
[2024-05-25 11:38:47] [INFO ] After 4594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:38:47] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:38:50] [INFO ] After 3030ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:38:55] [INFO ] Deduced a trap composed of 388 places in 4318 ms of which 5 ms to minimize.
[2024-05-25 11:39:00] [INFO ] Deduced a trap composed of 382 places in 4296 ms of which 4 ms to minimize.
[2024-05-25 11:39:05] [INFO ] Deduced a trap composed of 228 places in 4467 ms of which 4 ms to minimize.
[2024-05-25 11:39:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14603 ms
[2024-05-25 11:39:06] [INFO ] After 19103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
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.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:695)
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 11:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:39:06] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4154/4154 places, 9648/9648 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4154 transition count 9647
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4153 transition count 9647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4152 transition count 9646
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4152 transition count 9646
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4152 transition count 9645
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4151 transition count 9645
Applied a total of 6 rules in 838 ms. Remains 4151 /4154 variables (removed 3) and now considering 9645/9648 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 4151/4154 places, 9645/9648 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24654 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24654 steps, saw 11224 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:39:10] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
// Phase 1: matrix 8760 rows 4151 cols
[2024-05-25 11:39:11] [INFO ] Computed 936 invariants in 244 ms
[2024-05-25 11:39:11] [INFO ] [Real]Absence check using 49 positive place invariants in 56 ms returned sat
[2024-05-25 11:39:11] [INFO ] [Real]Absence check using 49 positive and 887 generalized place invariants in 235 ms returned sat
[2024-05-25 11:39:15] [INFO ] After 4707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:39:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 54 ms returned sat
[2024-05-25 11:39:16] [INFO ] [Nat]Absence check using 49 positive and 887 generalized place invariants in 236 ms returned sat
[2024-05-25 11:39:21] [INFO ] After 4706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:39:21] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:39:23] [INFO ] After 2169ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:39:29] [INFO ] Deduced a trap composed of 386 places in 4237 ms of which 4 ms to minimize.
[2024-05-25 11:39:36] [INFO ] Deduced a trap composed of 393 places in 4040 ms of which 4 ms to minimize.
[2024-05-25 11:39:41] [INFO ] Deduced a trap composed of 302 places in 4229 ms of which 6 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 11:39:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:39:41] [INFO ] After 25216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4151/4151 places, 9645/9645 transitions.
Applied a total of 0 rules in 547 ms. Remains 4151 /4151 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 4151/4151 places, 9645/9645 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4151/4151 places, 9645/9645 transitions.
Applied a total of 0 rules in 531 ms. Remains 4151 /4151 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
[2024-05-25 11:39:42] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:39:42] [INFO ] Invariant cache hit.
[2024-05-25 11:39:46] [INFO ] Implicit Places using invariants in 4595 ms returned []
[2024-05-25 11:39:46] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:39:46] [INFO ] Invariant cache hit.
[2024-05-25 11:39:51] [INFO ] Implicit Places using invariants and state equation in 4659 ms returned []
Implicit Place search using SMT with State Equation took 9261 ms to find 0 implicit places.
[2024-05-25 11:39:52] [INFO ] Redundant transitions in 1274 ms returned []
[2024-05-25 11:39:52] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:39:52] [INFO ] Invariant cache hit.
[2024-05-25 11:39:58] [INFO ] Dead Transitions using invariants and state equation in 5314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16394 ms. Remains : 4151/4151 places, 9645/9645 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) p2 p3))), (G (NOT (AND (NOT p0) (NOT p1) p2 p3))), (G (NOT (AND p2 p3)))]
False Knowledge obtained : [(F (AND (NOT p2) p3)), (F p1), (F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 18 factoid took 847 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 197 ms :[p2, (NOT p1), p2]
Support contains 6 out of 4782 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 : 4782/4782 places, 8088/8088 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 4782 transition count 8087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4781 transition count 8087
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 2 place count 4781 transition count 7822
Deduced a syphon composed of 265 places in 5 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 532 place count 4516 transition count 7822
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 582 place count 4491 transition count 7797
Applied a total of 582 rules in 1118 ms. Remains 4491 /4782 variables (removed 291) and now considering 7797/8088 (removed 291) transitions.
[2024-05-25 11:40:00] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
// Phase 1: matrix 7197 rows 4491 cols
[2024-05-25 11:40:00] [INFO ] Computed 936 invariants in 190 ms
[2024-05-25 11:40:04] [INFO ] Implicit Places using invariants in 3763 ms returned []
[2024-05-25 11:40:04] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:40:04] [INFO ] Invariant cache hit.
[2024-05-25 11:40:07] [INFO ] Implicit Places using invariants and state equation in 3555 ms returned []
Implicit Place search using SMT with State Equation took 7319 ms to find 0 implicit places.
[2024-05-25 11:40:08] [INFO ] Redundant transitions in 798 ms returned []
[2024-05-25 11:40:08] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:40:08] [INFO ] Invariant cache hit.
[2024-05-25 11:40:12] [INFO ] Dead Transitions using invariants and state equation in 4425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4491/4782 places, 7797/8088 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13673 ms. Remains : 4491/4782 places, 7797/8088 transitions.
Computed a total of 1892 stabilizing places and 2621 stable transitions
Computed a total of 1892 stabilizing places and 2621 stable transitions
Detected a total of 1892/4491 stabilizing places and 2621/7797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 24873 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24873 steps, saw 11541 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:40:16] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:40:16] [INFO ] Invariant cache hit.
[2024-05-25 11:40:17] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 11:40:17] [INFO ] [Real]Absence check using 49 positive and 887 generalized place invariants in 267 ms returned sat
[2024-05-25 11:40:21] [INFO ] After 4673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:40:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 11:40:22] [INFO ] [Nat]Absence check using 49 positive and 887 generalized place invariants in 262 ms returned sat
[2024-05-25 11:40:27] [INFO ] After 4682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:40:27] [INFO ] State equation strengthened by 2814 read => feed constraints.
[2024-05-25 11:40:29] [INFO ] After 2387ms SMT Verify possible using 2814 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:40:34] [INFO ] Deduced a trap composed of 553 places in 4171 ms of which 5 ms to minimize.
[2024-05-25 11:40:38] [INFO ] Deduced a trap composed of 231 places in 4209 ms of which 5 ms to minimize.
[2024-05-25 11:40:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9121 ms
[2024-05-25 11:40:44] [INFO ] Deduced a trap composed of 586 places in 4281 ms of which 5 ms to minimize.
[2024-05-25 11:40:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4767 ms
[2024-05-25 11:40:44] [INFO ] After 17539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1540 ms.
[2024-05-25 11:40:46] [INFO ] After 24904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4491/4491 places, 7797/7797 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4491 transition count 7796
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4490 transition count 7796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4489 transition count 7795
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4489 transition count 7795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4489 transition count 7794
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4488 transition count 7794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4487 transition count 7789
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4487 transition count 7789
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 344 place count 4487 transition count 9645
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 680 place count 4151 transition count 9645
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 704 place count 4151 transition count 9645
Applied a total of 704 rules in 2635 ms. Remains 4151 /4491 variables (removed 340) and now considering 9645/7797 (removed -1848) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2636 ms. Remains : 4151/4491 places, 9645/7797 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 23149 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23149 steps, saw 10552 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:40:52] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
// Phase 1: matrix 8760 rows 4151 cols
[2024-05-25 11:40:52] [INFO ] Computed 936 invariants in 249 ms
[2024-05-25 11:40:53] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 11:40:53] [INFO ] [Real]Absence check using 49 positive and 887 generalized place invariants in 256 ms returned sat
[2024-05-25 11:40:59] [INFO ] After 6228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:40:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 11:40:59] [INFO ] [Nat]Absence check using 49 positive and 887 generalized place invariants in 260 ms returned sat
[2024-05-25 11:41:05] [INFO ] After 5466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:41:05] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:41:14] [INFO ] After 8772ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:41:19] [INFO ] Deduced a trap composed of 386 places in 4471 ms of which 4 ms to minimize.
[2024-05-25 11:41:24] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9036 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: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 11:41:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:41:24] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 4151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4151/4151 places, 9645/9645 transitions.
Applied a total of 0 rules in 566 ms. Remains 4151 /4151 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 4151/4151 places, 9645/9645 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4151/4151 places, 9645/9645 transitions.
Applied a total of 0 rules in 558 ms. Remains 4151 /4151 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
[2024-05-25 11:41:25] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:41:25] [INFO ] Invariant cache hit.
[2024-05-25 11:41:29] [INFO ] Implicit Places using invariants in 4647 ms returned []
[2024-05-25 11:41:29] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:41:29] [INFO ] Invariant cache hit.
[2024-05-25 11:41:34] [INFO ] Implicit Places using invariants and state equation in 4828 ms returned []
Implicit Place search using SMT with State Equation took 9478 ms to find 0 implicit places.
[2024-05-25 11:41:35] [INFO ] Redundant transitions in 947 ms returned []
[2024-05-25 11:41:35] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:41:35] [INFO ] Invariant cache hit.
[2024-05-25 11:41:41] [INFO ] Dead Transitions using invariants and state equation in 5387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16379 ms. Remains : 4151/4151 places, 9645/9645 transitions.
Graph (trivial) has 3278 edges and 4151 vertex of which 25 / 4151 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 27999 edges and 4127 vertex of which 4106 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 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 t3598.t3932 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 3720 transition count 7917
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 3478 transition count 7436
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 3237 transition count 6996
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 2997 transition count 6598
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 2797 transition count 6238
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 2599 transition count 5916
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 2437 transition count 5628
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 2277 transition count 5374
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 2149 transition count 5150
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 2023 transition count 4956
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 1925 transition count 4788
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 1829 transition count 4646
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 1757 transition count 4526
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 1687 transition count 4428
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 1637 transition count 4348
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 1589 transition count 4286
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 1557 transition count 4238
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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 17 with 63 rules applied. Total rules applied 6150 place count 1527 transition count 4205
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 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 40 rules applied. Total rules applied 6190 place count 1510 transition count 4182
Ensure Unique test removed 7 places
Reduce places removed 15 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 29 rules applied. Total rules applied 6219 place count 1495 transition count 4168
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 1487 transition count 4160
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 1481 transition count 4157
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 1478 transition count 4156
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6248 place count 1478 transition count 3906
Deduced a syphon composed of 250 places in 2 ms
Ensure Unique test removed 248 places
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 23 with 748 rules applied. Total rules applied 6996 place count 980 transition count 3906
Discarding 264 places :
Symmetric choice reduction at 23 with 264 rule applications. Total rules 7260 place count 716 transition count 3642
Iterating global reduction 23 with 264 rules applied. Total rules applied 7524 place count 716 transition count 3642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7524 place count 716 transition count 3641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7526 place count 715 transition count 3641
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 8064 place count 177 transition count 951
Iterating global reduction 23 with 538 rules applied. Total rules applied 8602 place count 177 transition count 951
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 9140 place count 177 transition count 413
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 9191 place count 151 transition count 388
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 24 with 5 rules applied. Total rules applied 9196 place count 151 transition count 383
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 9201 place count 146 transition count 383
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9212 place count 135 transition count 328
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 9234 place count 124 transition count 328
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9245 place count 124 transition count 317
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9256 place count 113 transition count 262
Iterating global reduction 26 with 11 rules applied. Total rules applied 9267 place count 113 transition count 262
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9277 place count 103 transition count 252
Iterating global reduction 26 with 10 rules applied. Total rules applied 9287 place count 103 transition count 252
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 26 with 173 rules applied. Total rules applied 9460 place count 103 transition count 252
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9471 place count 92 transition count 197
Iterating global reduction 26 with 11 rules applied. Total rules applied 9482 place count 92 transition count 197
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9493 place count 92 transition count 186
Applied a total of 9493 rules in 5361 ms. Remains 92 /4151 variables (removed 4059) and now considering 186/9645 (removed 9459) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 186 rows 92 cols
[2024-05-25 11:41:46] [INFO ] Computed 29 invariants in 9 ms
[2024-05-25 11:41:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:41:46] [INFO ] [Real]Absence check using 5 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-25 11:41:46] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:41:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:41:46] [INFO ] [Nat]Absence check using 5 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 11:41:46] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:41:46] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-25 11:41:46] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 173 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 121 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 2717 reset in 1069 ms.
Product exploration explored 100000 steps with 2720 reset in 1135 ms.
Built C files in :
/tmp/ltsmin2967829420975450625
[2024-05-25 11:41:49] [INFO ] Too many transitions (7797) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:41:49] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2967829420975450625
Running compilation step : cd /tmp/ltsmin2967829420975450625;'/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/ltsmin2967829420975450625;'/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/ltsmin2967829420975450625;'/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 6 out of 4491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4491/4491 places, 7797/7797 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4491 transition count 7796
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4490 transition count 7796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4489 transition count 7795
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4489 transition count 7795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4489 transition count 7794
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4488 transition count 7794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4487 transition count 7789
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4487 transition count 7789
Applied a total of 8 rules in 1472 ms. Remains 4487 /4491 variables (removed 4) and now considering 7789/7797 (removed 8) transitions.
[2024-05-25 11:41:54] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
// Phase 1: matrix 7189 rows 4487 cols
[2024-05-25 11:41:54] [INFO ] Computed 936 invariants in 248 ms
[2024-05-25 11:41:57] [INFO ] Implicit Places using invariants in 3618 ms returned []
[2024-05-25 11:41:57] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
[2024-05-25 11:41:57] [INFO ] Invariant cache hit.
[2024-05-25 11:42:03] [INFO ] Implicit Places using invariants and state equation in 5139 ms returned []
Implicit Place search using SMT with State Equation took 8759 ms to find 0 implicit places.
[2024-05-25 11:42:03] [INFO ] Redundant transitions in 574 ms returned []
[2024-05-25 11:42:03] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
[2024-05-25 11:42:03] [INFO ] Invariant cache hit.
[2024-05-25 11:42:08] [INFO ] Dead Transitions using invariants and state equation in 5057 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4487/4491 places, 7789/7797 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15868 ms. Remains : 4487/4491 places, 7789/7797 transitions.
Built C files in :
/tmp/ltsmin13370484834738189838
[2024-05-25 11:42:08] [INFO ] Too many transitions (7789) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:42:08] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13370484834738189838
Running compilation step : cd /tmp/ltsmin13370484834738189838;'/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/ltsmin13370484834738189838;'/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/ltsmin13370484834738189838;'/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 11:42:12] [INFO ] Flatten gal took : 224 ms
[2024-05-25 11:42:12] [INFO ] Flatten gal took : 243 ms
[2024-05-25 11:42:12] [INFO ] Time to serialize gal into /tmp/LTL5985384745186175159.gal : 39 ms
[2024-05-25 11:42:12] [INFO ] Time to serialize properties into /tmp/LTL16408643467550302437.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/LTL5985384745186175159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9133948268038823704.hoa' '-atoms' '/tmp/LTL16408643467550302437.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/LTL16408643467550302437.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9133948268038823704.hoa
Detected timeout of ITS tools.
[2024-05-25 11:42:27] [INFO ] Flatten gal took : 178 ms
[2024-05-25 11:42:27] [INFO ] Flatten gal took : 184 ms
[2024-05-25 11:42:29] [INFO ] Time to serialize gal into /tmp/LTL3446538772128265282.gal : 1608 ms
[2024-05-25 11:42:29] [INFO ] Time to serialize properties into /tmp/LTL13267141162509743530.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/LTL3446538772128265282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13267141162509743530.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(((F("((Node1ManageTheCrashOfNode12>=1)&&(Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((Node19HasAskedItsLeafSetToLx3ToReplac...522
Formula 0 simplified : XF((!"((Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(LeafSetOfLx3IsSentToNode19>=1))" & G!"((Node1ManageTheCrashOfNode12>=1)&&(...499
Detected timeout of ITS tools.
[2024-05-25 11:42:44] [INFO ] Flatten gal took : 185 ms
[2024-05-25 11:42:44] [INFO ] Applying decomposition
[2024-05-25 11:42:44] [INFO ] Flatten gal took : 194 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/graph15556400920687911778.txt' '-o' '/tmp/graph15556400920687911778.bin' '-w' '/tmp/graph15556400920687911778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15556400920687911778.bin' '-l' '-1' '-v' '-w' '/tmp/graph15556400920687911778.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:42:45] [INFO ] Decomposing Gal with order
[2024-05-25 11:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:42:46] [INFO ] Removed a total of 6582 redundant transitions.
[2024-05-25 11:42:47] [INFO ] Flatten gal took : 1183 ms
[2024-05-25 11:42:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4878 labels/synchronizations in 370 ms.
[2024-05-25 11:42:47] [INFO ] Time to serialize gal into /tmp/LTL12626779249629626702.gal : 57 ms
[2024-05-25 11:42:47] [INFO ] Time to serialize properties into /tmp/LTL7696496066394992879.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/LTL12626779249629626702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7696496066394992879.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("((i28.u357.Node1ManageTheCrashOfNode12>=1)&&(i28.u357.Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((i28.u3.Node19HasAsk...606
Formula 0 simplified : XF((!"((i28.u3.Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(i28.u368.LeafSetOfLx3IsSentToNode19>=1))" & G!"((i28.u357.Node1Mana...583
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1146332355940668346
[2024-05-25 11:43:02] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1146332355940668346
Running compilation step : cd /tmp/ltsmin1146332355940668346;'/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/ltsmin1146332355940668346;'/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/ltsmin1146332355940668346;'/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-S24C05-LTLFireability-11 finished in 323734 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)))'
Support contains 1 out of 4816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 4816 transition count 8172
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 4811 transition count 8172
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 259 Pre rules applied. Total rules applied 10 place count 4811 transition count 7913
Deduced a syphon composed of 259 places in 5 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 2 with 518 rules applied. Total rules applied 528 place count 4552 transition count 7913
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 540 place count 4540 transition count 7889
Iterating global reduction 2 with 12 rules applied. Total rules applied 552 place count 4540 transition count 7889
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 552 place count 4540 transition count 7884
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 562 place count 4535 transition count 7884
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 570 place count 4527 transition count 7844
Iterating global reduction 2 with 8 rules applied. Total rules applied 578 place count 4527 transition count 7844
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 634 place count 4499 transition count 7816
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 639 place count 4494 transition count 7811
Iterating global reduction 2 with 5 rules applied. Total rules applied 644 place count 4494 transition count 7811
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 644 place count 4494 transition count 7809
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 648 place count 4492 transition count 7809
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 653 place count 4487 transition count 7784
Iterating global reduction 2 with 5 rules applied. Total rules applied 658 place count 4487 transition count 7784
Applied a total of 658 rules in 2870 ms. Remains 4487 /4816 variables (removed 329) and now considering 7784/8177 (removed 393) transitions.
[2024-05-25 11:43:08] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
// Phase 1: matrix 7184 rows 4487 cols
[2024-05-25 11:43:08] [INFO ] Computed 937 invariants in 194 ms
[2024-05-25 11:43:12] [INFO ] Implicit Places using invariants in 3547 ms returned []
[2024-05-25 11:43:12] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:43:12] [INFO ] Invariant cache hit.
[2024-05-25 11:43:16] [INFO ] Implicit Places using invariants and state equation in 4198 ms returned []
Implicit Place search using SMT with State Equation took 7762 ms to find 0 implicit places.
[2024-05-25 11:43:17] [INFO ] Redundant transitions in 611 ms returned []
[2024-05-25 11:43:17] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2024-05-25 11:43:17] [INFO ] Invariant cache hit.
[2024-05-25 11:43:21] [INFO ] Dead Transitions using invariants and state equation in 4314 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4487/4816 places, 7784/8177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15564 ms. Remains : 4487/4816 places, 7784/8177 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 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:(GEQ s1142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 finished in 15670 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(F((G(p0)||(p0&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
Support contains 5 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4800 transition count 8153
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4800 transition count 8153
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 4787 transition count 8108
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 4787 transition count 8108
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 4782 transition count 8083
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 4782 transition count 8083
Applied a total of 68 rules in 1709 ms. Remains 4782 /4816 variables (removed 34) and now considering 8083/8177 (removed 94) transitions.
[2024-05-25 11:43:23] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2024-05-25 11:43:23] [INFO ] Computed 937 invariants in 193 ms
[2024-05-25 11:43:26] [INFO ] Implicit Places using invariants in 3470 ms returned []
[2024-05-25 11:43:26] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:43:26] [INFO ] Invariant cache hit.
[2024-05-25 11:43:30] [INFO ] Implicit Places using invariants and state equation in 3490 ms returned []
Implicit Place search using SMT with State Equation took 6963 ms to find 0 implicit places.
[2024-05-25 11:43:30] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 11:43:30] [INFO ] Invariant cache hit.
[2024-05-25 11:43:34] [INFO ] Dead Transitions using invariants and state equation in 4727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4782/4816 places, 8083/8177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13401 ms. Remains : 4782/4816 places, 8083/8177 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LT s4003 1), p2:(AND (GEQ s259 1) (GEQ s3841 1)), p1:(AND (GEQ s1961 1) (GEQ s4528 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4100 ms.
Product exploration explored 100000 steps with 50000 reset in 4133 ms.
Computed a total of 2158 stabilizing places and 2882 stable transitions
Computed a total of 2158 stabilizing places and 2882 stable transitions
Detected a total of 2158/4782 stabilizing places and 2882/8083 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 finished in 22170 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) U X(G(!p1)))))'
Support contains 4 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4816/4816 places, 8177/8177 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4799 transition count 8152
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4799 transition count 8152
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 4785 transition count 8106
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 4785 transition count 8106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 4779 transition count 8076
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 4779 transition count 8076
Applied a total of 74 rules in 1656 ms. Remains 4779 /4816 variables (removed 37) and now considering 8076/8177 (removed 101) transitions.
[2024-05-25 11:43:45] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
// Phase 1: matrix 7476 rows 4779 cols
[2024-05-25 11:43:45] [INFO ] Computed 937 invariants in 183 ms
[2024-05-25 11:43:50] [INFO ] Implicit Places using invariants in 5305 ms returned []
[2024-05-25 11:43:50] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
[2024-05-25 11:43:50] [INFO ] Invariant cache hit.
[2024-05-25 11:43:53] [INFO ] Implicit Places using invariants and state equation in 3281 ms returned []
Implicit Place search using SMT with State Equation took 8593 ms to find 0 implicit places.
[2024-05-25 11:43:53] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
[2024-05-25 11:43:53] [INFO ] Invariant cache hit.
[2024-05-25 11:43:58] [INFO ] Dead Transitions using invariants and state equation in 4434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4779/4816 places, 8076/8177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14686 ms. Remains : 4779/4816 places, 8076/8177 transitions.
Stuttering acceptance computed with spot in 195 ms :[p1, p1, p1, (AND p1 (NOT p0)), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1822 1) (GEQ s3203 1)), p0:(AND (GEQ s2001 1) (GEQ s4714 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1936 reset in 852 ms.
Product exploration explored 100000 steps with 1935 reset in 914 ms.
Computed a total of 2155 stabilizing places and 2875 stable transitions
Computed a total of 2155 stabilizing places and 2875 stable transitions
Detected a total of 2155/4779 stabilizing places and 2875/8076 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 127 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, p1, p1, p1]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25918 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25918 steps, saw 12243 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 11:44:03] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
[2024-05-25 11:44:03] [INFO ] Invariant cache hit.
[2024-05-25 11:44:04] [INFO ] [Real]Absence check using 47 positive place invariants in 61 ms returned sat
[2024-05-25 11:44:04] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 279 ms returned sat
[2024-05-25 11:44:08] [INFO ] After 4846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 11:44:09] [INFO ] [Nat]Absence check using 47 positive place invariants in 60 ms returned sat
[2024-05-25 11:44:09] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 272 ms returned sat
[2024-05-25 11:44:13] [INFO ] After 4422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 11:44:13] [INFO ] State equation strengthened by 2806 read => feed constraints.
[2024-05-25 11:44:13] [INFO ] After 146ms SMT Verify possible using 2806 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 11:44:13] [INFO ] After 5431ms 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 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14 finished in 30380 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)))'
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(((p0||X(X(F(!p1)))) U (p2&&(p0||X(X(F(!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(((p0||F(p1)) U (G(!p2)||(!p2&&F(!p3)))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
Stuttering acceptance computed with spot in 254 ms :[p2, p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Support contains 8 out of 4816 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4816/4816 places, 8177/8177 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 0 with 6 rules applied. Total rules applied 6 place count 4816 transition count 8171
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 4810 transition count 8171
Performed 257 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 257 Pre rules applied. Total rules applied 12 place count 4810 transition count 7914
Deduced a syphon composed of 257 places in 5 ms
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 2 with 514 rules applied. Total rules applied 526 place count 4553 transition count 7914
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 535 place count 4544 transition count 7897
Iterating global reduction 2 with 9 rules applied. Total rules applied 544 place count 4544 transition count 7897
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 544 place count 4544 transition count 7892
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 554 place count 4539 transition count 7892
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 560 place count 4533 transition count 7862
Iterating global reduction 2 with 6 rules applied. Total rules applied 566 place count 4533 transition count 7862
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 622 place count 4505 transition count 7834
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 628 place count 4499 transition count 7828
Iterating global reduction 2 with 6 rules applied. Total rules applied 634 place count 4499 transition count 7828
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 634 place count 4499 transition count 7827
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 636 place count 4498 transition count 7827
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 642 place count 4492 transition count 7797
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 4492 transition count 7797
Applied a total of 648 rules in 2660 ms. Remains 4492 /4816 variables (removed 324) and now considering 7797/8177 (removed 380) transitions.
[2024-05-25 11:44:17] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
// Phase 1: matrix 7197 rows 4492 cols
[2024-05-25 11:44:17] [INFO ] Computed 937 invariants in 181 ms
[2024-05-25 11:44:20] [INFO ] Implicit Places using invariants in 3211 ms returned []
[2024-05-25 11:44:20] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:44:20] [INFO ] Invariant cache hit.
[2024-05-25 11:44:24] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned []
Implicit Place search using SMT with State Equation took 7438 ms to find 0 implicit places.
[2024-05-25 11:44:24] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:44:24] [INFO ] Invariant cache hit.
[2024-05-25 11:44:29] [INFO ] Dead Transitions using invariants and state equation in 4515 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4492/4816 places, 7797/8177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14613 ms. Remains : 4492/4816 places, 7797/8177 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND p2 p3), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s114 1) (GEQ s2229 1)), p0:(AND (GEQ s2784 1) (GEQ s2910 1)), p1:(AND (GEQ s477 1) (GEQ s4300 1)), p3:(AND (GEQ s1958 1) (GEQ s1992 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2720 reset in 1020 ms.
Product exploration explored 100000 steps with 2719 reset in 1058 ms.
Computed a total of 1893 stabilizing places and 2621 stable transitions
Computed a total of 1893 stabilizing places and 2621 stable transitions
Detected a total of 1893/4492 stabilizing places and 2621/7797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 353 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 11:44:32] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:44:32] [INFO ] Invariant cache hit.
[2024-05-25 11:44:33] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 11:44:33] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 242 ms returned sat
[2024-05-25 11:44:38] [INFO ] After 5730ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2024-05-25 11:44:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 11:44:39] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 249 ms returned sat
[2024-05-25 11:44:45] [INFO ] After 5688ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2024-05-25 11:44:45] [INFO ] State equation strengthened by 2814 read => feed constraints.
[2024-05-25 11:44:47] [INFO ] After 2344ms SMT Verify possible using 2814 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2024-05-25 11:44:52] [INFO ] Deduced a trap composed of 900 places in 3813 ms of which 4 ms to minimize.
[2024-05-25 11:44:56] [INFO ] Deduced a trap composed of 331 places in 4050 ms of which 5 ms to minimize.
[2024-05-25 11:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8487 ms
[2024-05-25 11:44:58] [INFO ] After 13140ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 1558 ms.
[2024-05-25 11:45:00] [INFO ] After 21816ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 4492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4492/4492 places, 7797/7797 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4492 transition count 9648
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4155 transition count 9648
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 722 place count 4155 transition count 9648
Applied a total of 722 rules in 1649 ms. Remains 4155 /4492 variables (removed 337) and now considering 9648/7797 (removed -1851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1649 ms. Remains : 4155/4492 places, 9648/7797 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :4
Running SMT prover for 2 properties.
[2024-05-25 11:45:02] [INFO ] Flow matrix only has 8763 transitions (discarded 885 similar events)
// Phase 1: matrix 8763 rows 4155 cols
[2024-05-25 11:45:02] [INFO ] Computed 937 invariants in 225 ms
[2024-05-25 11:45:03] [INFO ] [Real]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 11:45:03] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 236 ms returned sat
[2024-05-25 11:45:07] [INFO ] After 5077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:45:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 55 ms returned sat
[2024-05-25 11:45:08] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 234 ms returned sat
[2024-05-25 11:45:13] [INFO ] After 4592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:45:13] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:45:15] [INFO ] After 2537ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:45:20] [INFO ] Deduced a trap composed of 363 places in 4331 ms of which 4 ms to minimize.
[2024-05-25 11:45:27] [INFO ] Deduced a trap composed of 374 places in 4219 ms of which 4 ms to minimize.
[2024-05-25 11:45:32] [INFO ] Deduced a trap composed of 219 places in 4719 ms of which 5 ms to minimize.
[2024-05-25 11:45:32] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 16717 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 11:45:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:45:33] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 4155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4155/4155 places, 9648/9648 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4155 transition count 9647
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4154 transition count 9647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4153 transition count 9646
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4153 transition count 9646
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4153 transition count 9645
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4152 transition count 9645
Applied a total of 6 rules in 830 ms. Remains 4152 /4155 variables (removed 3) and now considering 9645/9648 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 831 ms. Remains : 4152/4155 places, 9645/9648 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24217 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24217 steps, saw 11034 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:45:37] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
// Phase 1: matrix 8760 rows 4152 cols
[2024-05-25 11:45:37] [INFO ] Computed 937 invariants in 225 ms
[2024-05-25 11:45:38] [INFO ] [Real]Absence check using 49 positive place invariants in 55 ms returned sat
[2024-05-25 11:45:38] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 243 ms returned sat
[2024-05-25 11:45:42] [INFO ] After 5388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:45:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 11:45:43] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 242 ms returned sat
[2024-05-25 11:45:48] [INFO ] After 5094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:45:48] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:45:51] [INFO ] After 2539ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:45:56] [INFO ] Deduced a trap composed of 325 places in 4702 ms of which 4 ms to minimize.
[2024-05-25 11:46:01] [INFO ] Deduced a trap composed of 305 places in 4240 ms of which 5 ms to minimize.
[2024-05-25 11:46:06] [INFO ] Deduced a trap composed of 566 places in 4390 ms of which 4 ms to minimize.
[2024-05-25 11:46:11] [INFO ] Deduced a trap composed of 327 places in 4634 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.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 11:46:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 11:46:11] [INFO ] After 28838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4152/4152 places, 9645/9645 transitions.
Applied a total of 0 rules in 525 ms. Remains 4152 /4152 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 4152/4152 places, 9645/9645 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4152/4152 places, 9645/9645 transitions.
Applied a total of 0 rules in 513 ms. Remains 4152 /4152 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
[2024-05-25 11:46:12] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:46:12] [INFO ] Invariant cache hit.
[2024-05-25 11:46:17] [INFO ] Implicit Places using invariants in 4619 ms returned []
[2024-05-25 11:46:17] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:46:17] [INFO ] Invariant cache hit.
[2024-05-25 11:46:22] [INFO ] Implicit Places using invariants and state equation in 4569 ms returned []
Implicit Place search using SMT with State Equation took 9188 ms to find 0 implicit places.
[2024-05-25 11:46:22] [INFO ] Redundant transitions in 898 ms returned []
[2024-05-25 11:46:22] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:46:22] [INFO ] Invariant cache hit.
[2024-05-25 11:46:28] [INFO ] Dead Transitions using invariants and state equation in 5457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16069 ms. Remains : 4152/4152 places, 9645/9645 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) p2 p3))), (G (NOT (AND (NOT p0) (NOT p1) p2 p3))), (G (NOT (AND p2 p3)))]
False Knowledge obtained : [(F (AND (NOT p2) p3)), (F p1), (F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 18 factoid took 853 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 105 ms :[p2, (NOT p1), p2]
Support contains 6 out of 4492 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 : 4492/4492 places, 7797/7797 transitions.
Applied a total of 0 rules in 516 ms. Remains 4492 /4492 variables (removed 0) and now considering 7797/7797 (removed 0) transitions.
[2024-05-25 11:46:30] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
// Phase 1: matrix 7197 rows 4492 cols
[2024-05-25 11:46:30] [INFO ] Computed 937 invariants in 179 ms
[2024-05-25 11:46:33] [INFO ] Implicit Places using invariants in 3525 ms returned []
[2024-05-25 11:46:33] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:46:33] [INFO ] Invariant cache hit.
[2024-05-25 11:46:38] [INFO ] Implicit Places using invariants and state equation in 4566 ms returned []
Implicit Place search using SMT with State Equation took 8092 ms to find 0 implicit places.
[2024-05-25 11:46:38] [INFO ] Redundant transitions in 618 ms returned []
[2024-05-25 11:46:38] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:46:38] [INFO ] Invariant cache hit.
[2024-05-25 11:46:43] [INFO ] Dead Transitions using invariants and state equation in 4674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13909 ms. Remains : 4492/4492 places, 7797/7797 transitions.
Computed a total of 1893 stabilizing places and 2621 stable transitions
Computed a total of 1893 stabilizing places and 2621 stable transitions
Detected a total of 1893/4492 stabilizing places and 2621/7797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:46:44] [INFO ] Flow matrix only has 7197 transitions (discarded 600 similar events)
[2024-05-25 11:46:44] [INFO ] Invariant cache hit.
[2024-05-25 11:46:44] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 11:46:44] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 258 ms returned sat
[2024-05-25 11:46:49] [INFO ] After 4897ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:46:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 11:46:49] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 257 ms returned sat
[2024-05-25 11:46:53] [INFO ] After 3994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:46:54] [INFO ] State equation strengthened by 2814 read => feed constraints.
[2024-05-25 11:46:55] [INFO ] After 1250ms SMT Verify possible using 2814 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:46:59] [INFO ] Deduced a trap composed of 701 places in 4224 ms of which 5 ms to minimize.
[2024-05-25 11:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4643 ms
[2024-05-25 11:47:00] [INFO ] After 6485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 479 ms.
[2024-05-25 11:47:00] [INFO ] After 11935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 4492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4492/4492 places, 7797/7797 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4492 transition count 7796
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4491 transition count 7796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4490 transition count 7795
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4490 transition count 7795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4490 transition count 7794
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4489 transition count 7794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4488 transition count 7789
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4488 transition count 7789
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 344 place count 4488 transition count 9645
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 680 place count 4152 transition count 9645
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 704 place count 4152 transition count 9645
Applied a total of 704 rules in 2519 ms. Remains 4152 /4492 variables (removed 340) and now considering 9645/7797 (removed -1848) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2519 ms. Remains : 4152/4492 places, 9645/7797 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24526 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24526 steps, saw 11163 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:47:06] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
// Phase 1: matrix 8760 rows 4152 cols
[2024-05-25 11:47:07] [INFO ] Computed 937 invariants in 220 ms
[2024-05-25 11:47:07] [INFO ] [Real]Absence check using 49 positive place invariants in 57 ms returned sat
[2024-05-25 11:47:07] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 251 ms returned sat
[2024-05-25 11:47:12] [INFO ] After 5251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:47:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2024-05-25 11:47:13] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 246 ms returned sat
[2024-05-25 11:47:17] [INFO ] After 4650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:47:17] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-25 11:47:20] [INFO ] After 2438ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:47:25] [INFO ] Deduced a trap composed of 305 places in 4317 ms of which 5 ms to minimize.
[2024-05-25 11:47:30] [INFO ] Deduced a trap composed of 557 places in 4390 ms of which 5 ms to minimize.
[2024-05-25 11:47:35] [INFO ] Deduced a trap composed of 330 places in 4835 ms of which 4 ms to minimize.
[2024-05-25 11:47:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 15573 ms
[2024-05-25 11:47:36] [INFO ] After 18758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 643 ms.
[2024-05-25 11:47:37] [INFO ] After 24944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 4152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4152/4152 places, 9645/9645 transitions.
Applied a total of 0 rules in 509 ms. Remains 4152 /4152 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 4152/4152 places, 9645/9645 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4152/4152 places, 9645/9645 transitions.
Applied a total of 0 rules in 522 ms. Remains 4152 /4152 variables (removed 0) and now considering 9645/9645 (removed 0) transitions.
[2024-05-25 11:47:38] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:47:38] [INFO ] Invariant cache hit.
[2024-05-25 11:47:42] [INFO ] Implicit Places using invariants in 4518 ms returned []
[2024-05-25 11:47:42] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:47:42] [INFO ] Invariant cache hit.
[2024-05-25 11:47:47] [INFO ] Implicit Places using invariants and state equation in 4510 ms returned []
Implicit Place search using SMT with State Equation took 9030 ms to find 0 implicit places.
[2024-05-25 11:47:48] [INFO ] Redundant transitions in 894 ms returned []
[2024-05-25 11:47:48] [INFO ] Flow matrix only has 8760 transitions (discarded 885 similar events)
[2024-05-25 11:47:48] [INFO ] Invariant cache hit.
[2024-05-25 11:47:53] [INFO ] Dead Transitions using invariants and state equation in 5108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15560 ms. Remains : 4152/4152 places, 9645/9645 transitions.
Graph (trivial) has 3278 edges and 4152 vertex of which 25 / 4152 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 28037 edges and 4128 vertex of which 4107 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 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 t3598.t3932 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 3721 transition count 7917
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 3479 transition count 7436
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 3238 transition count 6996
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 2998 transition count 6598
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 2798 transition count 6238
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 2600 transition count 5916
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 2438 transition count 5628
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 2278 transition count 5374
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 2150 transition count 5150
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 2024 transition count 4956
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 1926 transition count 4788
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 1830 transition count 4646
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 1758 transition count 4526
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 1688 transition count 4428
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 1638 transition count 4348
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 1590 transition count 4286
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 1558 transition count 4238
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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 17 with 63 rules applied. Total rules applied 6150 place count 1528 transition count 4205
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 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 40 rules applied. Total rules applied 6190 place count 1511 transition count 4182
Ensure Unique test removed 7 places
Reduce places removed 15 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 29 rules applied. Total rules applied 6219 place count 1496 transition count 4168
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 1488 transition count 4160
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 1482 transition count 4157
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 1479 transition count 4156
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6248 place count 1479 transition count 3906
Deduced a syphon composed of 250 places in 1 ms
Ensure Unique test removed 249 places
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 23 with 749 rules applied. Total rules applied 6997 place count 980 transition count 3906
Discarding 263 places :
Symmetric choice reduction at 23 with 263 rule applications. Total rules 7260 place count 717 transition count 3643
Iterating global reduction 23 with 263 rules applied. Total rules applied 7523 place count 717 transition count 3643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7523 place count 717 transition count 3642
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7525 place count 716 transition count 3642
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 8063 place count 178 transition count 952
Iterating global reduction 23 with 538 rules applied. Total rules applied 8601 place count 178 transition count 952
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 9139 place count 178 transition count 414
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 9190 place count 152 transition count 389
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 24 with 5 rules applied. Total rules applied 9195 place count 152 transition count 384
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 9200 place count 147 transition count 384
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9211 place count 136 transition count 329
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 9233 place count 125 transition count 329
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9244 place count 125 transition count 318
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9255 place count 114 transition count 263
Iterating global reduction 26 with 11 rules applied. Total rules applied 9266 place count 114 transition count 263
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9276 place count 104 transition count 253
Iterating global reduction 26 with 10 rules applied. Total rules applied 9286 place count 104 transition count 253
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 26 with 173 rules applied. Total rules applied 9459 place count 104 transition count 253
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9470 place count 93 transition count 198
Iterating global reduction 26 with 11 rules applied. Total rules applied 9481 place count 93 transition count 198
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9492 place count 93 transition count 187
Applied a total of 9492 rules in 5034 ms. Remains 93 /4152 variables (removed 4059) and now considering 187/9645 (removed 9458) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 93 cols
[2024-05-25 11:47:58] [INFO ] Computed 29 invariants in 4 ms
[2024-05-25 11:47:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:47:58] [INFO ] [Real]Absence check using 5 positive and 24 generalized place invariants in 3 ms returned sat
[2024-05-25 11:47:58] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:47:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:47:58] [INFO ] [Nat]Absence check using 5 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 11:47:58] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:47:58] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 11:47:58] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 119 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 116 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 2719 reset in 1023 ms.
Product exploration explored 100000 steps with 2719 reset in 1059 ms.
Built C files in :
/tmp/ltsmin687607331515118631
[2024-05-25 11:48:01] [INFO ] Too many transitions (7797) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:48:01] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin687607331515118631
Running compilation step : cd /tmp/ltsmin687607331515118631;'/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/ltsmin687607331515118631;'/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/ltsmin687607331515118631;'/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 6 out of 4492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4492/4492 places, 7797/7797 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4492 transition count 7796
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4491 transition count 7796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4490 transition count 7795
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4490 transition count 7795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4490 transition count 7794
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4489 transition count 7794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4488 transition count 7789
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4488 transition count 7789
Applied a total of 8 rules in 1382 ms. Remains 4488 /4492 variables (removed 4) and now considering 7789/7797 (removed 8) transitions.
[2024-05-25 11:48:05] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
// Phase 1: matrix 7189 rows 4488 cols
[2024-05-25 11:48:06] [INFO ] Computed 937 invariants in 194 ms
[2024-05-25 11:48:10] [INFO ] Implicit Places using invariants in 4821 ms returned []
[2024-05-25 11:48:10] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
[2024-05-25 11:48:10] [INFO ] Invariant cache hit.
[2024-05-25 11:48:15] [INFO ] Implicit Places using invariants and state equation in 5251 ms returned []
Implicit Place search using SMT with State Equation took 10074 ms to find 0 implicit places.
[2024-05-25 11:48:16] [INFO ] Redundant transitions in 587 ms returned []
[2024-05-25 11:48:16] [INFO ] Flow matrix only has 7189 transitions (discarded 600 similar events)
[2024-05-25 11:48:16] [INFO ] Invariant cache hit.
[2024-05-25 11:48:21] [INFO ] Dead Transitions using invariants and state equation in 4960 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4488/4492 places, 7789/7797 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17011 ms. Remains : 4488/4492 places, 7789/7797 transitions.
Built C files in :
/tmp/ltsmin3476056072961827954
[2024-05-25 11:48:21] [INFO ] Too many transitions (7789) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:48:21] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3476056072961827954
Running compilation step : cd /tmp/ltsmin3476056072961827954;'/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/ltsmin3476056072961827954;'/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/ltsmin3476056072961827954;'/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 11:48:24] [INFO ] Flatten gal took : 209 ms
[2024-05-25 11:48:25] [INFO ] Flatten gal took : 214 ms
[2024-05-25 11:48:25] [INFO ] Time to serialize gal into /tmp/LTL8467705166185083002.gal : 37 ms
[2024-05-25 11:48:25] [INFO ] Time to serialize properties into /tmp/LTL17390069378360716514.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/LTL8467705166185083002.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1952126456364433777.hoa' '-atoms' '/tmp/LTL17390069378360716514.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/LTL17390069378360716514.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1952126456364433777.hoa
Detected timeout of ITS tools.
[2024-05-25 11:48:40] [INFO ] Flatten gal took : 200 ms
[2024-05-25 11:48:40] [INFO ] Flatten gal took : 210 ms
[2024-05-25 11:48:40] [INFO ] Time to serialize gal into /tmp/LTL5239745543313332974.gal : 32 ms
[2024-05-25 11:48:40] [INFO ] Time to serialize properties into /tmp/LTL9212047469775633151.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/LTL5239745543313332974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9212047469775633151.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 : !((X(G(((F("((Node1ManageTheCrashOfNode12>=1)&&(Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((Node19HasAskedItsLeafSetToLx3ToReplac...522
Formula 0 simplified : XF((!"((Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(LeafSetOfLx3IsSentToNode19>=1))" & G!"((Node1ManageTheCrashOfNode12>=1)&&(...499
Detected timeout of ITS tools.
[2024-05-25 11:48:56] [INFO ] Flatten gal took : 204 ms
[2024-05-25 11:48:56] [INFO ] Applying decomposition
[2024-05-25 11:48:56] [INFO ] Flatten gal took : 212 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/graph5485033079609556353.txt' '-o' '/tmp/graph5485033079609556353.bin' '-w' '/tmp/graph5485033079609556353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5485033079609556353.bin' '-l' '-1' '-v' '-w' '/tmp/graph5485033079609556353.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:48:56] [INFO ] Decomposing Gal with order
[2024-05-25 11:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:48:57] [INFO ] Removed a total of 6672 redundant transitions.
[2024-05-25 11:48:57] [INFO ] Flatten gal took : 946 ms
[2024-05-25 11:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4346 labels/synchronizations in 360 ms.
[2024-05-25 11:48:58] [INFO ] Time to serialize gal into /tmp/LTL5144601803909568985.gal : 60 ms
[2024-05-25 11:48:58] [INFO ] Time to serialize properties into /tmp/LTL88814440516612863.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/LTL5144601803909568985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL88814440516612863.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...252
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("((i20.i0.u378.Node1ManageTheCrashOfNode12>=1)&&(i20.i0.u378.Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((i20.i1.u414.N...620
Formula 0 simplified : XF((!"((i20.i1.u414.Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(i20.i1.u391.LeafSetOfLx3IsSentToNode19>=1))" & G!"((i20.i0.u37...597
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16017051019892235979
[2024-05-25 11:49:13] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16017051019892235979
Running compilation step : cd /tmp/ltsmin16017051019892235979;'/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/ltsmin16017051019892235979;'/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/ltsmin16017051019892235979;'/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-S24C05-LTLFireability-11 finished in 302531 ms.
[2024-05-25 11:49:16] [INFO ] Flatten gal took : 229 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3171890167486403729
[2024-05-25 11:49:17] [INFO ] Too many transitions (8177) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:49:17] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3171890167486403729
Running compilation step : cd /tmp/ltsmin3171890167486403729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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 11:49:17] [INFO ] Applying decomposition
[2024-05-25 11:49:17] [INFO ] Flatten gal took : 212 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/graph15935330753208092452.txt' '-o' '/tmp/graph15935330753208092452.bin' '-w' '/tmp/graph15935330753208092452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15935330753208092452.bin' '-l' '-1' '-v' '-w' '/tmp/graph15935330753208092452.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:49:17] [INFO ] Decomposing Gal with order
[2024-05-25 11:49:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:49:18] [INFO ] Removed a total of 6341 redundant transitions.
[2024-05-25 11:49:18] [INFO ] Flatten gal took : 697 ms
[2024-05-25 11:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 3115 labels/synchronizations in 233 ms.
[2024-05-25 11:49:19] [INFO ] Time to serialize gal into /tmp/LTLFireability9819794271693626728.gal : 56 ms
[2024-05-25 11:49:19] [INFO ] Time to serialize properties into /tmp/LTLFireability13996971437549212060.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/LTLFireability9819794271693626728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13996971437549212060.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...277
Read 3 LTL properties
Checking formula 0 : !((F(G("(i18.u242.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(i18.u242.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Compilation finished in 40036 ms.
Running link step : cd /tmp/ltsmin3171890167486403729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin3171890167486403729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3171890167486403729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3171890167486403729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp1==true)||X(X(<>(!(LTLAPp2==true))))) U ((LTLAPp3==true)&&((LTLAPp1==true)||X(X(<>(!(LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 67585 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3171890167486403729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp4==true)||<>((LTLAPp5==true))) U ([](!(LTLAPp6==true))||(!(LTLAPp6==true)&&<>(!(LTLAPp7==true)))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-25 12:13:07] [INFO ] Flatten gal took : 1852 ms
[2024-05-25 12:13:07] [INFO ] Time to serialize gal into /tmp/LTLFireability1652170748782882626.gal : 190 ms
[2024-05-25 12:13:07] [INFO ] Time to serialize properties into /tmp/LTLFireability16339561465247801003.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/LTLFireability1652170748782882626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16339561465247801003.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 2 LTL properties
Checking formula 0 : !((F(G("(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6993696 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16191208 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-S24C05"
export BK_EXAMINATION="LTLFireability"
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-S24C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654371900053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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