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.r439-smll-171690585700168.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 TriangularGrid-PT-5046, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585700168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 13 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 06:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 06:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 185K 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 TriangularGrid-PT-5046-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717039133623

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=TriangularGrid-PT-5046
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 03:18:56] [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-30 03:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:18:56] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-30 03:18:56] [INFO ] Transformed 280 places.
[2024-05-30 03:18:56] [INFO ] Transformed 240 transitions.
[2024-05-30 03:18:56] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 209 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 1 formulas.
FORMULA TriangularGrid-PT-5046-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 39 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2024-05-30 03:18:56] [INFO ] Computed 116 invariants in 24 ms
[2024-05-30 03:18:57] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-30 03:18:57] [INFO ] Invariant cache hit.
[2024-05-30 03:18:57] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-30 03:18:57] [INFO ] Invariant cache hit.
[2024-05-30 03:18:58] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 52 out of 280 places after structural reductions.
[2024-05-30 03:18:58] [INFO ] Flatten gal took : 73 ms
[2024-05-30 03:18:58] [INFO ] Flatten gal took : 35 ms
[2024-05-30 03:18:58] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 47 out of 280 places (down from 52) after GAL structural reductions.
Finished random walk after 255 steps, including 0 resets, run visited all 25 properties in 64 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0))&&F(p1))) U p0))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 36 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:18:58] [INFO ] Invariant cache hit.
[2024-05-30 03:18:59] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-30 03:18:59] [INFO ] Invariant cache hit.
[2024-05-30 03:18:59] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-30 03:18:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-30 03:18:59] [INFO ] Invariant cache hit.
[2024-05-30 03:18:59] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 999 ms. Remains : 280/280 places, 240/240 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 319 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s82 1) (GEQ s195 1)), p1:(AND (GEQ s84 1) (GEQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10765 steps with 0 reset in 226 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-00 finished in 1619 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 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 25 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:00] [INFO ] Invariant cache hit.
[2024-05-30 03:19:00] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-30 03:19:00] [INFO ] Invariant cache hit.
[2024-05-30 03:19:01] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-05-30 03:19:01] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-30 03:19:01] [INFO ] Invariant cache hit.
[2024-05-30 03:19:01] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1023 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-01 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:(OR (LT s57 1) (LT s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1020 reset in 1779 ms.
Product exploration explored 100000 steps with 1037 reset in 1844 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-30 03:19:05] [INFO ] Invariant cache hit.
[2024-05-30 03:19:06] [INFO ] [Real]Absence check using 115 positive place invariants in 55 ms returned sat
[2024-05-30 03:19:06] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 224 ms returned sat
[2024-05-30 03:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:06] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-05-30 03:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:07] [INFO ] [Nat]Absence check using 115 positive place invariants in 48 ms returned sat
[2024-05-30 03:19:07] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 92 ms returned sat
[2024-05-30 03:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:07] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-05-30 03:19:07] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 03:19:08] [INFO ] Added : 89 causal constraints over 18 iterations in 545 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 17 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:08] [INFO ] Invariant cache hit.
[2024-05-30 03:19:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-30 03:19:08] [INFO ] Invariant cache hit.
[2024-05-30 03:19:08] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-30 03:19:08] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-30 03:19:08] [INFO ] Invariant cache hit.
[2024-05-30 03:19:09] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1038 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 125 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-30 03:19:09] [INFO ] Invariant cache hit.
[2024-05-30 03:19:09] [INFO ] [Real]Absence check using 115 positive place invariants in 54 ms returned sat
[2024-05-30 03:19:10] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 225 ms returned sat
[2024-05-30 03:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:10] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-30 03:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:10] [INFO ] [Nat]Absence check using 115 positive place invariants in 55 ms returned sat
[2024-05-30 03:19:10] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 92 ms returned sat
[2024-05-30 03:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:11] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-30 03:19:11] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 03:19:11] [INFO ] Added : 89 causal constraints over 18 iterations in 469 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1099 reset in 1704 ms.
Product exploration explored 100000 steps with 1000 reset in 1830 ms.
Built C files in :
/tmp/ltsmin13051204460732841816
[2024-05-30 03:19:15] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:19:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:15] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:19:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:15] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:19:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:15] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13051204460732841816
Running compilation step : cd /tmp/ltsmin13051204460732841816;'/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'
Compilation finished in 933 ms.
Running link step : cd /tmp/ltsmin13051204460732841816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13051204460732841816;'/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' '--hoa' '/tmp/stateBased5882179574169943624.hoa' '--buchi-type=spotba'
LTSmin run took 937 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-01 finished in 16898 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 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 13 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:17] [INFO ] Invariant cache hit.
[2024-05-30 03:19:17] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-30 03:19:17] [INFO ] Invariant cache hit.
[2024-05-30 03:19:18] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-05-30 03:19:18] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-30 03:19:18] [INFO ] Invariant cache hit.
[2024-05-30 03:19:18] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1090 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-03 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:(OR (LT s77 1) (LT s220 1) (AND (GEQ s64 1) (GEQ s180 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 354 reset in 1755 ms.
Product exploration explored 100000 steps with 367 reset in 1862 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 344 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 293 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 16 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:22] [INFO ] Invariant cache hit.
[2024-05-30 03:19:23] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-30 03:19:23] [INFO ] Invariant cache hit.
[2024-05-30 03:19:23] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-05-30 03:19:23] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-30 03:19:23] [INFO ] Invariant cache hit.
[2024-05-30 03:19:24] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1714 steps, including 0 resets, run visited all 1 properties in 38 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 361 reset in 1741 ms.
Product exploration explored 100000 steps with 396 reset in 1890 ms.
Built C files in :
/tmp/ltsmin17040297956271323759
[2024-05-30 03:19:28] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:19:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:28] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:19:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:28] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:19:28] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:28] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17040297956271323759
Running compilation step : cd /tmp/ltsmin17040297956271323759;'/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'
Compilation finished in 785 ms.
Running link step : cd /tmp/ltsmin17040297956271323759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17040297956271323759;'/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' '--hoa' '/tmp/stateBased3905346674827738675.hoa' '--buchi-type=spotba'
LTSmin run took 2336 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-03 finished in 14209 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((p0||X((G(p2)&&p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:31] [INFO ] Invariant cache hit.
[2024-05-30 03:19:31] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-30 03:19:31] [INFO ] Invariant cache hit.
[2024-05-30 03:19:32] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-05-30 03:19:32] [INFO ] Invariant cache hit.
[2024-05-30 03:19:32] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s75 1) (GEQ s115 1)), p2:(AND (GEQ s8 1) (GEQ s240 1)), p1:(AND (GEQ s75 1) (GEQ s115 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-04 finished in 1308 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((p0&&F(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:32] [INFO ] Invariant cache hit.
[2024-05-30 03:19:33] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-30 03:19:33] [INFO ] Invariant cache hit.
[2024-05-30 03:19:33] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2024-05-30 03:19:33] [INFO ] Invariant cache hit.
[2024-05-30 03:19:33] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s95 1) (GEQ s127 1)), p0:(OR (LT s14 1) (LT s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 622 reset in 1909 ms.
Product exploration explored 100000 steps with 605 reset in 1869 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 375 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 46 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 392 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:19:39] [INFO ] Invariant cache hit.
[2024-05-30 03:19:39] [INFO ] [Real]Absence check using 115 positive place invariants in 60 ms returned sat
[2024-05-30 03:19:39] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 52 ms returned sat
[2024-05-30 03:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:40] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-30 03:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:40] [INFO ] [Nat]Absence check using 115 positive place invariants in 75 ms returned sat
[2024-05-30 03:19:40] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 16 ms returned sat
[2024-05-30 03:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:40] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-05-30 03:19:40] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 03:19:41] [INFO ] Added : 87 causal constraints over 18 iterations in 459 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 03:19:41] [INFO ] Invariant cache hit.
[2024-05-30 03:19:41] [INFO ] [Real]Absence check using 115 positive place invariants in 59 ms returned sat
[2024-05-30 03:19:41] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 37 ms returned sat
[2024-05-30 03:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:41] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-30 03:19:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:42] [INFO ] [Nat]Absence check using 115 positive place invariants in 67 ms returned sat
[2024-05-30 03:19:42] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:42] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-30 03:19:42] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 03:19:43] [INFO ] Added : 88 causal constraints over 18 iterations in 451 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:43] [INFO ] Invariant cache hit.
[2024-05-30 03:19:43] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-30 03:19:43] [INFO ] Invariant cache hit.
[2024-05-30 03:19:43] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-05-30 03:19:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:19:43] [INFO ] Invariant cache hit.
[2024-05-30 03:19:44] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1059 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 482 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 67 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 447 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:19:45] [INFO ] Invariant cache hit.
[2024-05-30 03:19:45] [INFO ] [Real]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:19:46] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 54 ms returned sat
[2024-05-30 03:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:46] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-30 03:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:46] [INFO ] [Nat]Absence check using 115 positive place invariants in 74 ms returned sat
[2024-05-30 03:19:46] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-30 03:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:47] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-30 03:19:47] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 03:19:47] [INFO ] Added : 87 causal constraints over 18 iterations in 428 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 03:19:47] [INFO ] Invariant cache hit.
[2024-05-30 03:19:47] [INFO ] [Real]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:19:47] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 36 ms returned sat
[2024-05-30 03:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:48] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-30 03:19:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:19:48] [INFO ] [Nat]Absence check using 115 positive place invariants in 68 ms returned sat
[2024-05-30 03:19:48] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:19:48] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-05-30 03:19:48] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 03:19:49] [INFO ] Added : 88 causal constraints over 18 iterations in 452 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 589 reset in 1770 ms.
Product exploration explored 100000 steps with 582 reset in 1873 ms.
Built C files in :
/tmp/ltsmin5145274701222554193
[2024-05-30 03:19:53] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:19:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:53] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:19:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:53] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:19:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:19:53] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5145274701222554193
Running compilation step : cd /tmp/ltsmin5145274701222554193;'/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'
Compilation finished in 742 ms.
Running link step : cd /tmp/ltsmin5145274701222554193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5145274701222554193;'/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' '--hoa' '/tmp/stateBased11330627438120326890.hoa' '--buchi-type=spotba'
LTSmin run took 892 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-05 finished in 22017 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(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:19:54] [INFO ] Invariant cache hit.
[2024-05-30 03:19:55] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-30 03:19:55] [INFO ] Invariant cache hit.
[2024-05-30 03:19:55] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2024-05-30 03:19:55] [INFO ] Invariant cache hit.
[2024-05-30 03:19:56] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s40 1) (LT s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1022 reset in 1705 ms.
Product exploration explored 100000 steps with 1097 reset in 1834 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-30 03:20:00] [INFO ] Invariant cache hit.
[2024-05-30 03:20:00] [INFO ] [Real]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:20:00] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 82 ms returned sat
[2024-05-30 03:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:00] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-30 03:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:20:01] [INFO ] [Nat]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:20:01] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 54 ms returned sat
[2024-05-30 03:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:01] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-30 03:20:01] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 03:20:02] [INFO ] Added : 88 causal constraints over 18 iterations in 471 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:02] [INFO ] Invariant cache hit.
[2024-05-30 03:20:02] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-30 03:20:02] [INFO ] Invariant cache hit.
[2024-05-30 03:20:02] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-30 03:20:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:20:02] [INFO ] Invariant cache hit.
[2024-05-30 03:20:03] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 958 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-30 03:20:03] [INFO ] Invariant cache hit.
[2024-05-30 03:20:03] [INFO ] [Real]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:20:03] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 81 ms returned sat
[2024-05-30 03:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:04] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-05-30 03:20:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:20:04] [INFO ] [Nat]Absence check using 115 positive place invariants in 57 ms returned sat
[2024-05-30 03:20:04] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 50 ms returned sat
[2024-05-30 03:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:05] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-30 03:20:05] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 03:20:05] [INFO ] Added : 88 causal constraints over 18 iterations in 468 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1086 reset in 1688 ms.
Product exploration explored 100000 steps with 1039 reset in 1829 ms.
Built C files in :
/tmp/ltsmin3656635822591566828
[2024-05-30 03:20:09] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:20:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:09] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:20:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:09] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:20:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3656635822591566828
Running compilation step : cd /tmp/ltsmin3656635822591566828;'/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'
Compilation finished in 763 ms.
Running link step : cd /tmp/ltsmin3656635822591566828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3656635822591566828;'/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' '--hoa' '/tmp/stateBased2582569029066069951.hoa' '--buchi-type=spotba'
LTSmin run took 899 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-07 finished in 15836 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(p0)||F(p1)))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:10] [INFO ] Invariant cache hit.
[2024-05-30 03:20:11] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-30 03:20:11] [INFO ] Invariant cache hit.
[2024-05-30 03:20:11] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2024-05-30 03:20:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:20:11] [INFO ] Invariant cache hit.
[2024-05-30 03:20:12] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1226 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s160 1) (GEQ s205 1)), p0:(OR (LT s94 1) (LT s227 1) (AND (GEQ s85 1) (GEQ s223 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1052 reset in 1714 ms.
Product exploration explored 100000 steps with 1068 reset in 1836 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 358 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 203 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 426 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:16] [INFO ] Invariant cache hit.
[2024-05-30 03:20:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-30 03:20:17] [INFO ] Invariant cache hit.
[2024-05-30 03:20:17] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-05-30 03:20:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:20:17] [INFO ] Invariant cache hit.
[2024-05-30 03:20:17] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1179 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 385 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 131 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 414 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1100 reset in 1836 ms.
Product exploration explored 100000 steps with 1163 reset in 1747 ms.
Built C files in :
/tmp/ltsmin3595753346936199916
[2024-05-30 03:20:22] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:20:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:22] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:20:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:22] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:20:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:22] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3595753346936199916
Running compilation step : cd /tmp/ltsmin3595753346936199916;'/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'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin3595753346936199916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3595753346936199916;'/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' '--hoa' '/tmp/stateBased15730300611032905240.hoa' '--buchi-type=spotba'
LTSmin run took 3224 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-08 finished in 15979 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((p0&&(!p1 U p2)&&X(G(p1))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:26] [INFO ] Invariant cache hit.
[2024-05-30 03:20:27] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-30 03:20:27] [INFO ] Invariant cache hit.
[2024-05-30 03:20:27] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-30 03:20:27] [INFO ] Invariant cache hit.
[2024-05-30 03:20:27] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s78 1) (GEQ s132 1)) (AND (GEQ s7 1) (GEQ s150 1))), p2:(AND (GEQ s93 1) (GEQ s126 1)), p1:(AND (GEQ s7 1) (GEQ s150 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 98 reset in 1921 ms.
Product exploration explored 100000 steps with 98 reset in 1816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 717 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Finished random walk after 349 steps, including 0 resets, run visited all 10 properties in 30 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 1216 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-05-30 03:20:35] [INFO ] Invariant cache hit.
[2024-05-30 03:20:35] [INFO ] [Real]Absence check using 115 positive place invariants in 139 ms returned sat
[2024-05-30 03:20:35] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:35] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-30 03:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:20:36] [INFO ] [Nat]Absence check using 115 positive place invariants in 83 ms returned sat
[2024-05-30 03:20:36] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:36] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-05-30 03:20:36] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-30 03:20:37] [INFO ] Added : 89 causal constraints over 18 iterations in 572 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:37] [INFO ] Invariant cache hit.
[2024-05-30 03:20:37] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-30 03:20:37] [INFO ] Invariant cache hit.
[2024-05-30 03:20:38] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-30 03:20:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 03:20:38] [INFO ] Invariant cache hit.
[2024-05-30 03:20:38] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1474 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 1474 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Finished random walk after 131 steps, including 0 resets, run visited all 10 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 1984 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-05-30 03:20:43] [INFO ] Invariant cache hit.
[2024-05-30 03:20:43] [INFO ] [Real]Absence check using 115 positive place invariants in 135 ms returned sat
[2024-05-30 03:20:43] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:44] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2024-05-30 03:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:20:44] [INFO ] [Nat]Absence check using 115 positive place invariants in 58 ms returned sat
[2024-05-30 03:20:44] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 03:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:20:45] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-30 03:20:45] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 03:20:45] [INFO ] Added : 89 causal constraints over 18 iterations in 616 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Product exploration explored 100000 steps with 117 reset in 1942 ms.
Product exploration explored 100000 steps with 110 reset in 2011 ms.
Built C files in :
/tmp/ltsmin43156387159459515
[2024-05-30 03:20:50] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:20:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:50] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:20:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:50] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:20:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:20:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin43156387159459515
Running compilation step : cd /tmp/ltsmin43156387159459515;'/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'
Compilation finished in 725 ms.
Running link step : cd /tmp/ltsmin43156387159459515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin43156387159459515;'/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' '--hoa' '/tmp/stateBased16218192709013466987.hoa' '--buchi-type=spotba'
LTSmin run took 1070 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-09 finished in 25141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:51] [INFO ] Invariant cache hit.
[2024-05-30 03:20:52] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-30 03:20:52] [INFO ] Invariant cache hit.
[2024-05-30 03:20:52] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-05-30 03:20:52] [INFO ] Invariant cache hit.
[2024-05-30 03:20:53] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1224 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s85 1) (LT s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 143 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-10 finished in 1389 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(p0)||(F(p1) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:53] [INFO ] Invariant cache hit.
[2024-05-30 03:20:53] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-30 03:20:53] [INFO ] Invariant cache hit.
[2024-05-30 03:20:54] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2024-05-30 03:20:54] [INFO ] Invariant cache hit.
[2024-05-30 03:20:54] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s89 1) (LT s225 1)), p2:(AND (GEQ s56 1) (GEQ s269 1)), p1:(AND (GEQ s93 1) (GEQ s126 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1176 ms.
Product exploration explored 100000 steps with 50000 reset in 954 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TriangularGrid-PT-5046-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-5046-LTLFireability-11 finished in 3591 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)||G(F(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:20:56] [INFO ] Invariant cache hit.
[2024-05-30 03:20:57] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-30 03:20:57] [INFO ] Invariant cache hit.
[2024-05-30 03:20:57] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-30 03:20:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:20:57] [INFO ] Invariant cache hit.
[2024-05-30 03:20:58] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s40 1) (LT s259 1)), p1:(OR (LT s96 1) (LT s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 373 reset in 2166 ms.
Product exploration explored 100000 steps with 388 reset in 1800 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 243 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:03] [INFO ] Invariant cache hit.
[2024-05-30 03:21:03] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-30 03:21:03] [INFO ] Invariant cache hit.
[2024-05-30 03:21:04] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2024-05-30 03:21:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:21:04] [INFO ] Invariant cache hit.
[2024-05-30 03:21:04] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1432 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 108 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 384 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 373 reset in 2053 ms.
Product exploration explored 100000 steps with 402 reset in 1797 ms.
Built C files in :
/tmp/ltsmin894763499701010065
[2024-05-30 03:21:09] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:21:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:09] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:21:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:09] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:21:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin894763499701010065
Running compilation step : cd /tmp/ltsmin894763499701010065;'/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'
Compilation finished in 881 ms.
Running link step : cd /tmp/ltsmin894763499701010065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin894763499701010065;'/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' '--hoa' '/tmp/stateBased8657018513678514416.hoa' '--buchi-type=spotba'
LTSmin run took 3592 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-12 finished in 17296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:14] [INFO ] Invariant cache hit.
[2024-05-30 03:21:14] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-30 03:21:14] [INFO ] Invariant cache hit.
[2024-05-30 03:21:14] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-30 03:21:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 03:21:14] [INFO ] Invariant cache hit.
[2024-05-30 03:21:15] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1047 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s92 1) (GEQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6834 steps with 0 reset in 150 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-13 finished in 1265 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((p0||G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:15] [INFO ] Invariant cache hit.
[2024-05-30 03:21:15] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-30 03:21:15] [INFO ] Invariant cache hit.
[2024-05-30 03:21:16] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-05-30 03:21:16] [INFO ] Invariant cache hit.
[2024-05-30 03:21:16] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1488 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-14 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s82 1) (GEQ s222 1)), p0:(AND (GEQ s8 1) (GEQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 37994 reset in 1536 ms.
Product exploration explored 100000 steps with 38210 reset in 1162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:20] [INFO ] Invariant cache hit.
[2024-05-30 03:21:20] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-30 03:21:20] [INFO ] Invariant cache hit.
[2024-05-30 03:21:21] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-05-30 03:21:21] [INFO ] Invariant cache hit.
[2024-05-30 03:21:21] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 180 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38527 reset in 1492 ms.
Product exploration explored 100000 steps with 38773 reset in 1147 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 19 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:21:25] [INFO ] Invariant cache hit.
[2024-05-30 03:21:25] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin11366248920888697850
[2024-05-30 03:21:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11366248920888697850
Running compilation step : cd /tmp/ltsmin11366248920888697850;'/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'
Compilation finished in 886 ms.
Running link step : cd /tmp/ltsmin11366248920888697850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11366248920888697850;'/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' '--hoa' '/tmp/stateBased3444408348070974078.hoa' '--buchi-type=spotba'
LTSmin run took 1292 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-14 finished in 12595 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((G(p0)||((p2 U p3)&&p1)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:28] [INFO ] Invariant cache hit.
[2024-05-30 03:21:28] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-30 03:21:28] [INFO ] Invariant cache hit.
[2024-05-30 03:21:29] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2024-05-30 03:21:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 03:21:29] [INFO ] Invariant cache hit.
[2024-05-30 03:21:29] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1478 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s156 1) (LT s80 1) (LT s208 1)), p1:(AND (GEQ s63 1) (GEQ s273 1)), p3:(AND (GEQ s17 1) (GEQ s156 1)), p2:(AND (GEQ s80 1) (GEQ s208...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 238 reset in 2047 ms.
Product exploration explored 100000 steps with 236 reset in 1826 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2))))]
Knowledge based reduction with 10 factoid took 521 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-30 03:21:35] [INFO ] Invariant cache hit.
[2024-05-30 03:21:35] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p0) p2 (NOT p3))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p0 p2 (NOT p3))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 769 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:36] [INFO ] Invariant cache hit.
[2024-05-30 03:21:36] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-30 03:21:36] [INFO ] Invariant cache hit.
[2024-05-30 03:21:37] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2024-05-30 03:21:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:21:37] [INFO ] Invariant cache hit.
[2024-05-30 03:21:37] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1476 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 590 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:21:39] [INFO ] Invariant cache hit.
[2024-05-30 03:21:39] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p2 (NOT p3))), (F (OR (AND (NOT p1) p0) (AND p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 5 factoid took 949 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 246 reset in 2058 ms.
Product exploration explored 100000 steps with 236 reset in 1787 ms.
Built C files in :
/tmp/ltsmin16546070491964729559
[2024-05-30 03:21:44] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:21:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:44] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:21:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:44] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:21:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:21:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16546070491964729559
Running compilation step : cd /tmp/ltsmin16546070491964729559;'/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'
Compilation finished in 831 ms.
Running link step : cd /tmp/ltsmin16546070491964729559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16546070491964729559;'/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' '--hoa' '/tmp/stateBased15192029538480906495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:21:59] [INFO ] Invariant cache hit.
[2024-05-30 03:21:59] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-30 03:21:59] [INFO ] Invariant cache hit.
[2024-05-30 03:22:00] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-30 03:22:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:22:00] [INFO ] Invariant cache hit.
[2024-05-30 03:22:00] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1251 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin11374575387475313675
[2024-05-30 03:22:00] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:22:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:22:00] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:22:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:22:00] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:22:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:22:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11374575387475313675
Running compilation step : cd /tmp/ltsmin11374575387475313675;'/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'
Compilation finished in 959 ms.
Running link step : cd /tmp/ltsmin11374575387475313675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11374575387475313675;'/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' '--hoa' '/tmp/stateBased15696528780897499812.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 03:22:16] [INFO ] Flatten gal took : 31 ms
[2024-05-30 03:22:16] [INFO ] Flatten gal took : 25 ms
[2024-05-30 03:22:16] [INFO ] Time to serialize gal into /tmp/LTL8096510441948045029.gal : 6 ms
[2024-05-30 03:22:16] [INFO ] Time to serialize properties into /tmp/LTL18067780583656778811.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/LTL8096510441948045029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16054107098874342761.hoa' '-atoms' '/tmp/LTL18067780583656778811.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/LTL18067780583656778811.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16054107098874342761.hoa
Detected timeout of ITS tools.
[2024-05-30 03:22:31] [INFO ] Flatten gal took : 21 ms
[2024-05-30 03:22:31] [INFO ] Flatten gal took : 21 ms
[2024-05-30 03:22:31] [INFO ] Time to serialize gal into /tmp/LTL5422475972333450181.gal : 4 ms
[2024-05-30 03:22:31] [INFO ] Time to serialize properties into /tmp/LTL14988205091141616402.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5422475972333450181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14988205091141616402.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))"))||(("((pb3_4_5>=1)&&(pol3_4_5>=1))")&&(("((pbl_3_2>=1)&&(po2_3_...203
Formula 0 simplified : G(F!"(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))" & FG(!"((pb3_4_5>=1)&&(pol3_4_5>=1))" | (!"((pbl_3_2>=1)&&(po2_3_1>=...197
Detected timeout of ITS tools.
[2024-05-30 03:22:46] [INFO ] Flatten gal took : 20 ms
[2024-05-30 03:22:46] [INFO ] Applying decomposition
[2024-05-30 03:22:46] [INFO ] Flatten gal took : 18 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/graph11374392966702966486.txt' '-o' '/tmp/graph11374392966702966486.bin' '-w' '/tmp/graph11374392966702966486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11374392966702966486.bin' '-l' '-1' '-v' '-w' '/tmp/graph11374392966702966486.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:22:46] [INFO ] Decomposing Gal with order
[2024-05-30 03:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:22:46] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-30 03:22:46] [INFO ] Flatten gal took : 84 ms
[2024-05-30 03:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 03:22:46] [INFO ] Time to serialize gal into /tmp/LTL7063677435262349371.gal : 13 ms
[2024-05-30 03:22:46] [INFO ] Time to serialize properties into /tmp/LTL2070129680841081681.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/LTL7063677435262349371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2070129680841081681.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 : !((G(F((G("(((i0.i0.u1.pb1_5_2<1)||(i0.i1.u32.pil1_5_3<1))||((i4.i1.u9.pbl_3_2<1)||(i4.i1.u100.po2_3_1<1)))"))||(("((i12.i1.u16.pb3_4_...303
Formula 0 simplified : G(F!"(((i0.i0.u1.pb1_5_2<1)||(i0.i1.u32.pil1_5_3<1))||((i4.i1.u9.pbl_3_2<1)||(i4.i1.u100.po2_3_1<1)))" & FG(!"((i12.i1.u16.pb3_4_5>=...297
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4636824836892775543
[2024-05-30 03:23:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4636824836892775543
Running compilation step : cd /tmp/ltsmin4636824836892775543;'/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'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin4636824836892775543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4636824836892775543;'/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' '[](<>(([]((LTLAPp0==true))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TriangularGrid-PT-5046-LTLFireability-15 finished in 108716 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((G(p0)||((p2 U p3)&&p1)))))'
[2024-05-30 03:23:16] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5285023816632765310
[2024-05-30 03:23:16] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:23:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:23:16] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:23:16] [INFO ] Applying decomposition
[2024-05-30 03:23:16] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:23:16] [INFO ] Flatten gal took : 13 ms
[2024-05-30 03:23:16] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:23:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:23:16] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5285023816632765310
Running compilation step : cd /tmp/ltsmin5285023816632765310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
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/graph18102062856634445163.txt' '-o' '/tmp/graph18102062856634445163.bin' '-w' '/tmp/graph18102062856634445163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18102062856634445163.bin' '-l' '-1' '-v' '-w' '/tmp/graph18102062856634445163.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:23:16] [INFO ] Decomposing Gal with order
[2024-05-30 03:23:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:23:17] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-30 03:23:17] [INFO ] Flatten gal took : 51 ms
[2024-05-30 03:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 03:23:17] [INFO ] Time to serialize gal into /tmp/LTLFireability13481416589406678162.gal : 17 ms
[2024-05-30 03:23:17] [INFO ] Time to serialize properties into /tmp/LTLFireability5248970734279194740.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/LTLFireability13481416589406678162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5248970734279194740.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 1 LTL properties
Checking formula 0 : !((G(F((G("(((i2.i0.u4.pb1_5_2<1)||(i7.u53.pil1_5_3<1))||((i5.i1.u10.pbl_3_2<1)||(i5.i1.u80.po2_3_1<1)))"))||(("((i6.i0.u17.pb3_4_5>=1...295
Formula 0 simplified : G(F!"(((i2.i0.u4.pb1_5_2<1)||(i7.u53.pil1_5_3<1))||((i5.i1.u10.pbl_3_2<1)||(i5.i1.u80.po2_3_1<1)))" & FG(!"((i6.i0.u17.pb3_4_5>=1)&&...289
Compilation finished in 899 ms.
Running link step : cd /tmp/ltsmin5285023816632765310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5285023816632765310;'/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))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-30 03:44:43] [INFO ] Flatten gal took : 36 ms
[2024-05-30 03:44:43] [INFO ] Time to serialize gal into /tmp/LTLFireability15195857976791964549.gal : 20 ms
[2024-05-30 03:44:43] [INFO ] Time to serialize properties into /tmp/LTLFireability574628692660119011.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/LTLFireability15195857976791964549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability574628692660119011.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))"))||(("((pb3_4_5>=1)&&(pol3_4_5>=1))")&&(("((pbl_3_2>=1)&&(po2_3_...203
Formula 0 simplified : G(F!"(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))" & FG(!"((pb3_4_5>=1)&&(pol3_4_5>=1))" | (!"((pbl_3_2>=1)&&(po2_3_1>=...197
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Initializing POR dependencies: labels 244, guards 240
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.807: LTL layer: formula: [](<>(([]((LTLAPp0==true))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.808: "[](<>(([]((LTLAPp0==true))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.808: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.927: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.941: There are 245 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.941: State length is 281, there are 264 groups
pins2lts-mc-linux64( 0/ 8), 0.941: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.941: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.941: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.941: Visible groups: 0 / 264, labels: 4 / 245
pins2lts-mc-linux64( 0/ 8), 0.941: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.941: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.985: [Blue] ~120 levels ~960 states ~1320 transitions
pins2lts-mc-linux64( 2/ 8), 1.099: [Blue] ~240 levels ~1920 states ~4680 transitions
pins2lts-mc-linux64( 0/ 8), 1.984: [Blue] ~480 levels ~3840 states ~38144 transitions
pins2lts-mc-linux64( 7/ 8), 3.085: [Blue] ~960 levels ~7680 states ~123960 transitions
pins2lts-mc-linux64( 3/ 8), 3.591: [Blue] ~1920 levels ~15360 states ~183112 transitions
pins2lts-mc-linux64( 5/ 8), 3.994: [Blue] ~1510 levels ~30720 states ~208504 transitions
pins2lts-mc-linux64( 5/ 8), 4.633: [Blue] ~1930 levels ~61440 states ~257376 transitions
pins2lts-mc-linux64( 5/ 8), 5.768: [Blue] ~2069 levels ~122880 states ~359800 transitions
pins2lts-mc-linux64( 4/ 8), 8.067: [Blue] ~6663 levels ~245760 states ~676864 transitions
pins2lts-mc-linux64( 5/ 8), 12.399: [Blue] ~5374 levels ~491520 states ~888024 transitions
pins2lts-mc-linux64( 5/ 8), 20.368: [Blue] ~6778 levels ~983040 states ~1563176 transitions
pins2lts-mc-linux64( 2/ 8), 35.965: [Blue] ~4710 levels ~1966080 states ~5396584 transitions
pins2lts-mc-linux64( 5/ 8), 70.019: [Blue] ~23358 levels ~3932160 states ~5377000 transitions
pins2lts-mc-linux64( 2/ 8), 139.702: [Blue] ~7385 levels ~7864320 states ~19263160 transitions
pins2lts-mc-linux64( 2/ 8), 277.933: [Blue] ~8430 levels ~15728640 states ~37871792 transitions
pins2lts-mc-linux64( 2/ 8), 551.164: [Blue] ~8470 levels ~31457280 states ~75487848 transitions
pins2lts-mc-linux64( 2/ 8), 1116.402: [Blue] ~8610 levels ~62914560 states ~148823696 transitions
pins2lts-mc-linux64( 3/ 8), 1815.286: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1815.332:
pins2lts-mc-linux64( 0/ 8), 1815.332: Explored 77064796 states 116902980 transitions, fanout: 1.517
pins2lts-mc-linux64( 0/ 8), 1815.332: Total exploration time 1814.380 sec (1814.320 sec minimum, 1814.346 sec on average)
pins2lts-mc-linux64( 0/ 8), 1815.332: States per second: 42474, Transitions per second: 64431
pins2lts-mc-linux64( 0/ 8), 1815.332:
pins2lts-mc-linux64( 0/ 8), 1815.332: State space has 80311283 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1815.332: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1815.332: blue states: 77064796 (95.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1815.332: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1815.332: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1815.332:
pins2lts-mc-linux64( 0/ 8), 1815.332: Total memory used for local state coloring: 176.0MB
pins2lts-mc-linux64( 0/ 8), 1815.332:
pins2lts-mc-linux64( 0/ 8), 1815.333: Queue width: 8B, total height: 11532895, memory: 87.99MB
pins2lts-mc-linux64( 0/ 8), 1815.333: Tree memory: 868.7MB, 11.3 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1815.333: Tree fill ratio (roots/leafs): 59.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1815.333: Stored 240 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1815.333: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1815.333: Est. total memory use: 956.7MB (~1112.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5285023816632765310;'/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))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5285023816632765310;'/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))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-30 04:06:12] [INFO ] Flatten gal took : 569 ms
[2024-05-30 04:06:15] [INFO ] Input system was already deterministic with 240 transitions.
[2024-05-30 04:06:15] [INFO ] Transformed 280 places.
[2024-05-30 04:06:15] [INFO ] Transformed 240 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 04:06:15] [INFO ] Time to serialize gal into /tmp/LTLFireability14211565501070132431.gal : 31 ms
[2024-05-30 04:06:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14244627992808674110.ltl : 5 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/LTLFireability14211565501070132431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14244627992808674110.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((G("(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))"))||(("((pb3_4_5>=1)&&(pol3_4_5>=1))")&&(("((pbl_3_2>=1)&&(po2_3_...203
Formula 0 simplified : G(F!"(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))" & FG(!"((pb3_4_5>=1)&&(pol3_4_5>=1))" | (!"((pbl_3_2>=1)&&(po2_3_1>=...197
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3972248 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15819944 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="TriangularGrid-PT-5046"
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 TriangularGrid-PT-5046, 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 r439-smll-171690585700168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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